제출 #138240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138240		rajarshi_basu	장난감 기차 (IOI17_train)	C++14	5 / 100	9 ms	892 KiB

train

#include <bits/stdc++.h>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define vi vector<int>
#define ff first
#define ss second
#define vv vector
#define ii pair<int,int>

using namespace std;

const int MAXN = 5001;

bool self[MAXN];
bool nxt[MAXN];

vi who_wins(vi a,vi r,vi u,vi v){
	int m = u.size();
	int n = a.size();
	FOR(i,m){
		if(u[i] == v[i])self[u[i]] = 1;
		else nxt[u[i]] = 1;
	}
	vi arr(n);
	for(int i = n-1;i >= 0;i--){
		if(a[i] == 0 and r[i] == 0){
			if(self[i])arr[i] = 0;
			else arr[i] = arr[i+1];
		}else if(a[i] == 0 and r[i] == 1){
			if(nxt[i])arr[i] = arr[i+1];
			else arr[i] = 1;
		}else if(a[i] == 1 and r[i] == 0){
			if(nxt[i])arr[i] = arr[i+1];
			else arr[i] = 0;
		}else{
			if(self[i])arr[i] = 1;
			else arr[i] = arr[i+1];
		}
	}
	return arr;
}

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