Submission #1087751

#TimeUsernameProblemLanguageResultExecution timeMemory
1087751MrPavlitoGame (IOI14_game)C++17
100 / 100
200 ms16492 KiB
#include "game.h" #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define sc second #define pii pair<int,int> using namespace std; const int MAXN = 1500+5; const int mod7 = 1e9+7; const long long inf = 1e18; int N; int cnt[MAXN]; map<pii, bool>mapa; void initialize(int n) { N = n; } int hasEdge(int u, int v) { if(u>v)swap(u,v); cnt[v]++; return v == cnt[v]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...