| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 310191 |
2020-10-06T07:46:28 Z |
jainbot27 |
Cluedo (IOI10_cluedo) |
C++17 |
|
12 ms |
384 KB |
#include <bits/stdc++.h>
#include <grader.h>
#include "cluedo.h"
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()
#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
bool a[7], b[11], c[7];
void Solve(){
F0R(i, 7) a[i] = 0;
F0R(i, 11) b[i] = 0;
F0R(i, 7) c[i] = 0;
FOR(i, 1, 7){
FOR(j, 1, 11){
FOR(k, 1, 7){
if(a[i] == 1 || b[j] == 1 || c[k] == 1) continue;
int x = Theory(i, j, k);
if(x == 0) return;
else if(x==1) a[i] = 1;
else if(x==2) b[j] = 1;
else c[k] = 1;
}
}
}
}
// int32_t main(){
// ios_base::sync_with_stdio(0); cin.tie(0);
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
256 KB |
Output is correct |
| 2 |
Correct |
12 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 |
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 |
10 ms |
256 KB |
Output is correct |
| 9 |
Correct |
9 ms |
256 KB |
Output is correct |
| 10 |
Correct |
10 ms |
384 KB |
Output is correct |
| 11 |
Correct |
10 ms |
256 KB |
Output is correct |
| 12 |
Correct |
9 ms |
256 KB |
Output is correct |
| 13 |
Correct |
10 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
9 ms |
256 KB |
Output is correct |
| 16 |
Correct |
10 ms |
256 KB |
Output is correct |
| 17 |
Correct |
10 ms |
256 KB |
Output is correct |
| 18 |
Correct |
11 ms |
256 KB |
Output is correct |
| # |
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 |
11 ms |
256 KB |
Output is correct |
| 4 |
Correct |
8 ms |
256 KB |
Output is correct |
| 5 |
Correct |
8 ms |
256 KB |
Output is correct |
| 6 |
Correct |
9 ms |
256 KB |
Output is correct |
| 7 |
Correct |
11 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
256 KB |
Output is correct |
| 9 |
Correct |
12 ms |
256 KB |
Output is correct |
| 10 |
Correct |
10 ms |
256 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
9 ms |
384 KB |
Output is correct |
| 13 |
Correct |
11 ms |
256 KB |
Output is correct |
| 14 |
Correct |
9 ms |
256 KB |
Output is correct |
| 15 |
Correct |
12 ms |
256 KB |
Output is correct |
| 16 |
Correct |
10 ms |
256 KB |
Output is correct |
| 17 |
Correct |
10 ms |
256 KB |
Output is correct |
| 18 |
Correct |
10 ms |
256 KB |
Output is correct |
