| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 737726 |
2023-05-07T15:33:02 Z |
snowman |
Cluedo (IOI10_cluedo) |
C++17 |
|
13 ms |
292 KB |
#include <bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
//Soltan Cristian
#define fri(a, b) for (int i = (a); i < (b); ++i)
#define frj(a, b) for(int j = a; j < b; j++)
#define frk(a, b) for(int k = a; k < b; k++)
#define frm(a, b, i) for(int i = b; i >= a; i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define pb push_back
#define st first
#define nd second
#define sz(x) (ll)x.size()
#define rall(x) x.rbegin(), x.rend()
#define ct(x) cout << x
#define cts(x) cout << x << ' '
#define ctn(x) cout << x << '\n'
#define Y cout << "YES" << '\n'
#define N cout << "NO" << '\n'
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using ml = map<ll, ll>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <typename T>void read(T n, vector<T> &a){fri(0, n){cin >> a[i];}}
template<typename T>void print(T n, T m, vector<vector<T>> &dp){fri(0, n){ct('\n');frj(0, m){ct(setw(5));cts(dp[i][j]);}}}
const int mxa = 1e9 + 1;
// string __fname = "exclusiv";
// ifstream in(__fname + ".in");
// ofstream out (__fname + ".out");
// #define cin in
// #define cout out
void Solve(){
int a = 1, b = 1, c = 1;
int k = Theory(a, b, c);
while(k){
if(k == 1){
a++;
}
else if(k == 2){
b++;
}
else c++;
k = Theory(a, b, c);
}
return;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
208 KB |
Output is correct |
| 2 |
Correct |
8 ms |
208 KB |
Output is correct |
| 3 |
Correct |
9 ms |
208 KB |
Output is correct |
| 4 |
Correct |
11 ms |
208 KB |
Output is correct |
| 5 |
Correct |
12 ms |
208 KB |
Output is correct |
| 6 |
Correct |
10 ms |
208 KB |
Output is correct |
| 7 |
Correct |
12 ms |
208 KB |
Output is correct |
| 8 |
Correct |
11 ms |
208 KB |
Output is correct |
| 9 |
Correct |
5 ms |
208 KB |
Output is correct |
| 10 |
Correct |
9 ms |
208 KB |
Output is correct |
| 11 |
Correct |
10 ms |
208 KB |
Output is correct |
| 12 |
Correct |
9 ms |
208 KB |
Output is correct |
| 13 |
Correct |
10 ms |
208 KB |
Output is correct |
| 14 |
Correct |
11 ms |
208 KB |
Output is correct |
| 15 |
Correct |
9 ms |
208 KB |
Output is correct |
| 16 |
Correct |
12 ms |
208 KB |
Output is correct |
| 17 |
Correct |
11 ms |
208 KB |
Output is correct |
| 18 |
Correct |
5 ms |
292 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
208 KB |
Output is correct |
| 2 |
Correct |
12 ms |
208 KB |
Output is correct |
| 3 |
Correct |
11 ms |
208 KB |
Output is correct |
| 4 |
Correct |
6 ms |
208 KB |
Output is correct |
| 5 |
Correct |
12 ms |
208 KB |
Output is correct |
| 6 |
Correct |
13 ms |
208 KB |
Output is correct |
| 7 |
Correct |
5 ms |
288 KB |
Output is correct |
| 8 |
Correct |
11 ms |
208 KB |
Output is correct |
| 9 |
Correct |
9 ms |
208 KB |
Output is correct |
| 10 |
Correct |
12 ms |
208 KB |
Output is correct |
| 11 |
Correct |
10 ms |
208 KB |
Output is correct |
| 12 |
Correct |
12 ms |
208 KB |
Output is correct |
| 13 |
Correct |
8 ms |
208 KB |
Output is correct |
| 14 |
Correct |
9 ms |
208 KB |
Output is correct |
| 15 |
Correct |
11 ms |
288 KB |
Output is correct |
| 16 |
Correct |
5 ms |
208 KB |
Output is correct |
| 17 |
Correct |
12 ms |
208 KB |
Output is correct |
| 18 |
Correct |
11 ms |
208 KB |
Output is correct |
