oj.uz

답안 #1104709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104709 2024-10-24T09:10:34 Z alexander707070 장난감 기차 (IOI17_train) C++14
10 / 100
 9 ms 27728 KB 
#include<bits/stdc++.h>
#define MAXN 1000007
using namespace std;

int n;
bool is[MAXN],sp[MAXN];
vector<int> v[MAXN],ans;
int tim[MAXN];

bool brute(int x,int last,int t){
	tim[x]=t;
	if(sp[x])last=t;

	for(int i=0;i<v[x].size();i++){
		if(is[x]){
			if(tim[v[x][i]]!=0 and tim[v[x][i]]<=last){
				tim[x]=0; return true;
			}
		}else{
			if(tim[v[x][i]]!=0 and tim[v[x][i]]>last){
				tim[x]=0; return false;
			}
		}
	}

	for(int i=0;i<v[x].size();i++){
		if(tim[v[x][i]]!=0)continue;

		if(is[x]){
			if(brute(v[x][i],last,t+1)){
				tim[x]=0; return true;
			}
		}else{
			if(!brute(v[x][i],last,t+1)){
				tim[x]=0; return false;
			}
		}
	}

	tim[x]=0;
	return !is[x];
}

vector<int> who_wins(vector<int> A,vector<int> R, vector<int> from,vector<int> to){
	n=int(A.size());

	for(int i=1;i<=n;i++){
		is[i]=A[i-1];
		sp[i]=R[i-1];
	}

	for(int i=1;i<=from.size();i++){
		v[from[i-1]+1].push_back(to[i-1]+1);
	}

	if(n<=15){
		for(int i=1;i<=n;i++){
			for(int f=1;f<=n;f++)tim[f]=0;

			if(brute(i,0,1))ans.push_back(1);
			else ans.push_back(0);
		}
	}

	return ans;
}

/*int main(){

	ans=who_wins({0, 1}, {1, 0}, {0, 0, 1, 1}, {0, 1, 0, 1});

	for(int i:ans)cout<<i<<" ";

	return 0;
}*/

Compilation message

train.cpp: In function 'bool brute(int, int, int)':
train.cpp:14:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i=0;i<v[x].size();i++){
      |              ~^~~~~~~~~~~~
train.cpp:26:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for(int i=0;i<v[x].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:52:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int i=1;i<=from.size();i++){
      |              ~^~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 27216 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 26960 KB Output is correct
2 Correct 6 ms 26960 KB Output is correct
3 Correct 5 ms 26960 KB Output is correct
4 Correct 5 ms 26960 KB Output is correct
5 Correct 5 ms 26960 KB Output is correct
6 Correct 5 ms 26960 KB Output is correct
7 Correct 5 ms 26960 KB Output is correct
8 Correct 6 ms 26960 KB Output is correct
9 Correct 6 ms 26960 KB Output is correct
10 Correct 6 ms 27128 KB Output is correct
11 Correct 6 ms 26960 KB Output is correct
12 Correct 6 ms 26960 KB Output is correct
13 Correct 5 ms 26960 KB Output is correct
14 Correct 5 ms 26960 KB Output is correct
15 Correct 5 ms 27128 KB Output is correct
16 Correct 6 ms 27096 KB Output is correct
17 Correct 5 ms 26960 KB Output is correct
18 Correct 6 ms 26960 KB Output is correct
19 Correct 6 ms 26960 KB Output is correct
20 Correct 4 ms 26960 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 27728 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 27472 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 27728 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 27216 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -