제출 #409798

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

train

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

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u , vector<int> v){
	int n = a.size();
	int m = u.size();
	
	vector<int > w(n);
	vector<bool> iscycle(n, 0);
	vector<bool> hasout(n, 0);
	
	for(int i =0; i< m; i++){
		if(u[i] == v[i]){
			iscycle[u[i]] = true;
		}
		else
			hasout[u[i]] = true;
		
	}
	for(int i =0; i< n; i++){
		int winner = 0;
		int energy = n;
		
		int curstation = i;
		while(curstation < n){
			
			if(iscycle[curstation]){
				if(a[curstation] && r[curstation]){
					winner = 1;
					break;
				}
				else if(!a[curstation] && !r[curstation]){
					winner = 0;
					break;
				}
				else if(a[curstation] && !r[curstation] && !hasout[curstation]){
					winner = 0;
					break;
				}
				else if(!a[curstation] && r[curstation] && !hasout[curstation]){
					winner = 1;
					break;
				}
			}
			if(energy == 0){
				winner = 0;
				break;
			}
			energy--;
			curstation++;
		}
		
		for(i = i+0; i<= min(curstation, n-1); i++){
			//cout << i<<", "<<curstation<<endl;
			w[i] = winner;
		}		
		--i;
	}
	
	return w;
}

/*
int main(){
	int n, m; cin >> n >>m;
	vector<int> a(n), r(n), u(m) ,v(m);
	for(int i  = 0; i<n; i++){
		cin >> a[i];
	}
	for(int i =0; i< n; i++)
		cin >> r[i];
	for(int i =0; i<m; i++)
	cin >> u[i];
	for(int i =0; i<m;i++)
	cin >> v[i];
	
	vector<int> w = who_wins(a,r,u,v);
	for(int i=0; i< n ;i++)
		cout << w[i]<<endl;
}*/

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