Submission #64880

#TimeUsernameProblemLanguageResultExecution timeMemory
64880MatheusLealVGame (IOI14_game)C++17
0 / 100
4 ms568 KiB
#include <bits/stdc++.h> #define N 1550 using namespace std; typedef long long ll; int block[N], n; vector<int> grafo[N]; int hasEdge(int u, int v) { if(block[u] == n - 2 || block[v] == n - 2) return 1; block[u] ++, block[v] ++; return 0; } void initialize(int N_) { memset(block, 0, sizeof block); n = N_; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...