이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "minerals.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz(a) ((ll)(a).size())
using namespace std;
void Solve(int n)
{
ll crr=0;
vector <ll> A, B, a(n*2+1, 0);
auto flip=[&](ll idx)
{
ll x=Query(idx)-crr;
crr+=x, a[idx]^=1; return x;
};
for (ll i=1; i<=n*2; i++)
{
if (flip(i)) A.pb(i);
else B.pb(i);
}
function <void(vector <ll>, vector <ll>, bool)>
solve=[&](vector <ll> L, vector <ll> R, bool cr)
{
ll n=sz(L);
if (n==1) {Answer(L[0], R[0]); return;}
vector <ll> left, right;
for (ll i=0; i<n/2; i++) flip(L[i]);
for (ll i:R) (a[i]^(a[i]+flip(i))^cr?right:left).pb(i);
solve(vector <ll> (L.begin(), L.begin()+n/2), left, cr^1);
solve(vector <ll> (L.begin()+n/2, L.end()), right, cr);
}; solve(A, B, 1);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |