Submission #423901

#	Time	Username	Problem	Language	Result	Execution time	Memory
423901		cfalas	Toy Train (IOI17_train)	C++14	0 / 100	9 ms	2508 KiB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto &v : a)
#define len(x) ((int)x.size())

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = len(a);
	vector<int> res(a.size(), 0);
	vector<vi> adj(len(a), vi());
	vi loop(n,0);
	FOR(i,len(u)){
		if(u[i]==v[i]) loop[i] = 1;
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	assert(loop[n-1]);
	res[n-1] = loop[n-1] && r[n-1];
	for(int i=n-2;i>=0;i--){
		if(loop[i] && r[i] && a[i]) res[i] = 1;
		else if(loop[i] && len(adj[i])==1 && r[i]) res[i] = 1;
		else if(!loop[i]) res[i] = res[i+1];
	}
	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