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(){
stack<int>f,s,t;
for (int i = 0; i < 6; i++){
f.push(i+1);
t.push(i+1);
}
for (int i = 0; i < 10; i++){
s.push(i+1);
}
int r = -1;
while(r != 0){
r = Theory(f.top(),s.top(),t.top());
if (r == 1)f.pop();
else if (r == 2)s.pop();
else if (r == 3)t.pop();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |