Submission #1313044

#TimeUsernameProblemLanguageResultExecution timeMemory
1313044shirokitoGame (IOI14_game)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> using namespace std; #define all(a) (a).begin(), (a).end() using ll = long long; mt19937_64 rng(36363636); int x; void initialize(int n) { x = rng() % n; } int hasEdge(int u, int v) { return (u == x || v == x); } #ifdef LOCAL void solve() { int n; cin >> n; initialize(n); for (int i = 1; i <= n * (n - 1) / 2; i++) { int u, v; cin >> u >> v; cout << hasEdge(u, v) << endl; } } signed main() { cin.tie(0) -> sync_with_stdio(0); int T = 1; // cin >> T; while (T--) { solve(); } } #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...