Submission #779469

#	Time	Username	Problem	Language	Result	Execution time	Memory
779469		Dakto	Game (IOI14_game)	C++17	0 / 100	1079 ms	212 KiB

game

#include<bits/stdc++.h>

using namespace std;

int n;
vector<set<int>> gr;
void initialize(int N){
    n=N;
    gr.resize(n);

    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            gr[i].insert(j);
            gr[j].insert(i);
        }
    }
}

int hasEdge(int u, int v){
    vector<bool> seen(n,0);
    queue<int> q;

    q.push(u);
    seen[u]=1;
    while(!q.empty()){
        auto t=q.front();
        if(t==v){
            gr[u].erase(v);
            gr[v].erase(u);
            return 0;
        }
        for(auto i:gr[t]){
            if(t==u && i==v) continue;
            if(!seen[i]){
                seen[i]=1;
                q.push(i);
            }
        }
   }
    return 1;
}

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