제출 #1143975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143975		steveonalex	장난감 기차 (IOI17_train)	C++20	16 / 100	386 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;
int side[N], charging[N];
vector<int> graph[N], rgraph[N];
int deg[N], og_deg[N];;
bool reached[N];
bool zero_cycle[N];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V) {
    n = a.size(), m = U.size();
    for(int i = 0; i < m; ++i){
        graph[V[i]].push_back(U[i]);
        rgraph[U[i]].push_back(V[i]);
        og_deg[U[i]]++;
    }
    for(int i = 0; i < n; ++i){
        side[i] = a[i];
        charging[i] = r[i];
    }

    for(int i = 0; i < n; ++i) if (!charging[i] && graph[i].size() && rgraph[i].size()){
        for(int j = 0; j < n; ++j) deg[j] = og_deg[j];
        memset(reached, 0, sizeof reached);
        reached[i] = 1;
        vector<int> q; q.push_back(i);
        while(q.size()){
            int u = q.back(); q.pop_back();
            for(int v: graph[u]) {
                if (reached[v] || charging[v]) continue;
                if (side[v] == 0){
                    reached[v] = true;
                    q.push_back(v);
                }
                else{
                    deg[v]--;
                    if (deg[v] == 0) {
                        reached[v] = true;
                        q.push_back(v);
                    }
                }
            }
        }

        int cnt[2]; memset(cnt, 0, sizeof cnt);
        for(int v: rgraph[i]) cnt[reached[v]]++;

        if (side[i]) {
            if (cnt[0] == 0) zero_cycle[i] = true;
        }
        else {
            if (cnt[1] > 0) zero_cycle[i] = true;
        }
    }

    for(int i = 0; i < m; ++i) {
        int u, v;
        tie(u, v) = make_pair(U[i], V[i]);
        if (u == v && (side[u] == 0 || charging[u] == 0)) og_deg[u]--;
    }

    for(int j = 0; j < n; ++j) deg[j] = og_deg[j];
    memset(reached, 0, sizeof reached);
    vector<int> q;
    for(int i = 0; i < n; ++i) if (zero_cycle[i]) {
        reached[i] = true;
        q.push_back(i);
    }
    while(q.size()){
        int u = q.back(); q.pop_back();
        for(int v: graph[u]) {
            if (reached[v]) continue;
            if (side[v] == 0){
                reached[v] = true;
                q.push_back(v);
            }
            else{
                deg[v]--;
                if (deg[v] == 0) {
                    reached[v] = true;
                    q.push_back(v);
                }
            }
        }
    }


    vector<int> ans(n);
    for(int i = 0; i < n; ++i) ans[i] = 1 - reached[i];
    return ans;
}

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