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> v[4];
for(int i = 1; i <= 6; i++)
v[1].push(i) , v[3].push(i);
for(int i = 1; i <= 10; i++)
v[2].push(i);
int a[4];
while(1){
for(int i = 1; i <= 3; i++)
a[i] = v[i].top();
int x = Theory(a[1] , a[2] , a[3]);
if(!x) return;
v[x].pop();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |