Submission #581384

#TimeUsernameProblemLanguageResultExecution timeMemory
581384wdjpngGame (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include "game.h"
#include <bits/stdc++.h>

#define int long long
#define rep(i,n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
using namespace std;

int n;
vector<int>cancon;
void initialize(signed N) {
    n=N;
    cancon.assign(n,n-1);
}


vector<bool>vis;
void dfs(int v, vector<vector<int>>&E)
{
    vis[v]=true;
    for(int w : E[v]) if(!vis[w]) dfs(w, E);
}

bool con()
{
    vector<vector<int>>E(n);
    // rep(i,n) rep(j,n) if(i!=j&&!forb[i][j]) E[i].push_back(j);

    vis.assign(n,false);
    dfs(0,E);
    return count(all(vis),true)==n;
}

signed hasEdge(signed u, signed v) {
    
    int res = 0;
    if(cancon[u]==1||cancon[v]==1) res=1;
    cancon[u]--;
    cancon[v]--;
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...