제출 #92421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92421		qkxwsm	장난감 기차 (IOI17_train)	C++14	11 / 100	81 ms	1400 KiB

train

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#include "train.h"

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM; x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		// x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << x << endl;
#define SZ(x) ((int) (x.size()))
#define FOR(i, a, b) for (auto i = (a), i##__end__ = (b); i < i##__end__; i++)
#define FORD(i, a, b) for (auto i = (a) - 1, i##__end__ = (b); i >= i##__end__; i--)
#define ALL(x) x.begin(), x.end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 5013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N;
vi edge[MAXN];
bitset<MAXN> own, flag;
bitset<MAXN> inside;
vi ans;

vi who_wins(vi a, vi r, vi u, vi v)
{
	N = SZ(a); ans.resize(N);
	FOR(i, 0, N)
	{
		own[i] = a[i];
	}
	FOR(i, 0, N)
	{
		flag[i] = r[i];
	}
	FOR(i, 0, SZ(u))
	{
		edge[u[i]].PB(v[i]);
	}
	FOR(i, 0, N)
	{
		inside[i] = !(flag[i]);
	}
	bool change = true;
	while(change)
	{
		change = false;
		FOR(u, 0, N)
		{
			if (!inside[u]) continue;
			if (own[u])
			{
				for (int v : edge[u])
				{
					if (!inside[v])
					{
						inside[u] = false;
						change = true;
					}
				}
			}
			else
			{
				bool ok = false;
				for (int v : edge[u])
				{
					if (inside[v]) ok = true;
				}
				if (!ok)
				{
					inside[u] = false;
					change = true;
				}
			}
		}
	}
	//once you're inside the trap, you can never get out!
	FOR(i, 0, N)
	{
		ans[i] = (inside[i] ? 0 : 1);
	}
	change = true;
	while(change)
	{
		change = false;
		FOR(u, 0, N)
		{
			if (!ans[u]) continue;
			if (own[u])
			{
				bool ok = false;
				for (int v : edge[u])
				{
					if (ans[v]) ok = true;
				}
				if (!ok)
				{
					ans[u] = 0;
					change = true;
				}
			}
			else
			{
				for (int v : edge[u])
				{
					if (!ans[v])
					{
						ans[u] = 0;
						change = true;
					}
				}
			}
		}
	}
	//if this is in S, then that must be in S
	return ans;
}

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