#include<bits/stdc++.h>
/*#include <cstdio>
#include <vector>
#include <cassert>*/
#include "train.h"
using namespace std;
const int MAX_GARE=5000;
int nbGare,nbChemin,nbBon,deb;
int boucle[MAX_GARE];
int charge[MAX_GARE];
vector<int> rep;
vector<int> who_wins(vector<int> posses, vector<int> recharge, vector<int> dep, vector<int> arriv) {
nbGare=posses.size();
for (int i=0;i<nbGare;i++) {
rep.push_back(0);
charge[i]=recharge[i];
}
nbChemin=dep.size();
for (int i=0;i<nbChemin;i++) {
if (dep[i]==arriv[i]) {
boucle[dep[i]]=1;
}
}
rep[nbGare-1]=charge[nbGare-1];
for (int i=nbGare-2;i>=0;i--) {
if (boucle[i]==0) {
rep[i]=rep[i+1];
}
else {
if (posses[i]==0) {
rep[i]=min(charge[i],rep[i+1]);
}
else {
rep[i]=max(charge[i],rep[i+1]);
}
}
}
return rep;
}
/*
int main() {
int n, m;
assert(2 == scanf("%d %d", &n, &m));
vector<int> a(n), r(n), u(m), v(m);
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &a[i]));
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &r[i]));
for(int i = 0; i < m; i++)
assert(2 == scanf("%d %d", &u[i], &v[i]));
vector<int> res = who_wins(a, r, u, v);
for(int i = 0; i < (int)res.size(); i++)
printf(i ? " %d" : "%d", res[i]);
printf("\n");
return 0;
}*/
