Submission #297119

#	Time	Username	Problem	Language	Result	Execution time	Memory
297119		Autoratch	Toy Train (IOI17_train)	C++14	5 / 100	9 ms	1152 KiB

train

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

const int N = 5000;

int n,m;
vector<int> adj[N];
bool sm[N],nxt[N];

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) 
{
    n = a.size(),m = u.size();
    for(int i = 0;i < m;i++)
    {
        adj[u[i]].push_back(v[i]);
        if(u[i]==v[i]) sm[u[i]] = true;
        else nxt[u[i]] = true;
    }
    vector<int> ans(n);
    for(int i = n-1;i >= 0;i--)
    {
        if(!nxt[i] and !sm[i]){ ans[i] = 0; continue; }
        if(a[i] and r[i] and sm[i]) ans[i] = 1;
        else if(a[i]) 
        {
            if(nxt[i]) ans[i] = ans[i+1];
            else ans[i] = 0;
        }
        else 
        {
            if(!r[i] and sm[i]) ans[i] = 0;
            else if(sm[i] and !nxt[i]) ans[i] = 1;
            else if(!nxt[i]) ans[i] = 0;
            else ans[i] = ans[i+1];
        }
    }
    return ans;
}

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