| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 380994 |
2021-03-24T07:03:23 Z |
Karliver |
Cluedo (IOI10_cluedo) |
C++14 |
|
14 ms |
384 KB |
#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
#include <fstream>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
typedef complex<ll> G;
const int INF = 1e9 + 1;
const int N = 1e6;
const double eps = 1e-3;
template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
x = (x > y ? y : x);
}
void Solve(){
int a = 1, b =1, c =1;
int r = Theory(a, b, c);
while(r) {
if(r == 1)++a;
else if(r == 2)++b;
else ++c;
r = Theory(a, b,c);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
364 KB |
Output is correct |
| 2 |
Correct |
13 ms |
364 KB |
Output is correct |
| 3 |
Correct |
8 ms |
364 KB |
Output is correct |
| 4 |
Correct |
11 ms |
364 KB |
Output is correct |
| 5 |
Correct |
10 ms |
364 KB |
Output is correct |
| 6 |
Correct |
9 ms |
364 KB |
Output is correct |
| 7 |
Correct |
12 ms |
364 KB |
Output is correct |
| 8 |
Correct |
13 ms |
364 KB |
Output is correct |
| 9 |
Correct |
10 ms |
364 KB |
Output is correct |
| 10 |
Correct |
13 ms |
364 KB |
Output is correct |
| 11 |
Correct |
13 ms |
364 KB |
Output is correct |
| 12 |
Correct |
12 ms |
364 KB |
Output is correct |
| 13 |
Correct |
13 ms |
364 KB |
Output is correct |
| 14 |
Correct |
8 ms |
364 KB |
Output is correct |
| 15 |
Correct |
10 ms |
364 KB |
Output is correct |
| 16 |
Correct |
10 ms |
364 KB |
Output is correct |
| 17 |
Correct |
6 ms |
364 KB |
Output is correct |
| 18 |
Correct |
12 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
364 KB |
Output is correct |
| 2 |
Correct |
11 ms |
384 KB |
Output is correct |
| 3 |
Correct |
10 ms |
364 KB |
Output is correct |
| 4 |
Correct |
12 ms |
364 KB |
Output is correct |
| 5 |
Correct |
10 ms |
364 KB |
Output is correct |
| 6 |
Correct |
14 ms |
364 KB |
Output is correct |
| 7 |
Correct |
13 ms |
364 KB |
Output is correct |
| 8 |
Correct |
12 ms |
364 KB |
Output is correct |
| 9 |
Correct |
7 ms |
364 KB |
Output is correct |
| 10 |
Correct |
12 ms |
364 KB |
Output is correct |
| 11 |
Correct |
13 ms |
364 KB |
Output is correct |
| 12 |
Correct |
9 ms |
364 KB |
Output is correct |
| 13 |
Correct |
10 ms |
364 KB |
Output is correct |
| 14 |
Correct |
8 ms |
364 KB |
Output is correct |
| 15 |
Correct |
10 ms |
288 KB |
Output is correct |
| 16 |
Correct |
10 ms |
364 KB |
Output is correct |
| 17 |
Correct |
6 ms |
364 KB |
Output is correct |
| 18 |
Correct |
9 ms |
364 KB |
Output is correct |
