| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 311837 |
2020-10-11T21:12:44 Z |
zakaF |
Cluedo (IOI10_cluedo) |
C++14 |
|
12 ms |
256 KB |
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#ifdef LOCAL
#include </home/linux/debug.h>
#define dbg(...) cout << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", _print(__VA_ARGS__)
#else
#define dbg(...)
#endif
#include "grader.h"
#include "cluedo.h"
void Solve()
{
int i = 1,j =1,k = 1;
while(1)
{
int x = Theory(i,j,k);
if(!x)break;
if(x == 1)
i++;
else if(x == 2)
j++;
else
k++;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
256 KB |
Output is correct |
| 2 |
Correct |
9 ms |
256 KB |
Output is correct |
| 3 |
Correct |
10 ms |
256 KB |
Output is correct |
| 4 |
Correct |
9 ms |
256 KB |
Output is correct |
| 5 |
Correct |
12 ms |
256 KB |
Output is correct |
| 6 |
Correct |
10 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 |
10 ms |
256 KB |
Output is correct |
| 10 |
Correct |
9 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 |
11 ms |
256 KB |
Output is correct |
| 15 |
Correct |
10 ms |
256 KB |
Output is correct |
| 16 |
Correct |
11 ms |
256 KB |
Output is correct |
| 17 |
Correct |
9 ms |
256 KB |
Output is correct |
| 18 |
Correct |
10 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
256 KB |
Output is correct |
| 2 |
Correct |
11 ms |
256 KB |
Output is correct |
| 3 |
Correct |
10 ms |
256 KB |
Output is correct |
| 4 |
Correct |
8 ms |
256 KB |
Output is correct |
| 5 |
Correct |
10 ms |
256 KB |
Output is correct |
| 6 |
Correct |
10 ms |
256 KB |
Output is correct |
| 7 |
Correct |
9 ms |
256 KB |
Output is correct |
| 8 |
Correct |
11 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 |
8 ms |
256 KB |
Output is correct |
| 12 |
Correct |
11 ms |
256 KB |
Output is correct |
| 13 |
Correct |
8 ms |
256 KB |
Output is correct |
| 14 |
Correct |
10 ms |
256 KB |
Output is correct |
| 15 |
Correct |
6 ms |
256 KB |
Output is correct |
| 16 |
Correct |
7 ms |
256 KB |
Output is correct |
| 17 |
Correct |
9 ms |
256 KB |
Output is correct |
| 18 |
Correct |
9 ms |
256 KB |
Output is correct |
