/*************************************
* author: marvinthang *
* created: 08.08.2023 11:02:57 *
*************************************/
#include "ancient2.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
namespace {
} // namespace
#define Bitset bitset <800>
string Solve(int N) {
int m = 102;
int l = m - 2;
int r = N - m + 1;
vector <int> a(m), b(m);
auto query = [&] {
return Query(m, a, b);
};
string res(N, '0');
REP(i, l) {
REP(j, i) a[j] = b[j] = j + 1;
a[i] = i + 1;
b[i] = i + 2;
a[i + 1] = b[i + 1] = i + 1;
a[i + 2] = b[i + 2] = i + 2;
res[i] += query() == i + 2;
}
FORD(i, N, r) {
int sz = N - i;
vector <int> kmp(sz + 1);
vector <array <int, 2>> nxt(sz + 1);
nxt[0][0] = 1;
FORE(j, 1, sz) {
if (j > 1) kmp[j] = nxt[kmp[j - 1]][res[i + j - 1] - '0'];
REP(k, 2) nxt[j][k] = k == res[i + j] - '0' ? j + 1 : nxt[kmp[j]][k];
}
REP(i, sz + 1) {
a[i] = nxt[i][0];
b[i] = nxt[i][1];
}
res[i] += query() != sz;
}
int sz = r - l;
vector <Bitset> basis(sz);
auto Insert = [&] (Bitset bs) {
REP(i, sz) if (bs[i]) {
if (basis[i].none()) {
basis[i] = bs;
return true;
}
bs ^= basis[i];
}
return false;
};
int P = 51;
vector <tuple <int, int>> ask;
vector <Bitset> bp;
ask.reserve(sz);
bp.reserve(sz);
FORE(p, 1, P) REP(q, p) {
Bitset bs;
for (int i = (l - q + p - 1) / p * p + q; i < r; i += p) bs[i - l] = 1;
if (Insert(bs)) {
ask.emplace_back(p, q);
bp.push_back(bs);
if (ask.size() == sz) break;
}
}
REP(i, ask.size()) {
auto [p, q] = ask[i];
REP(i, p) {
a[i] = i + 1 == p ? 0 : i + 1;
a[i + p] = a[i] + p;
}
b = a;
swap(b[q], b[p + q]);
int v = query() >= p;
for (int i = q; i < N; i += p) v ^= res[i] - '0';
bp[i][sz] = v;
}
REP(i, sz) {
FOR(j, i, sz) if (bp[j][i]) {
swap(bp[i], bp[j]);
break;
}
if (!bp[i][i]) {
debug(i);
return res;
}
REP(j, sz) if (j != i && bp[j][i]) bp[j] ^= bp[i];
}
REP(i, sz) res[i + l] += bp[i][sz];
return res;
}
#ifdef LOCAL
namespace {
constexpr int N_MAX = 1000;
constexpr int M_MAX = 1002;
constexpr int Q_MAX = 1000;
int N;
char S[N_MAX + 1];
int query_count = 0;
int query_m_max = 0;
void WrongAnswer(int code) {
printf("Wrong Answer [%d]\n", code);
exit(0);
}
} // namespace
int Query(int m, std::vector<int> a, std::vector<int> b) {
if (++query_count > Q_MAX) WrongAnswer(7);
if (!(1 <= m && m <= M_MAX)) WrongAnswer(4);
if ((int)a.size() != m || (int)b.size() != m) WrongAnswer(5);
for (int i = 0; i < m; i++) {
if (!(0 <= a[i] && a[i] <= m - 1) || !(0 <= b[i] && b[i] <= m - 1))
WrongAnswer(6);
}
if (m > query_m_max) query_m_max = m;
int memory = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
memory = a[memory];
}
if (S[i] == '1') {
memory = b[memory];
}
}
return memory;
}
int main() {
file("ancient2");
if (scanf("%d", &N) != 1) {
fprintf(stderr, "Error while reading input.\n");
exit(1);
}
if (scanf("%s", S) != 1) {
fprintf(stderr, "Error while reading input.\n");
exit(1);
}
std::string s = Solve(N);
if ((int)s.size() != N) WrongAnswer(1);
for (int i = 0; i < N; i++) {
if (!(s[i] == '0' || s[i] == '1')) WrongAnswer(2);
}
for (int i = 0; i < N; i++) {
if (s[i] != S[i]) WrongAnswer(-i);
}
printf("Accepted: %d\n", query_m_max);
printf("Point: %d\n", 10 + (1002 - query_m_max) * (1002 - query_m_max) / 9000);
return 0;
}
#endif
Compilation message
ancient2.cpp: In function 'std::string Solve(int)':
ancient2.cpp:116:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
116 | if (ask.size() == sz) break;
| ~~~~~~~~~~~^~~~~
ancient2.cpp:34:24: warning: statement has no effect [-Wunused-value]
34 | #define debug(...) 23
| ^~
ancient2.cpp:139:4: note: in expansion of macro 'debug'
139 | debug(i);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
468 KB |
Output is correct |
| 2 |
Correct |
35 ms |
472 KB |
Output is correct |
| 3 |
Correct |
33 ms |
464 KB |
Output is correct |
| 4 |
Correct |
30 ms |
464 KB |
Output is correct |
| 5 |
Correct |
44 ms |
464 KB |
Output is correct |
| 6 |
Correct |
43 ms |
472 KB |
Output is correct |
| 7 |
Correct |
30 ms |
468 KB |
Output is correct |
| 8 |
Correct |
29 ms |
464 KB |
Output is correct |
| 9 |
Correct |
30 ms |
472 KB |
Output is correct |
| 10 |
Correct |
29 ms |
472 KB |
Output is correct |
| 11 |
Correct |
38 ms |
432 KB |
Output is correct |
| 12 |
Correct |
29 ms |
472 KB |
Output is correct |
| 13 |
Correct |
29 ms |
464 KB |
Output is correct |
| 14 |
Correct |
32 ms |
440 KB |
Output is correct |
| 15 |
Correct |
33 ms |
472 KB |
Output is correct |
| 16 |
Correct |
32 ms |
472 KB |
Output is correct |
| 17 |
Correct |
37 ms |
464 KB |
Output is correct |
| 18 |
Correct |
30 ms |
428 KB |
Output is correct |
| 19 |
Correct |
35 ms |
488 KB |
Output is correct |
| 20 |
Correct |
30 ms |
476 KB |
Output is correct |
| 21 |
Correct |
28 ms |
468 KB |
Output is correct |
| 22 |
Correct |
29 ms |
420 KB |
Output is correct |
| 23 |
Correct |
31 ms |
472 KB |
Output is correct |
| 24 |
Correct |
29 ms |
484 KB |
Output is correct |
| 25 |
Correct |
37 ms |
468 KB |
Output is correct |
| 26 |
Correct |
26 ms |
436 KB |
Output is correct |
| 27 |
Correct |
29 ms |
464 KB |
Output is correct |
| 28 |
Correct |
39 ms |
464 KB |
Output is correct |
| 29 |
Correct |
31 ms |
476 KB |
Output is correct |
| 30 |
Correct |
28 ms |
472 KB |
Output is correct |
| 31 |
Correct |
30 ms |
472 KB |
Output is correct |
| 32 |
Correct |
38 ms |
464 KB |
Output is correct |
| 33 |
Correct |
28 ms |
468 KB |
Output is correct |
| 34 |
Correct |
39 ms |
472 KB |
Output is correct |
| 35 |
Correct |
29 ms |
464 KB |
Output is correct |
| 36 |
Correct |
30 ms |
476 KB |
Output is correct |
| 37 |
Correct |
35 ms |
428 KB |
Output is correct |
| 38 |
Correct |
29 ms |
484 KB |
Output is correct |
| 39 |
Correct |
29 ms |
432 KB |
Output is correct |
| 40 |
Correct |
29 ms |
432 KB |
Output is correct |
| 41 |
Correct |
30 ms |
464 KB |
Output is correct |
| 42 |
Correct |
29 ms |
432 KB |
Output is correct |
| 43 |
Correct |
34 ms |
516 KB |
Output is correct |
| 44 |
Correct |
37 ms |
472 KB |
Output is correct |
| 45 |
Correct |
30 ms |
468 KB |
Output is correct |
| 46 |
Correct |
30 ms |
476 KB |
Output is correct |
| 47 |
Correct |
30 ms |
464 KB |
Output is correct |
| 48 |
Correct |
29 ms |
428 KB |
Output is correct |
| 49 |
Correct |
30 ms |
584 KB |
Output is correct |
| 50 |
Correct |
29 ms |
472 KB |
Output is correct |
| 51 |
Correct |
29 ms |
476 KB |
Output is correct |
| 52 |
Correct |
29 ms |
464 KB |
Output is correct |
| 53 |
Correct |
29 ms |
468 KB |
Output is correct |
| 54 |
Correct |
36 ms |
472 KB |
Output is correct |
| 55 |
Correct |
29 ms |
436 KB |
Output is correct |
| 56 |
Correct |
31 ms |
464 KB |
Output is correct |
| 57 |
Correct |
29 ms |
464 KB |
Output is correct |
| 58 |
Correct |
29 ms |
468 KB |
Output is correct |
| 59 |
Correct |
29 ms |
424 KB |
Output is correct |
| 60 |
Correct |
29 ms |
436 KB |
Output is correct |
| 61 |
Correct |
28 ms |
464 KB |
Output is correct |
| 62 |
Correct |
35 ms |
488 KB |
Output is correct |
| 63 |
Correct |
38 ms |
480 KB |
Output is correct |
