Submission #1077972

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077972		TB_	Toy Train (IOI17_train)	C++17	0 / 100	5 ms	1372 KiB

train

#include <bits/stdc++.h>

using namespace std;
#define ll long long 
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define F first 
#define S second 
#define pb push_back 
#define deb(x) cout << #x << " = " << (x) << endl
#define deb2(x, y) cout << #x << " = " << (x)  << ", " << #y << " = " << (y) << endl

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;

ll n;
vvl adj(6000);


std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    n = a.size();
    ll m = u.size();

    vl selfEdge(n+1, 0);
    fo(i, m){
        if(u[i] == v[i]) selfEdge[u[i]] = 1;
        else{
            adj[u[i]].pb(v[i]);
        }
    }
    vector<int> res(n);
    ll last = 0;
    for(int i = n-1; i>=0;i--){
        if(selfEdge[i]){
            last = a[i]==r[i];
        }
        res[i] = last;
    }


	return res;
}

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