제출 #295925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
295925		Muhammetali	Toy Train (IOI17_train)	C++11	0 / 100	10 ms	1152 KiB

train

#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;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
	vi res,yol[6000];
	int mx=0;
	for (int i=0;i<sz(u);i++)
	{
		yol[u[i]].pb(v[i]);
	}
	for (int i=0;i<sz(u);i++)
	{
		if (u[i]==v[i] && a[u[i]]==1 && r[u[i]]==1)
		{
			mx=max(mx,u[i]);
		}
		if (yol[u[i]].size()==1 && yol[u[i]][0]==u[i] && r[u[i]]==1)
		{
			mx=max(mx,u[i]);
		}
	}
	for (int i=0;i<sz(a);i++)
	{
		if (mx>=i)
		{
			res.pb(1);
		}
		else
		{
			res.pb(0);
		}
	}
	return res;
}

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