Submission #1233715

#TimeUsernameProblemLanguageResultExecution timeMemory
1233715lalig777스핑크스 (IOI24_sphinx)C++20
18 / 100
4 ms416 KiB
#include "sphinx.h" #include <iostream> #include <vector> #include <cmath> #include <algorithm> //#define int long long using namespace std; int perform_experiment(vector<int> E); vector<int> find_colours(int N, vector<int> X, vector<int> Y){ vector<int>S(N, -1); vector<int>ans(N, -1); ans[0]=0; for (int i=0; i<N-1; i++){ for (int j=0; j<N; j++){ if (j==i or j==i+1) S[j]=-1; else S[j]=N; } int comp=perform_experiment(S); int mustbe=3; if (N==2) mustbe=1; else if (N==3 or i==0 or i==N-2) mustbe=2; if (comp==mustbe) ans[i+1]=ans[i]; else ans[i+1]=ans[i]+1; }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...