Submission #839559

#TimeUsernameProblemLanguageResultExecution timeMemory
839559model_codeCoreputer (IOI23_coreputer)C++17
60 / 100
6 ms212 KiB
// partially_correct/solution-2N-random.cpp #include "coreputer.h" #include <algorithm> #include <random> int ids[16]; int diagnostic(const std::vector<int>& T){ std::vector<int> actT(T.size()); for(int i = 0; i<(int)T.size(); i++) actT[i] = ids[T[i]]; return run_diagnostic(actT); } std::vector<int> malfunctioning_cores(int N) { for(int i=0; i<N; i++) ids[i] = i; srand(time(0)); std::random_shuffle(ids,ids+N); int h = 0; std::vector<int> T; std::vector<int> c(N); for(; h<N-1; h++){ T.clear(); for(int i=0; i<=h; i++) T.push_back(i); if(diagnostic(T)!=-1) break; } c[h] = 1; for(int i=0; i<h; i++){ T.clear(); for(int j=0; j<=h; j++){ if(i!=j) T.push_back(j); } if(diagnostic(T)==-1) c[i] = 1; } h--; for(int i=h+2; i<N; i++){ T.clear(); for(int j=h+1; j<N; j++){ if(i!=j) T.push_back(j); } if(diagnostic(T)<=0) c[i] = 1; } std::vector<int> actC(N); for(int i=0; i<N; i++) actC[ids[i]] = c[i]; return actC; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...