제출 #612442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
612442		MohamedAliSaidane	Toy Train (IOI17_train)	C++14	0 / 100	379 ms	262144 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;
    int C[nax];
    vi adj[nax];
    vi rev_adj[nax];
    int A[nax];
    int n, m;
    int dp[nax][nax];
    int f(int x, int rem)
    {
        if(dp[x][rem] != -1)
            return dp[x][rem];
      
        int nw_rem = rem;
        if(C[x])
            nw_rem = n;
        if(nw_rem == 0)
            return dp[x][rem] = 1 - A[x];
       
        int rep  = 0;
        for(auto e: adj[x])
        {
            if(e == x)
            {
                if(C[x])
                    rep = rep | A[x];
            }
            else
                rep = rep | f(e, nw_rem - 1);
        }
        return dp[x][rem] = rep;
    }
    vi who_wins(vi a, vi r, vi u, vi v)
    {
        memset(dp, -1,sizeof(dp));
        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;
        for(int i = 0; i < n;i ++)
        {
            if(f(i, n))
                ans.pb(A[i]);
            else
                ans.pb(1 - A[i]);
        }
        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