# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886853 | Lalic | Cluedo (IOI10_cluedo) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
#include "cluedo.h"
#define push_back pb
#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(id[0], id[1], id[2]);
if(curr==0) return;
id[curr-1]++;
}
}