# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810967 | taher | Ancient Machine 2 (JOI23_ancient2) | C++17 | 182 ms | 540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ancient2.h"
#include <bits/stdc++.h>
using namespace std;
string Solve(int N) {
string s;
const int M = 1002;
vector<int> a(M);
vector<int> b(M);
a[0] = 1;
a[1] = 1;
b[1] = 1;
b[0] = 2;
b[2] = 2;
a[2] = 2;
for (int i = 0; i < N - 1; i++) {
int ret = Query(M, a, b);
if (ret == i + 1) {
s += '0';
a[i] = i + 1;
} else {
s += '1';
b[i] = i + 1;
}
a[i + 1] = i + 2;
a[i + 2] = i + 2;
b[i + 2] = i + 2;
b[i + 1] = i + 3;
b[i + 3] = i + 3;
a[i + 3] = i + 3;
}
a.assign(M, 0);
b.assign(M, 1);
int ret = Query(M, a, b);
s += (ret + '0');
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |