| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 302453 |
2020-09-18T17:14:17 Z |
Hehehe |
Cluedo (IOI10_cluedo) |
C++14 |
|
12 ms |
384 KB |
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
//#define int long long
#include "grader.h"
#include "cluedo.h"
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);
//ifstream in(".in");
//ofstream out(".out");
int n, a[N];
void Solve(){
int i = 1, j = 1, k = 1;
for(;;){
int x = Theory(i,j,k);;
if(!x)return;
if(x == 1)i++;
if(x == 2)j++;
if(x == 3)k++;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
10 ms |
288 KB |
Output is correct |
| 3 |
Correct |
10 ms |
256 KB |
Output is correct |
| 4 |
Correct |
10 ms |
256 KB |
Output is correct |
| 5 |
Correct |
10 ms |
256 KB |
Output is correct |
| 6 |
Correct |
9 ms |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
256 KB |
Output is correct |
| 8 |
Correct |
10 ms |
256 KB |
Output is correct |
| 9 |
Correct |
12 ms |
256 KB |
Output is correct |
| 10 |
Correct |
11 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
11 ms |
256 KB |
Output is correct |
| 13 |
Correct |
9 ms |
256 KB |
Output is correct |
| 14 |
Correct |
10 ms |
256 KB |
Output is correct |
| 15 |
Correct |
12 ms |
384 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
11 ms |
256 KB |
Output is correct |
| 18 |
Correct |
9 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
256 KB |
Output is correct |
| 2 |
Correct |
10 ms |
256 KB |
Output is correct |
| 3 |
Correct |
10 ms |
256 KB |
Output is correct |
| 4 |
Correct |
11 ms |
256 KB |
Output is correct |
| 5 |
Correct |
12 ms |
256 KB |
Output is correct |
| 6 |
Correct |
11 ms |
384 KB |
Output is correct |
| 7 |
Correct |
10 ms |
256 KB |
Output is correct |
| 8 |
Correct |
9 ms |
384 KB |
Output is correct |
| 9 |
Correct |
12 ms |
384 KB |
Output is correct |
| 10 |
Correct |
10 ms |
256 KB |
Output is correct |
| 11 |
Correct |
9 ms |
256 KB |
Output is correct |
| 12 |
Correct |
10 ms |
256 KB |
Output is correct |
| 13 |
Correct |
9 ms |
256 KB |
Output is correct |
| 14 |
Correct |
12 ms |
256 KB |
Output is correct |
| 15 |
Correct |
9 ms |
256 KB |
Output is correct |
| 16 |
Correct |
8 ms |
384 KB |
Output is correct |
| 17 |
Correct |
10 ms |
256 KB |
Output is correct |
| 18 |
Correct |
10 ms |
256 KB |
Output is correct |
