CSES - Siperia opettaa 5.0

CSES - Siperia opettaa 5.0 - Results

Submission details
Task:	Distribution Center
Sender:	ankka22
Submission time:	2017-03-09 16:06:34 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time
#1	ACCEPTED	0.06 s	details
#2	ACCEPTED	0.07 s	details
#3	ACCEPTED	0.06 s	details
#4	ACCEPTED	0.08 s	details
#5	ACCEPTED	0.09 s	details
#6	ACCEPTED	0.06 s	details
#7	ACCEPTED	0.07 s	details
#8	ACCEPTED	0.08 s	details
#9	ACCEPTED	0.07 s	details
#10	ACCEPTED	0.07 s	details
#11	ACCEPTED	0.07 s	details
#12	ACCEPTED	0.04 s	details
#13	ACCEPTED	0.11 s	details
#14	ACCEPTED	0.09 s	details
#15	ACCEPTED	0.08 s	details
#16	TIME LIMIT EXCEEDED	--	details
#17	TIME LIMIT EXCEEDED	--	details
#18	TIME LIMIT EXCEEDED	--	details
#19	TIME LIMIT EXCEEDED	--	details
#20	TIME LIMIT EXCEEDED	--	details
#21	TIME LIMIT EXCEEDED	--	details
#22	TIME LIMIT EXCEEDED	--	details
#23	TIME LIMIT EXCEEDED	--	details
#24	TIME LIMIT EXCEEDED	--	details
#25	TIME LIMIT EXCEEDED	--	details
#26	ACCEPTED	0.84 s	details
#27	ACCEPTED	0.85 s	details
#28	ACCEPTED	0.84 s	details
#29	ACCEPTED	0.83 s	details
#30	ACCEPTED	1.08 s	details
#31	TIME LIMIT EXCEEDED	--	details
#32	TIME LIMIT EXCEEDED	--	details
#33	TIME LIMIT EXCEEDED	--	details
#34	TIME LIMIT EXCEEDED	--	details
#35	TIME LIMIT EXCEEDED	--	details
#36	TIME LIMIT EXCEEDED	--	details
#37	ACCEPTED	0.04 s	details
#38	ACCEPTED	0.04 s	details

Code

#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_set>
#include <bitset>
using namespace std;
#define F first
#define S second
int n, m, x, y, count, a[101010];
unordered_set<int> se[101010];
pair<int, int> kohtali[202020];
int counter = 0;
vector<int> va[201010], oi[201010], kaet;
int main() {
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> y >> x;
		kohtali[y].F = x;
		kohtali[y].S = x+1;
		kaet.push_back(y);
		oi[x].push_back(y);
		va[x+1].push_back(y);
	}
	
	for (int i = 1; i <= n; i++) {
		sort(oi[i].begin(), oi[i].end());
		sort(va[i].begin(), va[i].end());
		sort(kaet.begin(), kaet.end());
	}
	for (int i = 1; i <= n; i++) {
		se[i].insert(i);
	}
	for (auto u: kaet) {
		if (se[kohtali[u].F].size() < se[kohtali[u].S].size()) {
			for (auto U: se[kohtali[u].F]) {
				se[kohtali[u].S].insert(U);
			}
			se[kohtali[u].F] = se[kohtali[u].S];
		} else {
			for (auto U: se[kohtali[u].S]) {
				se[kohtali[u].F].insert(U);
			}
			se[kohtali[u].S] = se[kohtali[u].F];
		}
	}
	for (int i = 1; i<= n; i++) {
		cout << se[i].size() << " ";
	}
	cout << '\n';
}
/*
5 8
1000 1
2000 3
3000 1
4000 2
1500 1
1600 1
500 4
3500 4
*/

Test details

Test 1

Verdict: ACCEPTED

input
`4 3 1000 1 2000 2 3000 3` view save

correct output
`2 3 4 4` view save

user output
`2 3 4 4` view save

Test 2

Verdict: ACCEPTED

input
`4 3 1 1 3 2 2 3` view save

correct output
`2 4 4 2` view save

user output
`2 4 4 2` view save

Test 3

Verdict: ACCEPTED

input
`10 9 100 1 200 2 300 3 400 4 ...` view save

correct output
`2 3 4 5 6 7 8 9 10 10` view save

user output
`2 3 4 5 6 7 8 9 10 10` view save

Test 4

Verdict: ACCEPTED

input
`10 9 100 9 200 8 300 7 400 6 ...` view save

correct output
`10 10 9 8 7 6 5 4 3 2` view save

user output
`10 10 9 8 7 6 5 4 3 2` view save

Test 5

Verdict: ACCEPTED

input
`10 9 100 1 200 9 300 2 400 8 ...` view save

correct output
`2 3 4 5 10 10 5 4 3 2` view save

user output
`2 3 4 5 10 10 5 4 3 2` view save

Test 6

Verdict: ACCEPTED

input
`10 9 100 5 200 4 300 6 400 3 ...` view save

correct output
`6 6 5 4 3 3 4 5 6 6` view save

user output
`6 6 5 4 3 3 4 5 6 6` view save

Test 7

Verdict: ACCEPTED

input
`10 9 100 5 200 5 300 5 400 5 ...` view save

correct output
`1 1 1 1 2 2 1 1 1 1` view save

user output
`1 1 1 1 2 2 1 1 1 1` view save

Test 8

Verdict: ACCEPTED

input
`10 9 100 3 200 7 300 3 400 7 ...` view save

correct output
`1 1 2 2 1 1 2 2 1 1` view save

user output
`1 1 2 2 1 1 2 2 1 1` view save

Test 9

Verdict: ACCEPTED

input
`10 1 1 1` view save

correct output
`2 2 1 1 1 1 1 1 1 1` view save

user output
`2 2 1 1 1 1 1 1 1 1` view save

Test 10

Verdict: ACCEPTED

input
`10 1 99999 1` view save

correct output
`2 2 1 1 1 1 1 1 1 1` view save

user output
`2 2 1 1 1 1 1 1 1 1` view save

Test 11

Verdict: ACCEPTED

input
`10 1 99999 9` view save

correct output
`1 1 1 1 1 1 1 1 2 2` view save

user output
`1 1 1 1 1 1 1 1 2 2` view save

Test 12

Verdict: ACCEPTED

input
`10 1 99999 1` view save

correct output
`2 2 1 1 1 1 1 1 1 1` view save

user output
`2 2 1 1 1 1 1 1 1 1` view save

Test 13

Verdict: ACCEPTED

input
`100000 1 1 1` view save

correct output
`2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 14

Verdict: ACCEPTED

input
`100000 1 1 99999` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 15

Verdict: ACCEPTED

input
`3 3 1 1 2 2 3 1` view save

correct output
`3 3 3` view save

user output
`3 3 3` view save

Test 16

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 51613 84082 3120 88303 90089 57457 82323 36322 ...` view save

correct output
`2 3 3 1 2 2 1 2 2 1 2 3 3 2 2 ...` view save

user output
(empty)

Test 17

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 55166 92759 72522 49885 91041 58065 66993 66182 ...` view save

correct output
`1 1 2 4 4 4 4 5 5 5 2 1 3 3 3 ...` view save

user output
(empty)

Test 18

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 90524 19551 22558 32618 68813 64252 16920 55138 ...` view save

correct output
`2 3 3 3 3 2 2 2 3 3 3 5 5 5 1 ...` view save

user output
(empty)

Test 19

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 543 67313 25302 10820 96818 55943 93056 11560 ...` view save

correct output
`1 1 2 2 2 2 3 3 3 1 3 3 4 4 2 ...` view save

user output
(empty)

Test 20

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 7098 91097 88439 4005 35386 17063 1917 86090 ...` view save

correct output
`1 3 3 5 5 3 6 6 6 3 4 4 1 3 3 ...` view save

user output
(empty)

Test 21

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 61671 26653 41901 6290 45318 73847 46486 71566 ...` view save

correct output
`2 2 2 2 2 4 4 2 2 4 4 4 4 5 5 ...` view save

user output
(empty)

Test 22

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 46666 39205 52562 49064 91772 40120 98068 12889 ...` view save

correct output
`2 2 4 4 3 3 3 2 3 3 2 2 6 6 5 ...` view save

user output
(empty)

Test 23

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 53478 77769 62382 16090 33315 61136 81654 27389 ...` view save

correct output
`1 1 1 1 4 4 3 4 4 3 3 3 3 4 4 ...` view save

user output
(empty)

Test 24

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 47015 74422 77958 41967 26483 37045 52560 21334 ...` view save

correct output
`2 2 3 3 3 1 1 1 2 2 2 4 4 4 4 ...` view save

user output
(empty)

Test 25

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 30444 72197 95332 46416 50857 42241 79810 99621 ...` view save

correct output
`1 1 2 2 2 4 4 4 4 6 6 2 3 3 3 ...` view save

user output
(empty)

Test 26

Verdict: ACCEPTED

input
`100 99999 15682 14 57251 20 83099 50 57485 33 ...` view save

correct output
`100 100 100 100 100 100 100 10...` view save

user output
`100 100 100 100 100 100 100 10...` view save

Test 27

Verdict: ACCEPTED

input
`100 99999 77171 16 89815 40 18710 40 25372 60 ...` view save

correct output
`100 100 100 100 100 100 100 10...` view save

user output
`100 100 100 100 100 100 100 10...` view save

Test 28

Verdict: ACCEPTED

input
`100 99999 69498 75 45431 25 35804 53 35830 44 ...` view save

correct output
`100 100 100 100 100 100 100 10...` view save

user output
`100 100 100 100 100 100 100 10...` view save

Test 29

Verdict: ACCEPTED

input
`100 99999 14287 85 73750 52 14953 80 27802 96 ...` view save

correct output
`100 100 100 100 100 100 100 10...` view save

user output
`100 100 100 100 100 100 100 10...` view save

Test 30

Verdict: ACCEPTED

input
`100 99999 60021 48 2240 89 45435 4 18160 44 ...` view save

correct output
`100 100 100 100 100 100 100 10...` view save

user output
`100 100 100 100 100 100 100 10...` view save

Test 31

Verdict: TIME LIMIT EXCEEDED

input
`200000 99999 6459 28754 89524 100200 40972 165007 35542 79232 ...` view save

correct output
`2 3 3 2 2 1 1 2 2 1 1 2 2 2 2 ...` view save

user output
(empty)

Test 32

Verdict: TIME LIMIT EXCEEDED

input
`200000 99999 91854 42500 34291 59129 21533 24543 12870 128293 ...` view save

correct output
`1 2 2 2 2 2 2 1 1 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 33

Verdict: TIME LIMIT EXCEEDED

input
`200000 99999 88029 49150 1821 18264 32450 150397 87753 44993 ...` view save

correct output
`3 3 2 1 1 1 1 1 2 2 1 1 2 3 3 ...` view save

user output
(empty)

Test 34

Verdict: TIME LIMIT EXCEEDED

input
`200000 99999 18637 75106 91405 193095 10716 115503 78702 119750 ...` view save

correct output
`1 2 2 1 1 1 1 2 2 1 3 3 2 1 1 ...` view save

user output
(empty)

Test 35

Verdict: TIME LIMIT EXCEEDED

input
`200000 99999 18742 152060 38942 104683 46001 85720 9675 93087 ...` view save

correct output
`1 1 1 2 3 3 1 1 1 1 1 2 4 4 2 ...` view save

user output
(empty)

Test 36

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 1 99999 2 99998 3 99997 4 99996 ...` view save

correct output
`100000 100000 99999 99998 9999...` view save

user output
(empty)

Test 37

Verdict: ACCEPTED

input
`4 3 1000 1 2000 2 3000 3` view save

correct output
`2 3 4 4` view save

user output
`2 3 4 4` view save

Test 38

Verdict: ACCEPTED

input
`4 3 1 1 3 2 2 3` view save

correct output
`2 4 4 2` view save

user output
`2 4 4 2` view save

Siperia opettaa 5.0

Distribution Center

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Tasks

Submissions (ankka22)