Submission #584708

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
584708	2022-06-27T21:22:14 Z	1ne	Toy Train (IOI17_train)	C++14	0 / 100	2000 ms	1724 KB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	int n = (int)a.size();
	int m = (int)u.size();
	vector<int>ans(n,0);
	vector<vector<int>>adj(n);
	for (int i = 0;i<m;++i){
		adj[u[i]].push_back(v[i]);
	}
	vector<int>visited(n,0);
	vector<int>cnt(n,0);
	vector<int>parent(n,-1);
	function<int(int)>dfs = [&](int u){
		if (visited[u] ==  2)return (cnt[u] | ans[u]);
		visited[u] = 1;
		int ans = 0;
		for (auto x:adj[u]){
			if (visited[x] == 1){
				int y = u;
				vector<int>temp;
				int got = r[x];
				temp.push_back(x);
				while(y!=x){
					got|=r[y];
					temp.push_back(y);
					y = parent[y];
				}
				ans |= got;
				for (auto y:temp)cnt[y]|=got;
			}
			else{
				parent[x] = u;
				ans|=dfs(x);
			}
		}
		visited[u] = 2;
		return cnt[u] |= ans;
	};	
	for (int i = 0;i<n;++i){
		if (cnt[i]){
			ans[i] = true;
			continue;
		}
		for (int j = 0;j<n;++j)visited[j] = false;
		ans[i] = dfs(i);	
	}
	for (int j = 0;j<n;++j){
		for (int i = 0;i<m;++i){
				cnt[u[i]]|=cnt[v[i]];
		}
	}
	for (int i = 0;i<n;++i){
		ans[i]|=cnt[i];
	}
	return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	832 ms	1724 KB	Output is correct
2	Correct	889 ms	1668 KB	Output is correct
3	Correct	929 ms	1580 KB	Output is correct
4	Execution timed out	2097 ms	1492 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-