# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582034 | Abdulmohsen1284 | Library (JOI18_library) | C++14 | 523 ms | 328 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 <cstdio>
#include <vector>
#include "library.h"
#include"bits/stdc++.h"
using namespace std;
long long s=0;
vector <int> em;
vector <int> rec(long long cur,vector <int> &grp)
{
long long sum=0;
for(int i=0;i<(int)grp.size();i++)
{
if(grp[i]==1)
sum++;
}
if(s==0)
Answer(em);
vector <int> on=em,tw=em;
long long took=0;
for(int i=0;took<sum/2;i++)
{
if(i>=(int)grp.size())
break;
if(grp[i]==1)
{
took++;
on[i]=grp[i];
}
}
for(int i=0;i<(int)grp.size();i++)
{
if((grp[i]^on[i])==1)
tw[i]=1;
}
//grp.clear();
long long ch=Query(on);
on[cur-1]=1;
if(ch==Query(on))
{
on[cur-1]=0;
return on;
}
else
{
return tw;
}
}
void Solve(int N)
{
if(N==1)
{
em.push_back(1);
Answer(em);
return;
}
for(int i=1;i<=N;i++)
em.push_back(0);
for(int i=1;i<=N;i++)
{
vector <int> ask=em;
for(int j=1;j<=N;j++)
{
if(i==j)
continue;
ask[j-1]=1;
}
long long ans=Query(ask);
if(ans==1)
{
s=i;
break;
}
}
vector <int> ret,lef=em;
ret.push_back(s);
for(int i=1;i<=N;i++)
{
if(s==i)
continue;
lef[i-1]=1;
}
for(int i=1;i<N;i++)
{
vector <int> gr=lef;
while(0==0)
{
long long sum=0;
for(int j=0;j<gr.size();j++)
{
sum+=gr[j];
}
if(sum==1)
{
for(int j=0;j<gr.size();j++)
{
if(gr[j]==1)
{
s=j+1;
}
}
break;
}
else
gr=rec(s,gr);
}
ret.push_back(s);
lef[s-1]=0;
}
Answer(ret);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |