Submission #420059

#TimeUsernameProblemLanguageResultExecution timeMemory
420059TricksterGame (IOI14_game)C++14
0 / 100
1 ms204 KiB
//Suleyman Atayew #include "game.h" #include <algorithm> #include <iostream> #include <string.h> #include <stdio.h> #include <vector> #include <bitset> #include <queue> #include <cmath> #include <map> #include <set> #define N 200010 #define ff first #define ss second #define pb push_back #define ll long long #define mod 1000000007 #define pii pair <int, int> #define sz(a) (int)(a.size()) ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; } using namespace std; int D[N]; void initialize(int n) { for(int i = 1; i <= n; i++) D[i] = n-1; } int hasEdge(int u, int v) { D[u]--, D[v]--; if(D[u] == 0 || D[v] == 0) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...