Submission #584100

#	Time	Username	Problem	Language	Result	Execution time	Memory
584100		PiejanVDC	Toy Train (IOI17_train)	C++17	10 / 100	5 ms	1236 KiB

train

#include <bits/stdc++.h>
#include "train.h"

using namespace std;

vector<int>tim;
vector<bool>vis(15);
vector<int>s,a,r;
vector<int>adj[15];
vector<int>ans(15,2);

int t = 1;

bool dfs(int u) {
    vis[u] = 1;

    tim[u] = t++;
    if(r[u])
        s.push_back(t-1);

    bool ok;
    if(a[u]) {
        ok = 0;
        for(auto z : adj[u]) if(!vis[z]) {
            ok |= dfs(z);
            if(ok)
                break;
        } else {
            if(!s.empty() && tim[z] <= s.back())
                ok = 1;
        }
    } else {
        ok = 1;
        for(auto z : adj[u]) if(!vis[z]) {
            ok &= dfs(z);
            if(!ok)
                break;
        } else {
            if(!s.empty() && tim[z] <= s.back())
                ok &= 1;
            else
                ok = 0;
        }
    }

    if(r[u])
        s.pop_back();
    tim[u] = 0;

    vis[u] = 0;
    return ok;
}

vector<int>who_wins(vector<int>A, vector<int>R, vector<int>u, vector<int>v) {

    r = R;
    a = A;

    int n = r.size();
    int m = u.size();

    for(int i = 0 ; i < m ; i++) {
        adj[u[i]].push_back(v[i]);
    }

    for(int y = 0 ; y < n ; y++) {
        int i = y;
        t = 1;
        tim.clear();
        tim.resize(n,0);
        ans[i] = dfs(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