Submission #835751

#	Time	Username	Problem	Language	Result	Execution time	Memory
835751		Josia	Toy Train (IOI17_train)	C++17	0 / 100	64 ms	1176 KiB

train

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

using namespace std;

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


vector<int> dp;
vector<bool> vis;
// int dfs(int v) {
// 	if (station[v]) return 1;

// 	if (dp[v]!=-1) return dp[v];

// 	if (vis[v]) return 0;
// 	vis[v] = 1;

// 	set<int> poss;

// 	for (int i: graph[v]) {
// 		poss.insert(dfs(i));
// 	}

// 	if (own[v]) {
// 		if (poss.count(1)) return 1;
// 		return 0;
// 	}
// 	if (!own[v]) {
// 		if (poss.count(0)) return 0;
// 		return 1;
// 	}
// }

int dfs(int v) {
	if (station[v]) return 1;

	if (vis[v]) return 0;
	vis[v] = 1;


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

	return 0;
}


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