Submission #886855

#TimeUsernameProblemLanguageResultExecution timeMemory
886855LalicCluedo (IOI10_cluedo)C++17
100 / 100
6 ms596 KiB
#include <bits/stdc++.h> using namespace std; #include "grader.h" #include "cluedo.h" #define pb push_back #define all(x) x.begin(), x.end() mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void Solve(){ vector<int> loc, weap, who; for(int i=1;i<=6;i++) loc.pb(i), who.pb(i); for(int i=1;i<=10;i++) weap.pb(i); shuffle(all(loc), rng); shuffle(all(weap), rng); shuffle(all(who), rng); array<int, 3> id={0, 0, 0}; while(1){ int curr=Theory(loc[id[0]], weap[id[1]], who[id[2]]); if(!curr) return; id[curr-1]++; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...