Submission #1055004

#	Time	Username	Problem	Language	Result	Execution time	Memory
1055004		Wansur	Toy Train (IOI17_train)	C++17	10 / 100	40 ms	1880 KiB

train

#include <bits/stdc++.h>
#include "train.h"
#define ent '\n'
#define  f first
#define s second
//#define int long long

using namespace std;
typedef long long ll;
const int maxn = 5e3 + 12;
const int mod = 1e9 + 7;

vector<int> g[maxn], rg[maxn];
bool won[maxn], del[maxn];
int out[maxn];
int n, m;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){
    n = a.size(), m = U.size();
    vector<int> ans(n);

    for(int i=0;i<m;i++){
        g[U[i]].push_back(V[i]);
        rg[V[i]].push_back(U[i]);
    }

    for(int mask = 1;mask < (1 << n);mask++){
        for(int i=0;i<n;i++){
            out[i] = g[i].size();
            won[i] = 0;
        }

        queue<int> q;

        for(int i=0;i<n;i++){
            won[i] = 0;
            if((mask & (1 << i)) && r[i] == 1){
                won[i] = 1;
                q.push(i);
            }
        }

        while(q.size()){
            int v = q.front();
            q.pop();
            for(int to:rg[v]){
                if(a[to] && !won[to]){
                    won[to] = 1;
                    q.push(to);
                }
                if(!a[to] && !won[to]){
                    out[to]--;
                    if(out[to] == 0){
                        won[to] = 1;
                        q.push(to);
                    }
                }
            }
        }

        bool fg = 1;

        for(int i=0;i<n;i++){
            if((mask & (1 << i))){
                if(!r[i]) fg = 0;
                bool ok = 1 - a[i];
                for(int to:g[i]){
                    if(a[i]) ok |= won[to];
                    else ok &= won[to];
                }
                fg &= ok;
            }
        }

        if(fg){
            for(int i=0;i<n;i++){
                ans[i] |= won[i];
            }
        }
    }

    return ans;
}

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