제출 #406810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406810		8e7	Toy Train (IOI17_train)	C++14	0 / 100	1709 ms	1700 KiB

train

#include "train.h"

//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 5005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
vector<int> adj[maxn], rev[maxn];
bool found[maxn], fr[maxn];
bool poss[maxn];
void dfs(int n, bool f[], vector<int> ed[]) {
	f[n] = 1;
	for (int v:ed[n]) {
		if (!f[v]) dfs(v, f, ed);
	}	
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	int n = a.size(), m = u.size();
	for (int i = 0;i < m;i++) {
		adj[u[i]].push_back(v[i]);
		rev[v[i]].push_back(u[i]);
	}
	for (int i = 0;i < n;i++) {
		if (r[i] == 1) {
			for (int j = 0;j < n;j++) found[j] = fr[j] = 0;
			dfs(i, found, adj), dfs(i, fr, rev);
			for (int j = 0;j < n;j++) poss[j] |= found[j] && fr[j];	
		}
	}	
	vector<int> ret;
	for (int i = 0;i < n;i++) {
		if (poss[i]) ret.push_back(1);
		else ret.push_back(0);
	}
	return ret;
}

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