제출 #301564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301564		TMJN	장난감 기차 (IOI17_train)	C++17	5 / 100	8 ms	1792 KiB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;

int N,M;
vector<int>E[5000];

vector<int> who_wins(vector<int>a,vector<int>r,vector<int>u,vector<int>v){
	N=a.size();
	M=u.size();
	for(int i=0;i<M;i++){
		E[u[i]].push_back(v[i]);
		assert(u[i]==v[i]||v[i]==u[i]+1);
	}
	vector<int>winner(N,0xE869120);
	for(int i=N-1;i>=0;i--){
		winner[i]=!a[i];
		for(int e:E[i]){
			if(a[i]==1&&r[i]==1&&e==i){
				winner[i]=1;
			}
			if(a[i]==1&&winner[e]==1){
				winner[i]=1;
			}
			if(a[i]==0&&r[i]==0&&e==i){
				winner[i]=0;
			}
			if(a[i]==0&&winner[e]==0){
				winner[i]=0;
			}
		}
	}
	return winner;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51