제출 #388465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388465		ACmachine	게임 (IOI14_game)	C++17	42 / 100	1092 ms	35276 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<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const multiset<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

struct dsu{
    vector<int> p;
    vector<set<int>> unasked_edges;
    dsu(){}
    dsu(int _n){
        p.resize(_n, -1);
    }
    int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
    bool join(int a, int b){
        a = find(a); b = find(b);
        if(a == b) return false;
        if(p[a] > p[b])
            swap(a, b);
        p[a] += p[b]; p[b] = a;
        return true;
    }
};
int n;
vector<multiset<int>> unasked_edges;
dsu d;

void initialize(int N) {
    n = N;
    d = dsu(n);
    unasked_edges.resize(n);
    REP(i, n){
        REP(j ,n){
            if(i == j) continue;
            unasked_edges[i].insert(j);
        }
    }
}

int hasEdge(int u, int v) {
    //dbg(unasked_edges)
    //REP(i, n) dbg(d.find(i))
    if(u > v) swap(u, v);
    int ans = 1;
    int a = d.find(u);
    int b = d.find(v);
    if(a == b) return 1;
    unasked_edges[a].erase(unasked_edges[a].find(v));
    unasked_edges[b].erase(unasked_edges[b].find(u));
    REP(i, n){
        if(d.find(i) == b){
            if(unasked_edges[a].find(i) != unasked_edges[a].end())
                ans = 0;
        }
    }
    if(ans){
        d.join(u, v);
        int big = d.find(a);
        if(a != big) swap(a, b);
        for(int x : unasked_edges[b])
            unasked_edges[a].insert(x);
    }
    return ans;
}

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