Submission #382108

#TimeUsernameProblemLanguageResultExecution timeMemory
382108Aryan_RainaCluedo (IOI10_cluedo)C++14
100 / 100
15 ms364 KiB
#include "grader.h" #include "cluedo.h" #include <bits/stdc++.h> using namespace std; void Solve(){ int MX1 = 6, MX2 = 10, MX3 = 6; vector<bool> ok1(MX1, true), ok2(MX2, true), ok3(MX3, true); for (int i = 1; i <= MX1; i++) if (ok1[i]) { for (int j = 1; j <= MX2; j++) if (ok1[i] && ok2[j]) { for (int k = 1; k <= MX3; k++) if (ok1[i] && ok2[j] && ok3[k]) { int o = Theory(i, j, k); if (o == 1) ok1[i] = false; if (o == 2) ok2[j] = false; if (o == 3) ok3[k] = false; if (o == 0) return; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...