oj.uz

답안 #592468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592468 2022-07-09T08:42:56 Z franfill 장난감 기차 (IOI17_train) C++17
100 / 100
 889 ms 1716 KB 
#include "train.h"
#include<queue>
#include<iostream>
using namespace std;

vector<int> who_wins(vector<int> a, vector<int> re, vector<int> u, vector<int> v) {
	int n = a.size(), m = u.size();
	vector < vector < int > > g(n);
	vector < vector < int > > r(n);
	for (int i = 0; i < m; i++)
	{
		g[u[i]].emplace_back(v[i]);
		r[v[i]].emplace_back(u[i]);
	}	

	vector < bool > used(n, 0);
	while(true)
	{
		vector < bool > good(n);
		queue < int > q;
		for (int i = 0; i < n; i++) if (!used[i])
		{
			if (re[i]) 
			{
				good[i] = true;
				q.emplace(i);
			}
		}
		vector < int > cnt(n, 0);
		for (int x = 0; x < n; x++)
		{
			for (auto y : g[x]) if (used[y])
			{
				cnt[x]++;
			}
		}

		while(!q.empty())
		{
			int x = q.front();
			q.pop();

			for (auto y : r[x]) if (!used[y] && !good[y])
			{
				cnt[y]++;
				if (a[y] || cnt[y] == g[y].size())
				{
					good[y] = true;
					q.emplace(y);
				}
			}
		}

		cnt.assign(n, 0);
		for (int x = 0; x < n; x++)
		{
			for (auto y : g[x]) if (used[y])
			{
				cnt[x]++;
			}
		}
		
		bool ok = true;
		for (int x = 0; x < n; x++) if (!used[x] && !good[x]) 
		{
			used[x] = true;
			q.push(x);
			ok = false;
		}
		if (ok) break;

		while(!q.empty())
		{
			int x = q.front();
			q.pop();

			for (auto y : r[x]) if (!used[y])
			{
				cnt[y]++;
				if (!a[y] || cnt[y] == g[y].size())
				{
					used[y] = true;
					q.emplace(y);
				}
			}
		}
	}
	vector < int > ans;
	for (auto b : used)
	{
		if (b) ans.emplace_back(0);
		else ans.emplace_back(1);
	}

	return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:46:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     if (a[y] || cnt[y] == g[y].size())
train.cpp:80:25: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     if (!a[y] || cnt[y] == g[y].size())

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1088 KB Output is correct
6 Correct 5 ms 1084 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 1620 KB Output is correct
2 Correct 257 ms 1620 KB Output is correct
3 Correct 372 ms 1604 KB Output is correct
4 Correct 8 ms 1620 KB Output is correct
5 Correct 10 ms 1596 KB Output is correct
6 Correct 11 ms 1620 KB Output is correct
7 Correct 7 ms 1500 KB Output is correct
8 Correct 8 ms 1572 KB Output is correct
9 Correct 7 ms 1548 KB Output is correct
10 Correct 8 ms 1468 KB Output is correct
11 Correct 8 ms 1440 KB Output is correct
12 Correct 7 ms 1492 KB Output is correct
13 Correct 8 ms 1620 KB Output is correct
14 Correct 8 ms 1620 KB Output is correct
15 Correct 8 ms 1588 KB Output is correct
16 Correct 7 ms 1592 KB Output is correct
17 Correct 10 ms 1600 KB Output is correct
18 Correct 405 ms 1208 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1364 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 8 ms 1600 KB Output is correct
4 Correct 8 ms 1596 KB Output is correct
5 Correct 8 ms 1580 KB Output is correct
6 Correct 7 ms 1584 KB Output is correct
7 Correct 7 ms 1492 KB Output is correct
8 Correct 7 ms 1468 KB Output is correct
9 Correct 8 ms 1468 KB Output is correct
10 Correct 7 ms 1604 KB Output is correct
11 Correct 7 ms 1596 KB Output is correct
12 Correct 7 ms 1620 KB Output is correct
13 Correct 8 ms 1504 KB Output is correct
14 Correct 7 ms 1444 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1620 KB Output is correct
2 Correct 9 ms 1624 KB Output is correct
3 Correct 8 ms 1620 KB Output is correct
4 Correct 9 ms 1432 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 1088 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 5 ms 980 KB Output is correct
9 Correct 5 ms 1056 KB Output is correct
10 Correct 2 ms 500 KB Output is correct
11 Correct 4 ms 980 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1088 KB Output is correct
6 Correct 5 ms 1084 KB Output is correct
7 Correct 4 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 304 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 124 ms 1620 KB Output is correct
33 Correct 257 ms 1620 KB Output is correct
34 Correct 372 ms 1604 KB Output is correct
35 Correct 8 ms 1620 KB Output is correct
36 Correct 10 ms 1596 KB Output is correct
37 Correct 11 ms 1620 KB Output is correct
38 Correct 7 ms 1500 KB Output is correct
39 Correct 8 ms 1572 KB Output is correct
40 Correct 7 ms 1548 KB Output is correct
41 Correct 8 ms 1468 KB Output is correct
42 Correct 8 ms 1440 KB Output is correct
43 Correct 7 ms 1492 KB Output is correct
44 Correct 8 ms 1620 KB Output is correct
45 Correct 8 ms 1620 KB Output is correct
46 Correct 8 ms 1588 KB Output is correct
47 Correct 7 ms 1592 KB Output is correct
48 Correct 10 ms 1600 KB Output is correct
49 Correct 405 ms 1208 KB Output is correct
50 Correct 8 ms 1364 KB Output is correct
51 Correct 8 ms 1492 KB Output is correct
52 Correct 8 ms 1600 KB Output is correct
53 Correct 8 ms 1596 KB Output is correct
54 Correct 8 ms 1580 KB Output is correct
55 Correct 7 ms 1584 KB Output is correct
56 Correct 7 ms 1492 KB Output is correct
57 Correct 7 ms 1468 KB Output is correct
58 Correct 8 ms 1468 KB Output is correct
59 Correct 7 ms 1604 KB Output is correct
60 Correct 7 ms 1596 KB Output is correct
61 Correct 7 ms 1620 KB Output is correct
62 Correct 8 ms 1504 KB Output is correct
63 Correct 7 ms 1444 KB Output is correct
64 Correct 9 ms 1620 KB Output is correct
65 Correct 9 ms 1624 KB Output is correct
66 Correct 8 ms 1620 KB Output is correct
67 Correct 9 ms 1432 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 1088 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 5 ms 980 KB Output is correct
72 Correct 5 ms 1056 KB Output is correct
73 Correct 2 ms 500 KB Output is correct
74 Correct 4 ms 980 KB Output is correct
75 Correct 186 ms 1580 KB Output is correct
76 Correct 288 ms 1600 KB Output is correct
77 Correct 402 ms 1592 KB Output is correct
78 Correct 398 ms 1608 KB Output is correct
79 Correct 408 ms 1596 KB Output is correct
80 Correct 8 ms 1500 KB Output is correct
81 Correct 8 ms 1620 KB Output is correct
82 Correct 10 ms 1568 KB Output is correct
83 Correct 9 ms 1576 KB Output is correct
84 Correct 9 ms 1592 KB Output is correct
85 Correct 9 ms 1600 KB Output is correct
86 Correct 10 ms 1592 KB Output is correct
87 Correct 10 ms 1716 KB Output is correct
88 Correct 12 ms 1604 KB Output is correct
89 Correct 11 ms 1620 KB Output is correct
90 Correct 17 ms 1596 KB Output is correct
91 Correct 16 ms 1600 KB Output is correct
92 Correct 31 ms 1592 KB Output is correct
93 Correct 33 ms 1492 KB Output is correct
94 Correct 33 ms 1568 KB Output is correct
95 Correct 34 ms 1592 KB Output is correct
96 Correct 101 ms 1492 KB Output is correct
97 Correct 538 ms 1568 KB Output is correct
98 Correct 813 ms 1552 KB Output is correct
99 Correct 889 ms 1564 KB Output is correct
100 Correct 404 ms 1212 KB Output is correct