Submission #1037537

#	Time	Username	Problem	Language	Result	Execution time	Memory
1037537		thinknoexit	Toy Train (IOI17_train)	C++17	11 / 100	1132 ms	1684 KiB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5050;
vector<int> adj[N], rev[N];
bool ans[N], vis1[N], vis2[N];
int n, m;
void dfs1(int v) {
	for (auto& x : adj[v]) {
		if (!vis1[x]) vis1[x] = 1, dfs1(x);
	}
}
void dfs2(int v) {
	for (auto& x : rev[v]) {
		if (!vis2[x]) vis2[x] = 1, dfs2(x);
	}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int>  _U, vector<int> _V) {
	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]) continue;
		memset(vis1, 0, sizeof vis1);
		memset(vis2, 0, sizeof vis2);
		dfs1(i);
		dfs2(i);
		bool ch = 0;
		for (int j = 0;j < n;j++) if (vis1[j] && vis2[j]) ch = 1;
		if (ch) {
			for (int j = 0;j < n;j++) if (vis2[j]) ans[j] = 1;
		}
	}
	vector<int> _ans(n);
	for (int i = 0;i < n;i++) _ans[i] = ans[i];
	return _ans;
}
/*
4 5
1 0 1 1
0 0 0 1
0 1
1 1
1 2
2 3
3 3
*/

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