lyc
/
acm
1
1
Fork 0
Code Issues Pull Requests Releases Activity

Wed, 15 Jan 2020 21:53:49 GMT

Browse Source
master
大蒟蒻 6 years ago
parent 88be57870e
commit 4b69472bce
3 changed files with 344 additions and 0 deletions
Show Stats Download Patch File Download Diff File

172
Article6/3.1/1035.cpp
Unescape View File

@ -0,0 +1,172 @@
#define _CRT_SECURE_NO_WARNINGS
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
#ifdef ONLINE_JUDGE
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
typedef long long int64_t;
typedef unsigned long long uint64_t;
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define CRP(t, x) const t &x
#define OPX(op, t, x) operator op(CRP(t, x))
#define OPL(t, x) bool OPX(<, t, x) const
#define FIL(x, v) memset(x, v, sizeof(x))
#define CLR(x) FIL(x, 0)
#define NE1(x) FIL(x, -1)
#define INF(x) FIL(x, 0x3f)
#ifndef _DEBUG
#define _DEBUG 0
#endif // !_DEBUG
#define IFD if (_DEBUG)
typedef int64_t ll, i64;
typedef uint64_t ull, u64;
inline char getchar(int)
{
static char buf[64 << 20], *S = buf, *T = buf;
if (S == T) T = fread(S = buf, 1, 64 << 20, stdin) + buf;
return S == T ? EOF : *S++;
}
template <typename T>
inline bool read(T &x)
{
int ch = x = 0, f = 1;
while (!isdigit(ch = getchar()))
if (ch == EOF)
return false;
else if (ch == '-')
f = 0;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return x = f ? x : -x, true;
}
template <typename T1, typename T2>
inline bool read(T1 &v1, T2 &v2) { return read(v1) && read(v2); }
template <typename T1, typename T2, typename T3>
inline bool read(T1 &v1, T2 &v2, T3 &v3) { return read(v1) && read(v2) && read(v3); }
template <typename T1, typename T2, typename T3, typename T4>
inline bool read(T1 &v1, T2 &v2, T3 &v3, T4 &v4) { return read(v1) && read(v2) && read(v3) && read(v4); }
template <typename T1, typename T2, typename T3, typename T4, typename T5>
inline bool read(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5) { return read(v1) && read(v2) && read(v3) && read(v4) && read(v5); }
inline ll gcd(ll a, ll b)
{
for (; b; swap(a, b)) a %= b;
return a;
}
inline ll fpow(ll a, ll b, ll m)
{
ll r = 1;
for (; b; b >>= 1, a = a * a % m)
if (b & 1) r = r * a % m;
return r;
}
const double eps = 1e-8;
inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; }
char dict[10050][19], buf[19];
int dict_size, len[10050];
int main()
{
for (;; dict_size++)
{
scanf("%s", dict[dict_size]);
len[dict_size] = strlen(dict[dict_size]);
if (len[dict_size] == 1 && *dict[dict_size] == '#') break;
}
vector<int> ans;
while (~scanf("%s", buf))
{
ans.clear();
int n = strlen(buf);
if (n == 1 && *buf == '#') break;
bool flag = false;
for (int i = 0; i < dict_size && !flag; i++)
{
if (len[i] == n - 1)
{
bool fl1 = true, fl2 = true;
for (int j = 0, k = 0; j < n - 1 && k < n; j++, k++)
{
if (dict[i][j] != buf[k] && fl2) fl2 = false, k++;
if (dict[i][j] != buf[k]) fl1 = false;
}
if (fl1) ans.push_back(i);
}
if (len[i] == n)
{
int difcnt = 0;
for (int j = 0; j < n; j++)
if (buf[j] != dict[i][j]) difcnt++;
if (difcnt == 0) flag = true;
if (difcnt == 1) ans.push_back(i);
}
if (len[i] == n + 1)
{
bool fl1 = true, fl2 = true;
for (int j = 0, k = 0; j < n + 1 && k < n; j++, k++)
{
if (dict[i][j] != buf[k] && fl2) fl2 = false, j++;
if (dict[i][j] != buf[k]) fl1 = false;
}
if (fl1) ans.push_back(i);
}
}
printf("%s", buf);
if (flag)
puts(" is correct");
else
{
printf(":");
for (int i = 0; i < ans.size(); i++)
printf(" %s", dict[ans[i]]);
putchar('\n');
}
}
return 0;
}

124
Article6/3.1/3080.cpp
Unescape View File

@ -0,0 +1,124 @@
#define _CRT_SECURE_NO_WARNINGS
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
#ifdef ONLINE_JUDGE
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
typedef long long int64_t;
typedef unsigned long long uint64_t;
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define CRP(t, x) const t &x
#define OPX(op, t, x) operator op(CRP(t, x))
#define OPL(t, x) bool OPX(<, t, x) const
#define FIL(x, v) memset(x, v, sizeof(x))
#define CLR(x) FIL(x, 0)
#define NE1(x) FIL(x, -1)
#define INF(x) FIL(x, 0x3f)
#ifndef _DEBUG
#define _DEBUG 0
#endif // !_DEBUG
#define IFD if (_DEBUG)
typedef int64_t ll, i64;
typedef uint64_t ull, u64;
inline char getchar(int)
{
static char buf[64 << 20], *S = buf, *T = buf;
if (S == T) T = fread(S = buf, 1, 64 << 20, stdin) + buf;
return S == T ? EOF : *S++;
}
template <typename T>
inline bool read(T &x)
{
int ch = x = 0, f = 1;
while (!isdigit(ch = getchar()))
if (ch == EOF)
return false;
else if (ch == '-')
f = 0;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return x = f ? x : -x, true;
}
template <typename T1, typename T2>
inline bool read(T1 &v1, T2 &v2) { return read(v1) && read(v2); }
template <typename T1, typename T2, typename T3>
inline bool read(T1 &v1, T2 &v2, T3 &v3) { return read(v1) && read(v2) && read(v3); }
template <typename T1, typename T2, typename T3, typename T4>
inline bool read(T1 &v1, T2 &v2, T3 &v3, T4 &v4) { return read(v1) && read(v2) && read(v3) && read(v4); }
template <typename T1, typename T2, typename T3, typename T4, typename T5>
inline bool read(T1 &v1, T2 &v2, T3 &v3, T4 &v4, T5 &v5) { return read(v1) && read(v2) && read(v3) && read(v4) && read(v5); }
inline ll gcd(ll a, ll b)
{
for (; b; swap(a, b)) a %= b;
return a;
}
inline ll fpow(ll a, ll b, ll m)
{
ll r = 1;
for (; b; b >>= 1, a = a * a % m)
if (b & 1) r = r * a % m;
return r;
}
const double eps = 1e-8;
inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; }
char s[11][65];
int main()
{
int T, m;
read(T);
while (T--)
{
read(m);
for (int i = 0; i < m; i++) scanf("%s", s[i]);
int n = strlen(*s);
}
return 0;
}

48
Codeforces/1286A.cpp
Unescape View File

@ -63,9 +63,57 @@ inline ll fpow(ll a, ll b, ll m)
}
constexpr double eps = 1e-8;
inline int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0; }
int a[105];
int main()
{
int n;
read(n);
for (int i = 0; i < n; i++) read(a[i]);
int c[2];
c[0] = n >> 1, c[1] = n - c[0];
vector<pair<int, int>> zseg, bseg;
for (int i = 0; i < n;)
if (a[i] == 0)
{
int j = i;
while (j < n && a[j] == 0) j++;
zseg.push_back({i, j});
i = j;
}
else
c[a[i++] & 1]--;
int ans = 0;
for (int i = 1; i < n; i++)
if (a[i - 1] && a[i] && ((a[i - 1] ^ a[i]) & 1)) ans++;
if (zseg.size() == 0) return printf("%d", ans), 0;
if (zseg.size() == 1 && zseg.front().first == 0 && zseg.front().second == n)
return puts(n == 1 ? "0" : "1"), 0;
for (CRP(auto, seg) : zseg)
if (seg.first != 0 && seg.second != n)
if ((a[seg.first - 1] ^ a[seg.second]) & 1 ^ 1)
bseg.push_back(seg);
else
ans++;
sort(bseg.begin(), bseg.end(), [](CRP(auto, l), CRP(auto, r)) { return l.second - l.first < r.second - r.first; });
for (CRP(auto, seg) : bseg)
{
if (c[a[seg.second] & 1] >= seg.second - seg.first)
c[a[seg.second] & 1] -= seg.second - seg.first;
else
ans += 2;
}
CRP(auto, fr) = *zseg.begin();
if (fr.first == 0)
if (c[a[fr.second] & 1] >= fr.second - fr.first)
c[a[fr.second] & 1] -= fr.second - fr.first;
else
ans++;
CRP(auto, la) = *zseg.rbegin();
if (la.second == n)
if (c[a[la.first - 1] & 1] >= la.second - la.first)
c[a[la.first - 1] & 1] -= la.second - la.first;
else
ans++;
printf("%d", ans);
return 0;
}
Write Preview
Loading…
Cancel
Save