# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
964236 |
2024-04-16T13:16:13 Z |
anango |
Cluedo (IOI10_cluedo) |
C++17 |
|
1 ms |
436 KB |
#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;
int cur=-1;
for (int i=1; i<a; i++) {
r=Theory(i,b,c);
if (r==0) {
break;
}
if (r!=1) {
cur=i;
break;
}
}
if (cur==-1) {
cur=a;
}
if (r==0) {
return;
}
ans.push_back(cur);
cur=-1;
for (int i=1; i<b; i++) {
r=Theory(ans[0],i,c);
if (r==0) {
break;
}
if (r!=2) {
cur=i;
break;
}
}
if (cur==-1) {
cur=b;
}
ans.push_back(cur);
if (r==0) {
return;
}
ans.push_back(cur);
cur=-1;
for (int i=1; i<c; i++) {
r=Theory(ans[0],ans[1],i);
if (r==0) {
break;
}
if (r!=3) {
cur=i;
break;
}
}
if (cur==-1) {
cur=c;
}
ans.push_back(cur);
if (r==0) {
return;
}
int an=Theory(ans[0], ans[1], ans[2]);
assert(an==0);
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Failed |
0 ms |
344 KB |
wrong parameter |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
436 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |