답안 #1037537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1037537	2024-07-29T03:34:41 Z	thinknoexit	장난감 기차 (IOI17_train)	C++17	11 / 100	1132 ms	1684 KB

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.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	166 ms	1112 KB	3rd lines differ - on the 1st token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	600 KB	3rd lines differ - on the 8th token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1628 KB	Output is correct
2	Correct	76 ms	1612 KB	Output is correct
3	Correct	113 ms	1596 KB	Output is correct
4	Correct	408 ms	1368 KB	Output is correct
5	Correct	76 ms	1628 KB	Output is correct
6	Correct	56 ms	1684 KB	Output is correct
7	Correct	401 ms	1624 KB	Output is correct
8	Correct	5 ms	1624 KB	Output is correct
9	Correct	4 ms	1628 KB	Output is correct
10	Correct	7 ms	1660 KB	Output is correct
11	Correct	5 ms	1628 KB	Output is correct
12	Correct	4 ms	1628 KB	Output is correct
13	Correct	5 ms	1628 KB	Output is correct
14	Correct	5 ms	1548 KB	Output is correct
15	Correct	8 ms	1672 KB	Output is correct
16	Correct	5 ms	1628 KB	Output is correct
17	Correct	8 ms	1656 KB	Output is correct
18	Correct	266 ms	1372 KB	Output is correct