제출 #139988

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
139988		shashwatchandra	장난감 기차 (IOI17_train)	C++17	0 / 100	14 ms	764 KiB

train

/*input
5 7
0 1 0 0 0 
1 1 0 1 1
0 1
1 2
3 4
0 0
1 1
2 2
4 4
0 1 0 0 1
*/
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define REP(i,n) for(int i = 0;i < n;i++)

const int N = 5001;


int n,m;
bool self[N];
bool nxt[N];

vector<int> who_wins(vector<int> a, vector<int> r,vector<int> u, vector<int> v) {
		n = a.size();
		m = u.size();
		REP(i,n){
			nxt[i] = 0;
			self[i] = 0;
		}
		vector<int> ans;
		REP(i,m){
			if(u[i] == v[i])self[u[i]] = 1;
			else nxt[u[i]] = 1;
		}
		REP(i,n){
			assert(nxt[i]|self[i]);
		}
		REP(i,1){
			int cur = i;
			bool wins = 0;
			while(cur < n){
				cout << cur << endl;
				if(a[cur]){
					if(r[cur]){
						if(self[cur]){
							wins = 1;
							break;
						}
						cur++;
					}
					else{
						if(!nxt[cur]){
							wins = 0;
							break;
						}
						cur++;
					}
				}
				else{
					if(r[cur]){
						if(!nxt[cur]){
							wins = 1;
							break;
						}
						cur++;
					}
					else{
						if(self[cur]){
							wins = 0;;
							break;
						}
						cur++;
					}
				}
			}
			ans.pb(wins);
		}
		return ans;
}

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