Submission #1207315

#TimeUsernameProblemLanguageResultExecution timeMemory
1207315matisitoGame (IOI14_game)C++20
0 / 100
0 ms328 KiB
#include "game.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>

using namespace std;

int N;
void initialize(int n) {
    N=n;
}
map<int, int>xd;
int hasEdge(int u, int v) {
    xd[u]++;
    xd[v]++;
    if(xd[u]==N-1 || xd[v]==N-1) return 1;
    else return 0;
    // return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...