Submission #577715

#	Time	Username	Problem	Language	Result	Execution time	Memory
577715		Belgutei	Game (IOI14_game)	C++17	0 / 100	1 ms	212 KiB

game

#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 find(int node) {
    if(parent[node] == node) return node;
    return parent[node] = find(parent[node]);
}

void initialize(int N) {
    n = N;
    for(int i = 0; i < n; i ++) {
        parent[i] = i;
        num_child[i] = 1;
    }
}

bool check[2000];

int hasEdge(int u, int v) {
    mp[u] ++;
    mp[v] ++;
    if(mp[u] == n - 1 && check[u] == 0) {
        check[u] = 1;
        return 1;
    }
    if(mp[v] == n - 1 && check[v] == 0) {
        
        check[v] = 1;
        return 1;
    }

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58