Submission #295915

#TimeUsernameProblemLanguageResultExecution timeMemory
295915Muhammetali장난감 기차 (IOI17_train)C++11
0 / 100
7 ms768 KiB
#include "train.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
const int N=2e5+1;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
	vi res;
	int mx=0;
	for (int i=0;i<sz(u);i++)
	{
		if (u[i]==v[i] && a[u[i]]==1 && r[u[i]]==1)
		{
			mx=max(mx,i);
		}
	}
	for (int i=0;i<sz(a);i++)
	{
		if (mx>=i)
		{
			res.pb(1);
		}
		else
		{
			res.pb(0);
		}
	}
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...