제출 #1025822

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

train

// In the name of Allah

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

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		X						real()
#define		Y						imag()
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5 + 7;

int n, m;
pii A[maxn]; vector<int> res;
bool M[maxn], Mx[maxn];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> ux, vector<int> vx) {
	n = len(a); m = len(ux);
	for (int i = 0; i < n; i++) A[i] = Mp(a[i], r[i]);
	for (int i = 0; i < m; i++) {
		int u = ux[i], v = vx[i];
		if (u == v) M[u] = 1;
		else Mx[u] = 1;
	}
	res.resize(n);
	
	for (int i = n - 1; i >= 0; i--) {
		if (!M[i]) res[i] = res[i + 1];
		else {
			if (A[i].F == 1) {
				if (A[i].S == 1) res[i] = 1;
				else if (Mx[i]) res[i] = res[i + 1];
				else res[i] = 0;
			}
			else {
				if (A[i].S == 0) res[i] = 0;
				else if (Mx[i]) res[i] = res[i + 1];
				else res[i] = 1;
			}
		}
	}
	return res;
}

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