제출 #1298740

#제출 시각아이디문제언어결과실행 시간메모리
1298740gesp3011v2스핑크스 (IOI24_sphinx)C++20
26.50 / 100
13 ms648 KiB
#include<bits/stdc++.h> #include "sphinx.h" using namespace std; vector<int> D,ans; std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y){ D.resize(N); ans.resize(N); if(N<=50){ for(int u=0;u<N;u++){ for(int col=0;col<N;col++){ for(int i=0;i<N;i++)D[i]=col; D[u]=-1; if(perform_experiment(D)==1)ans[u]=col; } } return ans; } ans[0]=0; int cnt=2; D[0]=-1; for(int i=1;i<N;i++)D[i]=N; for(int i=1;i<N;i++){ D[i]=-1; int ncnt=perform_experiment(D); if(ncnt==cnt){ if(i<N-1)ans[i]=ans[i-1]; else ans[i]=1-ans[i-1]; }else{ if(i<N-1)ans[i]=1-ans[i-1]; else ans[i]=ans[i-1]; } cnt=ncnt; } return ans; }
#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...