oj.uz

Submission #814755

# Submission time Handle Problem Language Result Execution time Memory
814755 2023-08-08T09:37:57 Z marvinthang Ancient Machine 2 (JOI23_ancient2) C++17
37 / 100
 107 ms 424 KB 
/*************************************
*    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

string Solve(int N) {
	string res;
	int mid = N / 2;
	int m = mid + 2;
	vector <int> a(m), b(m);
	string left, right;
	auto query = [&] {
		return Query(m, a, b);
	};
	REP(i, mid) {
		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;
		left += char('0' + (query() == i + 2));
	}
	a[0] = a[1] = 0;
	b[0] = b[1] = 1;
	right += char('0' + query());
	FORD(i, N - 1, mid) {
		right = '0' + right;
		int sz = right.size();
		vector <int> kmp(sz + 1);
		vector <array <int, 2>> nxt(sz + 1);
		nxt[0][right[0] - '0'] = 1;
		FORE(i, 1, sz) {
			if (i > 1) kmp[i] = nxt[kmp[i - 1]][right[i - 1] - '0'];
			REP(j, 2) nxt[i][j] = j == right[i] - '0' ? i + 1 : nxt[kmp[i]][j];
		}
		REP(i, sz + 1) {
			a[i] = nxt[i][0];
			b[i] = nxt[i][1];
		}
		if (query() != sz) right[0] = '1';
	}
	return left + right;
}

#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

Subtask #1
37.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 88 ms 304 KB Output is partially correct
2 Partially correct 81 ms 324 KB Output is partially correct
3 Partially correct 94 ms 300 KB Output is partially correct
4 Partially correct 82 ms 336 KB Output is partially correct
5 Partially correct 79 ms 316 KB Output is partially correct
6 Partially correct 82 ms 324 KB Output is partially correct
7 Partially correct 90 ms 308 KB Output is partially correct
8 Partially correct 98 ms 288 KB Output is partially correct
9 Partially correct 88 ms 300 KB Output is partially correct
10 Partially correct 77 ms 300 KB Output is partially correct
11 Partially correct 103 ms 284 KB Output is partially correct
12 Partially correct 75 ms 284 KB Output is partially correct
13 Partially correct 100 ms 328 KB Output is partially correct
14 Partially correct 76 ms 304 KB Output is partially correct
15 Partially correct 87 ms 336 KB Output is partially correct
16 Partially correct 90 ms 328 KB Output is partially correct
17 Partially correct 75 ms 332 KB Output is partially correct
18 Partially correct 74 ms 332 KB Output is partially correct
19 Partially correct 75 ms 328 KB Output is partially correct
20 Partially correct 72 ms 288 KB Output is partially correct
21 Partially correct 82 ms 344 KB Output is partially correct
22 Partially correct 88 ms 296 KB Output is partially correct
23 Partially correct 78 ms 292 KB Output is partially correct
24 Partially correct 73 ms 320 KB Output is partially correct
25 Partially correct 74 ms 328 KB Output is partially correct
26 Partially correct 93 ms 292 KB Output is partially correct
27 Partially correct 89 ms 284 KB Output is partially correct
28 Partially correct 73 ms 332 KB Output is partially correct
29 Partially correct 79 ms 324 KB Output is partially correct
30 Partially correct 89 ms 288 KB Output is partially correct
31 Partially correct 103 ms 320 KB Output is partially correct
32 Partially correct 74 ms 284 KB Output is partially correct
33 Partially correct 87 ms 320 KB Output is partially correct
34 Partially correct 107 ms 316 KB Output is partially correct
35 Partially correct 83 ms 284 KB Output is partially correct
36 Partially correct 83 ms 296 KB Output is partially correct
37 Partially correct 86 ms 292 KB Output is partially correct
38 Partially correct 74 ms 284 KB Output is partially correct
39 Partially correct 76 ms 336 KB Output is partially correct
40 Partially correct 76 ms 332 KB Output is partially correct
41 Partially correct 92 ms 328 KB Output is partially correct
42 Partially correct 88 ms 328 KB Output is partially correct
43 Partially correct 81 ms 324 KB Output is partially correct
44 Partially correct 74 ms 300 KB Output is partially correct
45 Partially correct 84 ms 328 KB Output is partially correct
46 Partially correct 76 ms 288 KB Output is partially correct
47 Partially correct 86 ms 332 KB Output is partially correct
48 Partially correct 90 ms 332 KB Output is partially correct
49 Partially correct 87 ms 324 KB Output is partially correct
50 Partially correct 90 ms 424 KB Output is partially correct
51 Partially correct 80 ms 308 KB Output is partially correct
52 Partially correct 80 ms 292 KB Output is partially correct
53 Partially correct 87 ms 300 KB Output is partially correct
54 Partially correct 78 ms 284 KB Output is partially correct
55 Partially correct 76 ms 288 KB Output is partially correct
56 Partially correct 75 ms 296 KB Output is partially correct
57 Partially correct 96 ms 304 KB Output is partially correct
58 Partially correct 76 ms 328 KB Output is partially correct
59 Partially correct 72 ms 304 KB Output is partially correct
60 Partially correct 81 ms 300 KB Output is partially correct
61 Partially correct 74 ms 292 KB Output is partially correct
62 Partially correct 93 ms 288 KB Output is partially correct
63 Partially correct 85 ms 296 KB Output is partially correct