# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964259 | anango | Cluedo (IOI10_cluedo) | C++17 | 9 ms | 596 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 "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(){
int r;
int a=6;
int b=10;
int c=6;
vector<int> ans;
vector<int> maxes={6,10,6};
int n=3;
vector<set<int>> poss(3);
for (int i=0; i<n; i++) {
for (int j=1; j<=maxes[i]; j++) {
poss[i].insert(j);
}
}
for (int q=0; q<20; q++) {
int a=*poss[0].begin();
int b=*poss[1].begin();
int c=*poss[2].begin();
int r=Theory(a,b,c);
if (r==0) {
break;
}
if (r==1) {
poss[0].erase(a);
}
if (r==2) {
poss[1].erase(b);
}
if (r==3) {
poss[2].erase(c);
}
}
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |