Submission #657998

#TimeUsernameProblemLanguageResultExecution timeMemory
657998sandry24Game (IOI14_game)C++17
0 / 100
2 ms488 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pi; #define pb push_back #define mp make_pair #define f first #define s second vector<int> a; int hasEdge(int u, int v) { a[u]--; a[v]--; if(a[u] == 0 || a[v] == 0) return 0; return 1; } void initialize(int n) { a = vi(n, n-1); for(int i = 0; i < n*(n-1)/2; i++){ int u, v; cin >> u >> v; cout << hasEdge(u, v) << '\n' << flush; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...