Submission #113481

#	Time	Username	Problem	Language	Result	Execution time	Memory
113481		E869120	Toy Train (IOI17_train)	C++14	5 / 100	7 ms	1052 KiB

train

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

int N, M;
int A[20009], R[20009], U[20009], V[20009];
bool u1[20009], u2[20009];

vector<int> solve_subtask1() {
	for (int i = 0; i < M; i++) {
		if (V[i] - U[i] == 0) u1[U[i]] = true;
		if (V[i] - U[i] == 1) u2[U[i]] = true;
	}
	vector<int>ans;
	for (int i = 0; i < N; i++) {
		bool arezou = false;
		for (int j = i; j < N; j++) {
			if (u1[j] == true && A[j] == 1 && R[j] == 1) { arezou = true; break; }
			if (u1[j] == true && A[j] == 0 && R[j] == 0) { break; }
			if (u2[j] == false) {
				if (R[j] == 1) arezou = true;
				break;
			}
		}
		ans.push_back((int)arezou);
	}
	return ans;
}

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 < N; i++) { A[i] = a[i]; R[i] = r[i]; }
	for (int i = 0; i < M; i++) { U[i] = u[i]; V[i] = v[i]; }
	
	return solve_subtask1();
}

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