제출 #412449

#제출 시각아이디문제언어결과실행 시간메모리
412449abdzagCluedo (IOI10_cluedo)C++17
0 / 100
5 ms328 KiB
#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<ll> m; vector<ll> l; vector<ll> w; rep(i, 1, 7) { m.push_back(i); w.push_back(i); } rep(i, 1, 10)l.push_back(i); while (1) { ll a, b, c; a = rand() % m.size(); b = rand() % l.size(); c = rand() % w.size(); ll 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); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...