oj.uz

답안 #33538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
33538 2017-10-29T16:31:55 Z mohammad_kilani 장난감 기차 (IOI17_train) C++14
0 / 100
 2000 ms 210960 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> a, r;
vector<int> g[N];
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(r[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]);
	memset(dp,-1,sizeof(dp));
	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:16:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0;k<g[i].size();k++){
                ^
train.cpp:23: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:38: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
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 159 ms 153428 KB 3rd lines differ - on the 14th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 8320 KB 3rd lines differ - on the 8th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 546 ms 9552 KB Output is correct
2 Correct 363 ms 9512 KB Output is correct
3 Correct 393 ms 9520 KB Output is correct
4 Execution timed out 2000 ms 210960 KB Execution timed out
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 9204 KB 3rd lines differ - on the 696th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2000 ms 9204 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 159 ms 153428 KB 3rd lines differ - on the 14th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -