Submission #1037518

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1037518	2024-07-29T02:49:02 Z	thinknoexit	Toy Train (IOI17_train)	C++17	0 / 100	4 ms	1368 KB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5050;
vector<int> adj[N];
int n, m;
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]);
	}
	vector<int> ans(n);
	ans[n - 1] = r[n - 1];
	for (int i = n - 2;i >= 0;i--) {
		if (a[i] == 0) { // Borzou
			bool ch = 0;
			for (auto& x : adj[i]) {
				if (x == i && !r[i]) ch = 1;
				else if (!ans[x]) ch = 1;
			}
			ans[i] = ch ^ 1;
		}
		else { // Arezou
			bool ch = 0;
			for (auto& x : adj[i]) {
				if (x == i && r[i]) ch = 1;
				else if (ans[x]) ch = 1;
			}
			ans[i] = ch;
		}
	}
	return ans;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	856 KB	3rd lines differ - on the 26th token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	3rd lines differ - on the 2nd token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1112 KB	Output is correct
2	Correct	3 ms	1116 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Incorrect	4 ms	1116 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-