제출 #296104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296104		Muhammetali	장난감 기차 (IOI17_train)	C++11	5 / 100	12 ms	1920 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;
	set<int>s[6000];
	for (int i=0;i<sz(u);i++)s[u[i]].insert(v[i]);;
	for (int i=0;i<sz(a);i++)
	{
		ll k=i;
		ll jem=0;
		while(1)
		{
			if (s[k].count(k)==1 && a[k]==0 && r[k]==0)
			{
				jem=0;
				break;
			}
			if (s[k].count(k)==1 && a[k]==1 && r[k]==1)
			{
				jem=1;
				break;
			}
			if (s[k].count(k+1)==1)k+=1;
			else
			{
				jem=r[k];
				break;
			}
		}
		res.pb(jem);
	}
	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