Submission #658014

#TimeUsernameProblemLanguageResultExecution timeMemory
658014sandry24Game (IOI14_game)C++17
0 / 100
1 ms308 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<pair<int, bool>> a; int hasEdge(int u, int v) { a[u].f--; a[v].f--; if(a[u].f <= 0 || a[v].f <= 0){ a[u].s = 1; a[v].s = 1; return 1; } if(a[u].f <= 1 && !a[u].s) return 1; if(a[v].f <= 1 && !a[v].s) return 1; return 0; } void initialize(int n) { a = vector<pair<int, bool>>(n, {n-1, 0}); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...