oj.uz

Submission #33547

# Submission time Handle Problem Language Result Execution time Memory
33547 2017-10-29T17:20:01 Z mohammad_kilani Toy Train (IOI17_train) C++14
5 / 100
 2000 ms 210964 KB 
#include <bits/stdc++.h>
#include "train.h"
using namespace std;
const int N = 5010;
int n ;
bitset< N > dp[N] , vis[N];
vector<int> g[N] , a , r;
bool solve(int i, int j){
	if(r[i]) j = n;
	if(j == 0) return 0;
	if(vis[i][j]) return dp[i][j];
	vis[i][j] = 1;
	dp[i][j] = 1;
	if(!a[i]){
		for(int k=0;k<g[i].size();k++){
			int node = g[i][k];
			if(solve(node,j-1) == 0) dp[i][j] = 0;
		}
	}
	else{
		bool can = false;
		for(int k=0;k<g[i].size();k++){
			int node = g[i][k];
			if(solve(node,j-1) == 1) can = true;
		}
		dp[i][j] = can;
	}
	return dp[i][j];
}


std::vector<int> who_wins(std::vector<int> A, std::vector<int> R, std::vector<int> u, std::vector<int> v) {
	vector<int> ans;
	a = A;
	r = R;;
	n = a.size();
	for(int i=0;i<u.size();i++) g[u[i]].push_back(v[i]);
	for(int i=0;i<n;i++){
		ans.push_back(solve(i,n));
	}
	return ans;
}

Compilation message

train.cpp: In function 'bool solve(int, int)':
train.cpp:15:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0;k<g[i].size();k++){
                ^
train.cpp:22:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0;k<g[i].size();k++){
                ^
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<u.size();i++) g[u[i]].push_back(v[i]);
               ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 153424 KB Output is correct
2 Correct 156 ms 80628 KB Output is correct
3 Correct 163 ms 48136 KB Output is correct
4 Correct 163 ms 25824 KB Output is correct
5 Correct 156 ms 17604 KB Output is correct
6 Correct 153 ms 12124 KB Output is correct
7 Correct 173 ms 12904 KB Output is correct
8 Correct 156 ms 13292 KB Output is correct
9 Correct 143 ms 10952 KB Output is correct
10 Correct 163 ms 9784 KB Output is correct
11 Correct 236 ms 8988 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 9556 KB Output is correct
2 Correct 403 ms 9516 KB Output is correct
3 Correct 389 ms 9520 KB Output is correct
4 Execution timed out 2000 ms 210964 KB Execution timed out
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9200 KB Output is correct
2 Correct 99 ms 9176 KB Output is correct
3 Incorrect 96 ms 9360 KB 3rd lines differ - on the 282nd token, expected: '0', found: '1'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2000 ms 9212 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 153424 KB Output is correct
2 Correct 156 ms 80628 KB Output is correct
3 Correct 163 ms 48136 KB Output is correct
4 Correct 163 ms 25824 KB Output is correct
5 Correct 156 ms 17604 KB Output is correct
6 Correct 153 ms 12124 KB Output is correct
7 Correct 173 ms 12904 KB Output is correct
8 Correct 156 ms 13292 KB Output is correct
9 Correct 143 ms 10952 KB Output is correct
10 Correct 163 ms 9784 KB Output is correct
11 Correct 236 ms 8988 KB Output is correct
12 Correct 0 ms 8320 KB Output is correct
13 Correct 0 ms 8320 KB Output is correct
14 Correct 0 ms 8320 KB Output is correct
15 Incorrect 0 ms 8320 KB 3rd lines differ - on the 4th token, expected: '0', found: '1'
16 Halted 0 ms 0 KB -