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 <cstdio>
#include <cstring>
#define debug(...) //fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 11;
const int L[3] = {6, 10, 6};
int bio[N][3];
void Solve(){
memset(bio, 0, sizeof(bio));
for(; 1; ) {
int ask[3] = {-1, -1, -1};
for(int i = 0; i < 3; ++i) {
for(int j = 0; j < L[i]; ++j) {
if(!bio[j][i]) {
ask[i] = j + 1;
break;
}
}
}
int res = Theory(ask[0], ask[1], ask[2]);
debug("%d %d %d : %d\n", ask[0], ask[1], ask[2], res);
if(res == 0) { break; }
bio[ask[res - 1] - 1][res - 1] = 1;
}
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |