제출 #1146172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146172		steveonalex	장난감 기차 (IOI17_train)	C++20	100 / 100	1938 ms	1608 KiB

train

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "train.h"

const int N = 5005;
int n, m;

vector<int> calc(int player, vector<int> allowed, vector<int> a, vector<int> r, vector<pair<int, int>> edge){
    vector<vector<int>> graph(n);
    vector<int> deg(n);
    for(pair<int, int> i: edge){
        if (allowed[i.first] && allowed[i.second]){
            graph[i.second].push_back(i.first);
            deg[i.first]++;
        }
    }

    vector<int> ans(n);
    vector<int> st;
    for(int i = 0; i < n; ++i){
        if (r[i] && allowed[i]){
            st.push_back(i);
            ans[i] = 1;
        }
    }


    while(st.size()){
        int u = st.back(); st.pop_back();
        for(int v: graph[u]) {
            if (ans[v]) continue;
            if (a[v] == player) {
                ans[v] = true;
                st.push_back(v);
            }
            else{
                deg[v]--;
                if (deg[v] == 0){
                    ans[v] = true;
                    st.push_back(v);
                }
            }
        }
    }

    return ans;
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V) {
    n = a.size(), m = U.size();
    vector<pair<int, int>> edge(m);
    for(int i = 0; i < m; ++i) edge[i] = {U[i], V[i]};

    vector<int> ans(n, 1);
    while(true){
        vector<int> reachable1 = calc(1, ans, a, r, edge);
        if (reachable1 == ans) break;

        vector<int> unreachable1(n);
        for(int i = 0; i < n; ++i) unreachable1[i] = reachable1[i] ^ ans[i];

        vector<int> reachable2 = calc(0, ans, a, unreachable1, edge);

        for(int i = 0; i < n; ++i) ans[i] ^= reachable2[i];
    }

    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 12 / 12
• Subtask 6: 51 / 51