# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899033 | jamjanek | Ancient Machine 2 (JOI23_ancient2) | C++17 | 90 ms | 1588 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;
bool prefix(int k){
int m = k+1+2;
vector<int>a(m), b(m);
for(int i=0;i<k;i++){
a[i] = i+1;
b[i] = i+1;
}
a[k] = k+1;
b[k] = k+2;
a[k+2] = k+2;
b[k+2] = k+2;
a[k+1] = k+1;
b[k+1] = k+1;
return Query(m,a,b)==(k+2);
}
string Solve(int N) {
string s;
while((int)s.size()<N){
s.push_back('0'+prefix(s.size()));
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |