Submission #103516

#	Time	Username	Problem	Language	Result	Execution time	Memory
103516		SecretAgent007	Game (IOI14_game)	C++17	0 / 100	2 ms	384 KiB

game

# include "game.h"
# include <bits/stdc++.h>

using namespace std;

vector< vector< int > > Graph;

vector< bool > visited;

int n_;

bool cycle(int node, int last){
    visited[node] =true;
    for(int i = 0; i < n_; i++){
        if(Graph[node][i] && !visited[i]){
            if(cycle(i,node)) return true;
        }else if(Graph[node][i] && visited[i] && i != last) return true;
    }
    return false;
}

void initialize(int n) {
    n_ = n;
    Graph.resize(n, vector<int>(n, false));

    visited.resize(n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(i == j) continue;
            Graph[i][j] = true;
            Graph[j][i] = true;
        }
    }
}

int hasEdge(int u, int v) {
    Graph[u][v] = false;
    Graph[v][u] = false;
    fill(visited.begin(), visited.end(), false);
    bool verif = true;
    for(int i = 0; i < n_; i++){
        if(!visited[i]) verif = false;
    }
    if(cycle(u,-1) && verif){
        return 0;
    }else{
        Graph[u][v] = true;
        Graph[v][u] = true;
        return 1;
    }
}
/*
signed main(){
    int n;

    cin >> n;
    initialize(n);
    for(int i = 0; i < n; i++){
        for(int j = i+1; j < n; j++){
            cout << i << ' ' << j << ' ' << hasEdge(i,j) << endl;
        }
    }
}
*/

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