제출 #314442

#제출 시각아이디문제언어결과실행 시간메모리
314442VROOM_VARUNCluedo (IOI10_cluedo)C++14
100 / 100
12 ms384 KiB
/* ID: varunra2 LANG: C++ TASK: cluedo */ #include<bits/stdc++.h> #include "cluedo.h" #include "grader.h" using namespace std; #ifdef DEBUG #include "lib/debug.h" #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define debug_arr(...) \ cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__) #pragma GCC diagnostic ignored "-Wsign-compare" //#pragma GCC diagnostic ignored "-Wunused-parameter" //#pragma GCC diagnostic ignored "-Wunused-variable" #else #define debug(...) 42 #endif #define EPS 1e-9 #define IN(A, B, C) assert(B <= A && A <= C) #define INF (int)1e9 #define MEM(a, b) memset(a, (b), sizeof(a)) #define MOD 1000000007 #define MP make_pair #define PB push_back #define all(cont) cont.begin(), cont.end() #define rall(cont) cont.end(), cont.begin() #define x first #define y second const double PI = acos(-1.0); typedef long long ll; typedef long double ld; typedef pair<int, int> PII; typedef map<int, int> MPII; typedef multiset<int> MSETI; typedef set<int> SETI; typedef set<string> SETS; typedef vector<int> VI; typedef vector<PII> VII; typedef vector<VI> VVI; typedef vector<string> VS; #define rep(i, a, b) for(int i = a; i < (b); ++i) #define trav(a, x) for(auto& a : x) #define sz(x) (int)(x).size() typedef pair<int, int> pii; typedef vector<int> vi; #pragma GCC diagnostic ignored "-Wsign-compare" // util functions // int Theory(int a, int b, int c) { // return 0; // } void Solve() { VI vals(3, 1); while(true) { int x = Theory(vals[0], vals[1], vals[2]); if(x == 0) return; x--; vals[x]++; } } // int main() { // #ifndef ONLINE_JUDGE // freopen("cluedo.in", "r", stdin); // freopen("cluedo.out", "w", stdout); // #endif // cin.sync_with_stdio(0); cin.tie(0); // return 0; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...