제출 #835773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
835773		Josia	장난감 기차 (IOI17_train)	C++17	0 / 100	140 ms	1876 KiB

train

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

using namespace std;

vector<vector<int>> graph;
vector<bool> own;
vector<bool> station;

vector<bool> vis;

void dfs(int v) {
	assert(own[v]);
	if (vis[v]) return;
	vis[v] = 1;

	for (int i: graph[v]) {
		dfs(i);
	}
}


vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
	graph.assign(n, vector<int>());
	for (int i = 0; i<(int)u.size(); i++) {
		graph[u[i]].push_back(v[i]);
	}
	own.resize(n);
	station.resize(n);
	for (int i = 0; i<n; i++) {
		own[i] = a[i];
		station[i] = r[i];
	}


	vector<int> res(n, 1);
	for (int i = 0; i<n; i++) {
		vis.assign(n, 0);
		dfs(i);
		for (int j = 0; j<n; j++) {
			if (station[j] && vis[j]) res[i] = 0;
		}
	}
	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