Submission #1312089

#TimeUsernameProblemLanguageResultExecution timeMemory
1312089eri16스핑크스 (IOI24_sphinx)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> #include "sphinx.h" using namespace std; vector<int> find_colours(int N, vector<int> X, vector<int> Y){ int n = N; vector <int> ans(n,0); int cur = 1; ans[0]=cur; for (int i=1; i<n; i++){ int target=4; if (i==1 || i==n-1){target=3;} vector <int> tm (n,n); tm[i]=-1; tm[i-1]=-1; int found = perform_experiment(tm); if (found==target){ cur=1-cur; } ans[i]=cur; } 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...