#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=5e4+5;
int p, c;
vector<int> l, r;
int update(int x)
{
p=Query(x);
swap(c, p);
return c!=p;
}
void solve(vector<int> &l, vector<int> &r, int t)
{
int sz=l.size();
if (sz==1) return Answer(l[0], r[0]), void();
int md=(sz-1)/2;
vector<int> l1, l2, r1, r2;
for (int i=0; i<=md; i++) l1.push_back(l[i]), update(l[i]);
for (int i=md+1; i<sz; i++) r1.push_back(l[i]);
for (int i=0; i<sz; i++)
{
if (update(r[i])==t) l2.push_back(r[i]);
else r2.push_back(r[i]);
}
//cout<<"debug "<<l1.size()<<' '<<l2.size()<<' '<<r1.size()<<' '<<r2.size()<<'\n';
solve(l1, l2, 0); solve(r1, r2, 1);
}
void Solve(int N) {
for (int i=1; i<=2*N; i++)
{
if (update(i)) l.push_back(i);
else r.push_back(i);
}
solve(l, r, 1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |