Submission #296090

#	Time	Username	Problem	Language	Result	Execution time	Memory
296090		Dovran	Toy Train (IOI17_train)	C++11	0 / 100	17 ms	3712 KiB

train

#include <bits/stdc++.h>
#include "train.h"

#define N 20009
#define pii pair <int, int>
#define ff first
#define ss second
#define sz() size()
#define pb push_back
#define ll long long

using namespace std;

bool a[N];
vector<int>ans;

std::vector<int> who_wins(std::vector<int>o, std::vector<int>p, std::vector<int>u, std::vector<int>v){
	int n=o.sz();
	int m=u.sz();
	vector<int>e[N];
	int c[N];
	map<int, int>M[N];
	for(int i=0; i<m; i++){
		e[u[i]].pb(v[i]), M[u[i]][v[i]]=1;
		if(u[i]==v[i])
			c[u[i]]=1;
	}
	for(int i=0; i<n; i++){
		if(p[i]==1 and o[i]==1 and c[i]==1)
			a[i]=1;
		if(M[i][i+1])
			a[i]=a[i+1];
		ans.pb(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