Submission #1193858

#TimeUsernameProblemLanguageResultExecution timeMemory
1193858nicolo_010Cluedo (IOI10_cluedo)C++20
100 / 100
3 ms408 KiB
#pragma GCC optimize("Ofast") #include <bits/stdc++.h> #include "grader.h" #include "cluedo.h" using namespace std; using ll = long long; using pii = pair<int, int>; #define rep(i, k, n) for (int i = k; i < n; i++) #define print(vec) for (auto x : vec) cout << x << " "; cout << "\n" #define input(vec) for (int i = 0; i < vec.size(); i++) cin >> vec[i] template<typename T> using v = vector<T>; template<typename T> using pq = priority_queue<T, vector<T>, greater<T>>; const int MOD = 1e9+7; void Solve(){ int l1 = 1, r1 = 1, z1 = 1; int ans = -1; while (ans != 0) { ans = Theory(l1, r1, z1); if (ans == 1) l1++; else if (ans == 2) r1++; else z1++; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...