# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965110 | pcc | Ancient Machine 2 (JOI23_ancient2) | C++17 | 89 ms | 1656 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>
#include <string>
#include <vector>
using namespace std;
namespace {
int variable_example = 1;
} // namespace
/*
int m = 2;
std::vector<int> a(m), b(m);
a[0] = 0;
a[1] = 1;
b[0] = 0;
b[1] = 1;
variable_example = Query(m, a, b);
std::string s(N, '0');
s[0] = '1';
return s;
*/
std::string Solve(int N) {
string ans;
vector<int> v[2];
for(int i = 0;i<N;i++){
v[0].clear();v[1].clear();
for(int j = 1;j<=i;j++){
v[0].push_back(j);v[1].push_back(j);
}
v[0].push_back(i+1);v[1].push_back(i+2);
v[0].push_back(i+1);v[1].push_back(i+1);
v[0].push_back(i+2);v[1].push_back(i+2);
int re = Query(v[0].size(),v[0],v[1]);
if(re == i+1)ans += '0';
else ans += '1';
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |