Submission #984719

#TimeUsernameProblemLanguageResultExecution timeMemory
984719woodGame (IOI14_game)C++17
0 / 100
1 ms444 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> p32; typedef pair<ll,ll> p64; #define pb push_back #define eb emplace_back #define fi first #define se second #define vi vector<int> #define vp32 vector<p32> #define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define MOD %1000000007 #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //never guess //never debug without reviewing code //never try adding ones or substracting them //only step by step debug when necessay int N, mx; vi arr; void initialize(int n) { N = n; arr.resize(n,0); mx = n-1; } int hasEdge(int u, int v) { arr[u]++; arr[v]++; if(arr[u]==mx||arr[v]==mx){ return 1; mx--; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...