Submission #64834

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
64834	2018-08-05T19:39:37 Z	mohammad_kilani	Toy Train (IOI17_train)	C++17	0 / 100	474 ms	1684 KB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5010;
vector< int > res , a , g[N] , r , g2[N];
int n , vis[N] , vi = 0 , last , out[N];


void make(int node){
	for(int i=0;i<g2[node].size();i++){
		if(res[g2[node][i]] != -1) continue;
		out[g2[node][i]]--;
		if(a[g2[node][i]] == a[node]){
			if(res[node] == a[node]){
				res[g2[node][i]] = a[node];
				make(g2[node][i]);
			}
			else{
				if(out[g2[node][i]] == 0){
					res[g2[node][i]] = a[node] ^ 1;
					make(g2[node][i]);
				}
			}
		}
		else{
			if(res[node] == a[node]){
				if(out[g2[node][i]] == 0){
					res[g2[node][i]] = a[node];
					make(g2[node][i]);
				}
			}
			else{
				res[g2[node][i]] = a[node] ^ 1;
				make(g2[node][i]);
			}
		}
	}
}

bool DFS(int node){
	vis[node] = vi;
	if(a[node] == 0 && r[node])
		return false;
	if(node == last)
		return true;
	for(int i=0;i<g[node].size();i++){
		if(vis[g[node][i]] != vi && a[g[node][i]] == a[last]){
			if(DFS(g[node][i]))
				return true;
		}
	}
	return false;
}


std::vector<int> who_wins(std::vector<int> A, std::vector<int> R, std::vector<int> u, std::vector<int> v) {
	a = A;
	n = (int)a.size();
	r = R;
	res.resize(n , -1);
	for(int i = 0;i<(int)u.size();i++){
		g[u[i]].push_back(v[i]);
	}
	for(int i=0;i<n;i++){
		if(res[i] != -1) continue;
		last = i;
		vi++;
		if(a[i] == 0 || r[i]){
			for(int j = 0;j<g[i].size();j++){
				if(a[g[i][j]] == a[i] && vis[g[i][j]] != vi && DFS(g[i][j])){
					res[i] = a[i];
					break;
				}
			}
		}
		if(res[i] != -1)
			make(i);

	}
	for(int i=0;i<n;i++){
		if(res[i] == -1)
			res[i] = a[i] ^ 1;
	}
	return res;
}

Compilation message

train.cpp: In function 'void make(int)':
train.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g2[node].size();i++){
              ~^~~~~~~~~~~~~~~~
train.cpp: In function 'bool DFS(int)':
train.cpp:46:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[node].size();i++){
              ~^~~~~~~~~~~~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0;j<g[i].size();j++){
                  ~^~~~~~~~~~~~

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	1016 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	3 ms	1016 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	18 ms	1440 KB	Output is correct
2	Correct	43 ms	1440 KB	Output is correct
3	Correct	86 ms	1512 KB	Output is correct
4	Incorrect	191 ms	1684 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-