제출 #376757

#제출 시각아이디문제언어결과실행 시간메모리
376757daniel920712Minerals (JOI19_minerals)C++14
40 / 100
20 ms1772 KiB
#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<16;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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...