# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
412452 |
2021-05-26T22:55:46 Z |
abdzag |
Cluedo (IOI10_cluedo) |
C++17 |
|
5 ms |
328 KB |
#include<bits/stdc++.h>
#include<unordered_map>
#include"grader.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define sz(a) a.size()
typedef long double ld;
using namespace std;
static const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;
void Solve(){
vector<int> m;
vector<int> l;
vector<int> w;
rep(i, 1, 7) {
m.push_back(i);
w.push_back(i);
}
rep(i, 1, 10)l.push_back(i);
while (1) {
int a, b, c;
a = rand() % m.size();
b = rand() % l.size();
c = rand() % w.size();
int cur=Theory(m[a], l[b], w[c]);
if (cur == 0)break;
else if (cur == 1) m.erase(m.begin() + a);
else if (cur == 2)l.erase(l.begin() + b);
else w.erase(w.begin() + c);
}
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
328 KB |
Execution killed with signal 8 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
288 KB |
Execution killed with signal 8 |
2 |
Halted |
0 ms |
0 KB |
- |