| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 286162 |
2020-08-30T07:41:03 Z |
erkam |
Cluedo (IOI10_cluedo) |
C++17 |
|
15 ms |
384 KB |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<utility>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#include "grader.h"
#include "cluedo.h"
#define endl "\n"
#define all(v) v.begin(),v.end()
#define st first
#define nd second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long lo;
const int mod=1000000007,N=500005;
lo a,b,c,d,e,f,g=1,h[N],arr[N];
string s;
vector<lo>v;
void Solve(){
lo x=1,y=1,z=1;
while(true){
lo ok=Theory(x,y,z);
if(ok==1)x++;
if(ok==2)y++;
if(ok==3)z++;
if(ok==0)break;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
256 KB |
Output is correct |
| 2 |
Correct |
10 ms |
256 KB |
Output is correct |
| 3 |
Correct |
8 ms |
256 KB |
Output is correct |
| 4 |
Correct |
11 ms |
384 KB |
Output is correct |
| 5 |
Correct |
8 ms |
384 KB |
Output is correct |
| 6 |
Correct |
9 ms |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
256 KB |
Output is correct |
| 9 |
Correct |
10 ms |
256 KB |
Output is correct |
| 10 |
Correct |
9 ms |
256 KB |
Output is correct |
| 11 |
Correct |
11 ms |
384 KB |
Output is correct |
| 12 |
Correct |
8 ms |
256 KB |
Output is correct |
| 13 |
Correct |
9 ms |
384 KB |
Output is correct |
| 14 |
Correct |
11 ms |
256 KB |
Output is correct |
| 15 |
Correct |
7 ms |
256 KB |
Output is correct |
| 16 |
Correct |
10 ms |
256 KB |
Output is correct |
| 17 |
Correct |
9 ms |
256 KB |
Output is correct |
| 18 |
Correct |
11 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
384 KB |
Output is correct |
| 2 |
Correct |
13 ms |
384 KB |
Output is correct |
| 3 |
Correct |
9 ms |
384 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
15 ms |
256 KB |
Output is correct |
| 6 |
Correct |
13 ms |
384 KB |
Output is correct |
| 7 |
Correct |
13 ms |
256 KB |
Output is correct |
| 8 |
Correct |
13 ms |
256 KB |
Output is correct |
| 9 |
Correct |
13 ms |
256 KB |
Output is correct |
| 10 |
Correct |
13 ms |
384 KB |
Output is correct |
| 11 |
Correct |
13 ms |
384 KB |
Output is correct |
| 12 |
Correct |
9 ms |
256 KB |
Output is correct |
| 13 |
Correct |
10 ms |
384 KB |
Output is correct |
| 14 |
Correct |
12 ms |
256 KB |
Output is correct |
| 15 |
Correct |
6 ms |
384 KB |
Output is correct |
| 16 |
Correct |
11 ms |
288 KB |
Output is correct |
| 17 |
Correct |
10 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
256 KB |
Output is correct |
