답안 #201183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201183	2020-02-09T15:51:08 Z	faremy	장난감 기차 (IOI17_train)	C++14	100 / 100	348 ms	1532 KB

train

#include "train.h"

#include <algorithm>
#include <vector>


const int MAXN = 5e3;

int owner[MAXN], charge[MAXN];
std::vector<int> graph[MAXN];
int degree[MAXN];

std::vector<int> undet;
std::vector<int> removing;
bool toRemove[MAXN], removed[MAXN];
int currentDeg[MAXN];


void reset()
{
	for (int node : undet)
	{
		toRemove[node] = false;
		removed[node] = false;
		currentDeg[node] = degree[node];
	}
}

void flipowners()
{
	for (int node : undet)
		owner[node] = 1 - owner[node];
}

void removal()
{
	for (int node : undet)
		if (toRemove[node])
		{
			removing.emplace_back(node);
			removed[node] = true;
		}

	while (!removing.empty())
	{
		int rm = removing.back();
		removing.pop_back();

		for (int next : graph[rm])
			if (!removed[next])
			{
				currentDeg[next]--;
				if (owner[next] == 1 || currentDeg[next] == 0)
				{
					removing.emplace_back(next);
					removed[next] = true;
				}
			}
	}
}

void findlosers()
{
	reset();
	for (int node : undet)
		toRemove[node] = charge[node];
	removal();

	std::vector<int> losers;
	for (int node : undet)
		if (!removed[node])
			losers.emplace_back(node);

	reset();
	flipowners();

	for (int node : losers)
		toRemove[node] = true;
	removal();
	flipowners();
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
	int stations = a.size();
	int tracks = u.size();

	std::vector<int> winner(stations, 0);
	for (int iNode = 0; iNode < stations; iNode++)
	{
		owner[iNode] = a[iNode];
		charge[iNode] = r[iNode];
		undet.emplace_back(iNode);
	}

	for (int iEdge = 0; iEdge < tracks; iEdge++)
	{
		graph[v[iEdge]].emplace_back(u[iEdge]);
		degree[u[iEdge]]++;
	}

	while (!undet.empty())
	{
		findlosers();
		std::vector<int> losers;

		for (int node : undet)
			if (removed[node])
				losers.emplace_back(node);

		if (losers.empty())
		{
			for (int node : undet)
				winner[node] = 1;
			undet.clear();
		}
		else
		{
			for (int node : losers)
			{
				for (int next : graph[node])
					degree[next]--;
				undet.erase(std::find(undet.begin(), undet.end(), node));
			}
		}
	}

	return winner;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	1016 KB	Output is correct
2	Correct	25 ms	1144 KB	Output is correct
3	Correct	24 ms	1016 KB	Output is correct
4	Correct	25 ms	1144 KB	Output is correct
5	Correct	24 ms	1016 KB	Output is correct
6	Correct	23 ms	1016 KB	Output is correct
7	Correct	32 ms	1016 KB	Output is correct
8	Correct	13 ms	1016 KB	Output is correct
9	Correct	24 ms	1016 KB	Output is correct
10	Correct	25 ms	1016 KB	Output is correct
11	Correct	23 ms	1144 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	504 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	504 KB	Output is correct
5	Correct	5 ms	504 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	504 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	504 KB	Output is correct
15	Correct	5 ms	504 KB	Output is correct
16	Correct	5 ms	504 KB	Output is correct
17	Correct	5 ms	504 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	504 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	125 ms	1400 KB	Output is correct
2	Correct	183 ms	1400 KB	Output is correct
3	Correct	206 ms	1532 KB	Output is correct
4	Correct	13 ms	1400 KB	Output is correct
5	Correct	22 ms	1400 KB	Output is correct
6	Correct	33 ms	1400 KB	Output is correct
7	Correct	13 ms	1400 KB	Output is correct
8	Correct	30 ms	1400 KB	Output is correct
9	Correct	41 ms	1400 KB	Output is correct
10	Correct	23 ms	1400 KB	Output is correct
11	Correct	25 ms	1528 KB	Output is correct
12	Correct	40 ms	1400 KB	Output is correct
13	Correct	12 ms	1400 KB	Output is correct
14	Correct	13 ms	1400 KB	Output is correct
15	Correct	12 ms	1400 KB	Output is correct
16	Correct	12 ms	1388 KB	Output is correct
17	Correct	12 ms	1400 KB	Output is correct
18	Correct	287 ms	1272 KB	Output is correct

Subtask #4
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	1272 KB	Output is correct
2	Correct	22 ms	1272 KB	Output is correct
3	Correct	39 ms	1400 KB	Output is correct
4	Correct	44 ms	1400 KB	Output is correct
5	Correct	31 ms	1400 KB	Output is correct
6	Correct	22 ms	1400 KB	Output is correct
7	Correct	24 ms	1400 KB	Output is correct
8	Correct	37 ms	1400 KB	Output is correct
9	Correct	21 ms	1272 KB	Output is correct
10	Correct	12 ms	1400 KB	Output is correct
11	Correct	13 ms	1400 KB	Output is correct
12	Correct	19 ms	1400 KB	Output is correct
13	Correct	28 ms	1400 KB	Output is correct
14	Correct	22 ms	1272 KB	Output is correct

Subtask #5
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	1400 KB	Output is correct
2	Correct	13 ms	1400 KB	Output is correct
3	Correct	20 ms	1400 KB	Output is correct
4	Correct	12 ms	1272 KB	Output is correct
5	Correct	5 ms	504 KB	Output is correct
6	Correct	35 ms	1016 KB	Output is correct
7	Correct	9 ms	1016 KB	Output is correct
8	Correct	10 ms	1016 KB	Output is correct
9	Correct	9 ms	1016 KB	Output is correct
10	Correct	6 ms	632 KB	Output is correct
11	Correct	10 ms	1016 KB	Output is correct

Subtask #6
51.0 / 51.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	1016 KB	Output is correct
2	Correct	25 ms	1144 KB	Output is correct
3	Correct	24 ms	1016 KB	Output is correct
4	Correct	25 ms	1144 KB	Output is correct
5	Correct	24 ms	1016 KB	Output is correct
6	Correct	23 ms	1016 KB	Output is correct
7	Correct	32 ms	1016 KB	Output is correct
8	Correct	13 ms	1016 KB	Output is correct
9	Correct	24 ms	1016 KB	Output is correct
10	Correct	25 ms	1016 KB	Output is correct
11	Correct	23 ms	1144 KB	Output is correct
12	Correct	5 ms	504 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	504 KB	Output is correct
16	Correct	5 ms	504 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	5 ms	380 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	504 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	504 KB	Output is correct
26	Correct	5 ms	504 KB	Output is correct
27	Correct	5 ms	504 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	376 KB	Output is correct
32	Correct	125 ms	1400 KB	Output is correct
33	Correct	183 ms	1400 KB	Output is correct
34	Correct	206 ms	1532 KB	Output is correct
35	Correct	13 ms	1400 KB	Output is correct
36	Correct	22 ms	1400 KB	Output is correct
37	Correct	33 ms	1400 KB	Output is correct
38	Correct	13 ms	1400 KB	Output is correct
39	Correct	30 ms	1400 KB	Output is correct
40	Correct	41 ms	1400 KB	Output is correct
41	Correct	23 ms	1400 KB	Output is correct
42	Correct	25 ms	1528 KB	Output is correct
43	Correct	40 ms	1400 KB	Output is correct
44	Correct	12 ms	1400 KB	Output is correct
45	Correct	13 ms	1400 KB	Output is correct
46	Correct	12 ms	1400 KB	Output is correct
47	Correct	12 ms	1388 KB	Output is correct
48	Correct	12 ms	1400 KB	Output is correct
49	Correct	287 ms	1272 KB	Output is correct
50	Correct	11 ms	1272 KB	Output is correct
51	Correct	22 ms	1272 KB	Output is correct
52	Correct	39 ms	1400 KB	Output is correct
53	Correct	44 ms	1400 KB	Output is correct
54	Correct	31 ms	1400 KB	Output is correct
55	Correct	22 ms	1400 KB	Output is correct
56	Correct	24 ms	1400 KB	Output is correct
57	Correct	37 ms	1400 KB	Output is correct
58	Correct	21 ms	1272 KB	Output is correct
59	Correct	12 ms	1400 KB	Output is correct
60	Correct	13 ms	1400 KB	Output is correct
61	Correct	19 ms	1400 KB	Output is correct
62	Correct	28 ms	1400 KB	Output is correct
63	Correct	22 ms	1272 KB	Output is correct
64	Correct	29 ms	1400 KB	Output is correct
65	Correct	13 ms	1400 KB	Output is correct
66	Correct	20 ms	1400 KB	Output is correct
67	Correct	12 ms	1272 KB	Output is correct
68	Correct	5 ms	504 KB	Output is correct
69	Correct	35 ms	1016 KB	Output is correct
70	Correct	9 ms	1016 KB	Output is correct
71	Correct	10 ms	1016 KB	Output is correct
72	Correct	9 ms	1016 KB	Output is correct
73	Correct	6 ms	632 KB	Output is correct
74	Correct	10 ms	1016 KB	Output is correct
75	Correct	194 ms	1400 KB	Output is correct
76	Correct	221 ms	1400 KB	Output is correct
77	Correct	256 ms	1400 KB	Output is correct
78	Correct	254 ms	1400 KB	Output is correct
79	Correct	258 ms	1400 KB	Output is correct
80	Correct	18 ms	1400 KB	Output is correct
81	Correct	35 ms	1400 KB	Output is correct
82	Correct	26 ms	1400 KB	Output is correct
83	Correct	22 ms	1400 KB	Output is correct
84	Correct	27 ms	1400 KB	Output is correct
85	Correct	33 ms	1400 KB	Output is correct
86	Correct	28 ms	1400 KB	Output is correct
87	Correct	37 ms	1400 KB	Output is correct
88	Correct	32 ms	1400 KB	Output is correct
89	Correct	33 ms	1400 KB	Output is correct
90	Correct	35 ms	1400 KB	Output is correct
91	Correct	33 ms	1400 KB	Output is correct
92	Correct	37 ms	1400 KB	Output is correct
93	Correct	41 ms	1400 KB	Output is correct
94	Correct	41 ms	1400 KB	Output is correct
95	Correct	40 ms	1400 KB	Output is correct
96	Correct	84 ms	1272 KB	Output is correct
97	Correct	235 ms	1400 KB	Output is correct
98	Correct	348 ms	1408 KB	Output is correct
99	Correct	344 ms	1400 KB	Output is correct
100	Correct	285 ms	1144 KB	Output is correct

답안 #201183

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 11.0 / 11.0

Subtask #4 11.0 / 11.0

Subtask #5 12.0 / 12.0

Subtask #6 51.0 / 51.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
11.0 / 11.0

Subtask #4
11.0 / 11.0

Subtask #5
12.0 / 12.0

Subtask #6
51.0 / 51.0