Submission #612479

#	Time	Username	Problem	Language	Result	Execution time	Memory
612479		MohamedAliSaidane	Toy Train (IOI17_train)	C++14	0 / 100	2070 ms	1364 KiB

train

#include <bits/stdc++.h>
//#include "train.h"
    using namespace std;

    typedef long long ll;
    typedef double ld;
    typedef pair<int,int> pii;
    typedef pair<ll,ll> pll;

    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pii> vpi;
    typedef vector<pll> vpl;

    #define pb push_back
    #define popb pop_back
    #define all(x) (x).begin(),(x).end()

    #define ff first
    #define ss second

    const int nax = 5004;
    const int MOD = 1e9 + 7;
    int  n, m;
    vi adj[nax];
    int vis[nax];
    int A[nax], C[nax];
    int dfs(int x, int dep = n)
    {
        vis[x] = 1;
        dep = C[x] ? n: dep;
        if(dep == 0)
            return 1 - A[x];
        int rep = 0;
        for(auto e: adj[x])
        {
            if(vis[e])
            {
                rep = rep | A[x];
            }
            else
            {
                if(A[e] == A[x])
                    rep =rep | dfs(e, dep - 1);
                else
                    rep = rep | (1 - dfs(e, dep - 1));
            }
        }
        vis[x] = 0;
        return rep;
    }
    vi who_wins(vi a, vi r, vi u, vi v)
    {
        n = a.size();
        m = u.size();
        for(int i = 0 ; i < n; i++)
        {
            A[i] = a[i];
            C[i ] = r[i];
        }
        for(int i = 0 ; i  < m; i ++)
        {
            adj[u[i]].pb(v[i]);
        }
        vi ans(n, 0);
        for(int i = 0 ; i < n; i ++)
        {
            int rep  = dfs(i, n);
            if(A[i])
                ans[i] = rep;
            else
                ans[i] = 1 - rep;
        }
        return ans;

    }

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