이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "minerals.h"
#include <vector>
#include <stdio.h>
//using namespace std;
int ans[86005]={0};
bool have[86005];
int cha[86005];
void Solve(int N)
{
int x=0,y,i,j,now=1;
for(i=1;i<=2*N;i++)
{
y=Query(i);
if(y-x==0)
{
cha[now++]=i;
have[i]=1;
}
x=y;
}
for(i=1;i<=2*N;i++)
{
Query(i);
if(have[i]==0) cha[now++]=i;
}
for(i=0;i<14;i++)
{
for(j=1;j<=N;j++) if(j&(1<<i)) x=Query(cha[j]);
for(j=1;j<=N;j++)
{
y=Query(cha[j+N]);
if(y-x==0) ans[j]+=(1<<i);
x=y;
}
for(j=1;j<=N;j++) if(j&(1<<i)) x=Query(cha[j]);
for(j=1;j<=N;j++) x=Query(cha[j+N]);
}
for(i=1;i<=N;i++)
{
//printf("%d %d\n",i+N,ans[i]);
Answer(cha[i+N],cha[ans[i]]);
}
}
# | 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... |