Submission #580393

#	Time	Username	Problem	Language	Result	Execution time	Memory
580393		MrDeboo	Game (IOI14_game)	C++17	42 / 100	1091 ms	3204 KiB

game

#include "game.h"
#include"bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<int>vct[1500];
void initialize(int N){
    n=N;
    for(int i=0;i<n;i++){
        vector<int>g;
        for(int w=0;w<n;w++){
            if(i==w)continue;
            g.push_back(w);
        }
        while(g.size()){
            swap(g[rng()%g.size()],g.back());
            vct[i].push_back(g.back());
            g.pop_back();
        }
    }
}

vector<int>Exception(vector<int>v,int a){
    vector<int>vec;
    for(auto &i:v)if(i!=a)vec.push_back(i);
    return vec;
}

int hasEdge(int u, int v) {
    if(rng()%2)swap(u,v);
    deque<int>dq={u};
    vector<bool>vis(n);
    vis[u]=1;
    while(dq.size()){
        int a=dq.front();
        dq.pop_front();
        for(auto &i:vct[a]){
            if(i==v&&a!=u){
                vct[u]=Exception(vct[u],v);
                vct[v]=Exception(vct[v],u);
                return 0;
            }
            if(!((a==u&&i==v)||vis[i])){
                vis[i]=1;
                dq.push_back(i);
            }
        }
    }
    return 1;
}

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