Submission #1025858

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1025858	2024-07-17T10:49:45 Z	amirhoseinfar1385	Toy Train (IOI17_train)	C++17	0 / 100	1671 ms	2808 KB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=30000+10;
vector<int>adj[maxn],revadj[maxn];
int n,shar[maxn],arez[maxn],m,dp[maxn],vas[maxn],dide[maxn];

void bfs(){
	vector<int>bf;
	for(int i=0;i<n;i++){
		vas[i]=0;
		if(dp[i]==1){
			bf.push_back(i);
		}
	}
	for(int u=0;u<(int)bf.size();u++){
		for(auto i:adj[bf[u]]){
			if(vas[i]){
				continue;
			}
			vas[i]=1;
			int cnt=0;
			int f=0;
			for(auto x:adj[i]){
				if(dp[x]==1){
					cnt++;
				}
			}
			if(arez[i]){
				if(cnt>0){
					dp[i]=1;
					bf.push_back(i);
				}else{
					dp[i]=0;
				}
			}else{
				if(cnt!=(int)adj[i].size()){
					dp[i]=0;
				}else{
					dp[i]=1;
					bf.push_back(i);
				}
			}
		}
	}
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n=(int)a.size();
	m=(int)u.size();
	for(int i=0;i<=n;i++){
		adj[i].clear();
		revadj[i].clear();
		shar[i]=vas[i]=dide[i]=dp[i]=arez[i]=0;
	}
	for(int i=0;i<n;i++){
		if(a[i]){
			arez[i]=1;
		}
		if(r[i]){
			shar[i]=1;
		}
	}
	for(int i=0;i<m;i++){
		revadj[v[i]].push_back(u[i]);
		adj[u[i]].push_back(v[i]);
	}
	for(int nago=0;nago<=n;nago++){
		for(int i=0;i<n;i++){
			dp[i]=shar[i];
		}
		bfs();
	/*for(int asd=0;asd<=n;asd++){
		for(int i=0;i<n;i++){
			if(dp[i]){
				continue;
			}
			int cnt=0;
			int f=0;
			for(auto x:adj[i]){
				if(dp[x]==1){
					cnt++;
				}
			}
			if(arez[i]){
				if(cnt>0){
					dp[i]=1;
				}else{
					dp[i]=0;
				}
			}else{
				if(cnt!=(int)adj[i].size()){
					dp[i]=0;
				}else{
					dp[i]=1;
				}
			}
		}
	}*/
		if(nago!=n){
			for(int i=0;i<n;i++){
				if(shar[i]==1){
					int cnt=0;
					for(auto x:adj[i]){
						if(dp[x]==1){
							cnt++;
						}
					}
					if(arez[i]){
						shar[i]=(cnt>=1);
					}else{
						shar[i]=(cnt==(int)adj[i].size());
					}
				}
			}
		}
	}
	vector<int>res(n);
	for(int i=0;i<n;i++){
		res[i]=dp[i];
	}
	return res;
}

Compilation message

train.cpp: In function 'void bfs()':
train.cpp:23:8: warning: unused variable 'f' [-Wunused-variable]
   23 |    int f=0;
      |        ^

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	1628 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	47 ms	2648 KB	Output is correct
2	Correct	54 ms	2652 KB	Output is correct
3	Correct	78 ms	2648 KB	Output is correct
4	Incorrect	1671 ms	2808 KB	3rd lines differ - on the 13th token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-