# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503167 | leinad2 | Minerals (JOI19_minerals) | C++17 | 0 ms | 0 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 "minerals.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>A;
vector<vector<int> >v;
int a;
void solve()
{
bool flag=true;print(v);
for(int i=0;i<v.size();i++)if(v[i].size()>=2)flag=false;
if(flag)return;
int sz=0;
for(int i=0;i<v.size();i++)
{
if(v[i].size()==1)
{
sz++;
continue;
}
if(i%2==0)
{
for(int j=sz+(v[i].size()+1)/2;j<sz+v[i].size();j++)a=Query(A[j]);
}
else
{
for(int j=sz;j<sz+(v[i].size()+1)/2;j++)a=Query(A[j]);
}
sz+=v[i].size();
}
vector<vector<int> >V;
for(int i=0;i<v.size();i++)
{
vector<int>Fi, Se;
if(v[i].size()==1)
{
V.push_back(v[i]);
continue;
}
for(auto p:v[i])
{
int b=Query(p);
if(a!=b)Se.push_back(p);
else Fi.push_back(p);
a=b;
}
V.push_back(Fi);
V.push_back(Se);
}
v=V;
solve();
}
void Solve(int N)
{
vector<int>A, B;
for(int i=1;i<=2*N;i++)
{
int b=Query(i);
if(a!=b)A.push_back(i);
else B.push_back(i);
a=b;
}
::A=A;
v={B};
solve();
vector<int>ans;
for(int i=0;i<v.size();i++)if(v[i].size())ans.push_back(v[i][0]);
for(int i=0;i<N;i++)Answer(A[i], ans[i]);
}