Submission #425882

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
425882	2021-06-13T12:10:24 Z	Hazem	Toy Train (IOI17_train)	C++14	0 / 100	2000 ms	1812 KB

train

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

using namespace std;
const int N = 5e3+10;

vector<int>adj[N],R,A;
unordered_set<int>st;
int cnt[N];
int n,m;
bool vis[N];

bool dfs(int i,int pre){

	if(vis[i])
		return 0;

	st.insert(i);
	vis[i] = 1;
	cnt[i] += cnt[pre]+R[i];
	bool ret = 0;
	for(auto x:adj[i]){
		ret |= dfs(x,i);
		if(st.find(x)==st.end())
			continue;
		if(cnt[i]-cnt[x]+R[x]>0)ret = 1;
	}
	st.erase(i);
	return ret;
}

vector<int>ans;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {

	n = a.size(),m = u.size();
	A = a;R = r;
	for(int i=0;i<m;i++)
		adj[u[i]].push_back(v[i]);
	
	for(int i=0;i<n;i++){
		ans.push_back(dfs(i,n+1));
		memset(vis,0,sizeof(vis));
		memset(cnt,0,sizeof(cnt));
	}
	return ans;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1012 ms	1460 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	1 ms	332 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	983 ms	1812 KB	Output is correct
2	Correct	1025 ms	1612 KB	Output is correct
3	Correct	1024 ms	1596 KB	Output is correct
4	Execution timed out	2078 ms	1436 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-