Submission #992334

#	Time	Username	Problem	Language	Result	Execution time	Memory
992334		phoenix	Game (IOI14_game)	C++17	42 / 100	37 ms	18268 KiB

game

#include "game.h"

const int N = 100;

bool edges[N][N];

int n;
int cnt = 0;
bool vis[N];

void dfs(int s) {
    vis[s] = true;
    cnt++;
    for (int i = 0; i < n; i++) {
        if (edges[s][i] && !vis[i])
            dfs(i);
    }
}

void initialize(int n_in) {
    n = n_in;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            edges[i][j] = true;
}

int hasEdge(int u, int v) {
    cnt = 0;
    edges[u][v] = edges[v][u] = 0;
    for (int i = 0; i < n; i++)
        vis[i] = false;
    dfs(u);
    if (cnt == n) return 0;
    edges[u][v] = edges[v][u] = 1;
    return 1;
}

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