Submission #577735

#TimeUsernameProblemLanguageResultExecution timeMemory
577735BelguteiGame (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second #define pb push_back #define mk make_pair int n; map<int,int> mp; int parent[2000]; int num_child[2000]; vector<pair<int,int > > p; int uld; void initialize(int N) { n = N; uld = n * (n - 1) /2; } bool check[2000]; int cnt = 1; int hasEdge(int u, int v) { mp[u] ++; mp[v] ++; uld --; if(mp[u] == n - 1 || mp[v] == n -1) { cnt ++; return 1; } if(uld + cnt <= n) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...