CSES - KILO 2016 3/5

Submission details
Task:	Ice cream
Sender:	Pietari Kaskela
Submission time:	2016-09-20 17:54:45 +0300
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.07 s	details
#2	ACCEPTED	0.07 s	details
#3	ACCEPTED	0.09 s	details
#4	ACCEPTED	0.07 s	details
#5	ACCEPTED	0.06 s	details
#6	ACCEPTED	0.07 s	details
#7	ACCEPTED	0.06 s	details
#8	ACCEPTED	0.09 s	details
#9	ACCEPTED	0.07 s	details
#10	ACCEPTED	0.08 s	details
#11	ACCEPTED	0.09 s	details
#12	ACCEPTED	0.10 s	details
#13	ACCEPTED	0.10 s	details
#14	ACCEPTED	0.10 s	details
#15	ACCEPTED	0.08 s	details
#16	ACCEPTED	0.08 s	details
#17	ACCEPTED	0.09 s	details
#18	ACCEPTED	0.10 s	details
#19	ACCEPTED	0.10 s	details
#20	ACCEPTED	0.09 s	details

Code

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define ld long double
#define defmod 1000000007

#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;

vector<int> v[101010];
bool d1[101010];
int ans[101010];
vector<int> cmp[101010];
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	int n, m; cin >> n >> m;
	int a[101010];
	for(int i = 1; i <= n; ++i)
		cin >> a[i];
	for(int i = 0; i < m; ++i){
		int a, b; cin >> a >> b;
		v[a].push_back(b);
		v[b].push_back(a);
	}

	for(int i = 1; i <= n; ++i){
		if(d1[i])
			continue;
		unordered_set<int> lol;
		queue<int> q;
		q.push(i);
		while(!q.empty()){
			int cur = q.front();
			q.pop();
			if(d1[cur])
				continue;
			d1[cur] = 1;
			cmp[i].push_back(cur);
			lol.insert(a[cur]);
			for(auto f: v[cur])
				q.push(f);
		}
		for(auto f: cmp[i])
			ans[f] = lol.size();


	}
	for(int i = 1; i <= n; ++i)
		cout << ans[i] << " ";
	cout << endl;
	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`47623 1000 6085 3581 2784 1594 9991 7789 ...` 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 2

Verdict: ACCEPTED

input
`29933 10000 37075 97477 24892 91827 86196 ...` view save

correct output
`2 6 1 1 5 1 1 7 9 2 2 2 1 1 3 ...` view save

user output
`2 6 1 1 5 1 1 7 9 2 2 2 1 1 3 ...` view save

Test 3

Verdict: ACCEPTED

input
`82771 50000 84 19 10 43 44 51 77 9 4 1 21 ...` view save

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

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

Test 4

Verdict: ACCEPTED

input
`11645 100000 3041 8953 9167 1268 2312 5911 ...` view save

correct output
`6836 6836 6836 6836 6836 6836 ...` view save

user output
`6836 6836 6836 6836 6836 6836 ...` view save

Test 5

Verdict: ACCEPTED

input
`1041 100 43553 8035 14355 19335 24786 7...` view save

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

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

Test 6

Verdict: ACCEPTED

input
`55898 1000 73 44 15 26 63 51 15 71 73 48 ...` view save

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

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

Test 7

Verdict: ACCEPTED

input
`12027 10000 2456 845 5196 3813 3093 2331 2...` view save

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

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

Test 8

Verdict: ACCEPTED

input
`55977 50000 79310 84043 72794 74090 312 15...` view save

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

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

Test 9

Verdict: ACCEPTED

input
`16237 100000 57 43 3 66 59 10 24 41 56 23 5...` 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 10

Verdict: ACCEPTED

input
`93552 100 31 7952 1106 2779 1980 8776 56...` 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 11

Verdict: ACCEPTED

input
`100000 1000 99793 93845 56091 42020 27225 ...` 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 12

Verdict: ACCEPTED

input
`100000 10000 45 12 5 45 21 73 12 34 97 14 6...` 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 13

Verdict: ACCEPTED

input
`100000 50000 3967 8608 4873 6065 3304 1388 ...` view save

correct output
`27 10 2 1 205 2 1 5 752 9 2 26...` view save

user output
`27 10 2 1 205 2 1 5 752 9 2 26...` view save

Test 14

Verdict: ACCEPTED

input
`70000 100000 9570 57890 88434 83611 76325 3...` view save

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

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

Test 15

Verdict: ACCEPTED

input
`100000 100 84 34 32 36 64 83 29 4 36 57 9...` 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 16

Verdict: ACCEPTED

input
`100000 1000 7080 7863 895 4001 3806 8637 7...` view save

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

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

Test 17

Verdict: ACCEPTED

input
`100000 10000 13821 30085 25414 18462 40885 ...` view save

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

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

Test 18

Verdict: ACCEPTED

input
`100000 50000 41 89 12 33 73 79 38 48 90 68 ...` view save

correct output
`4 1 21 1 2 2 1 1 3 2 3 7 6 20 ...` view save

user output
`4 1 21 1 2 2 1 1 3 2 3 7 6 20 ...` view save

Test 19

Verdict: ACCEPTED

input
`100000 100000 4325 2304 2625 9099 4244 1618 ...` view save

correct output
`9994 5 9994 9994 9994 1 9994 9...` view save

user output
`9994 5 9994 9994 9994 1 9994 9...` view save

Test 20

Verdict: ACCEPTED

input
`100000 100 68725 58766 50437 78768 4415 2...` 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

KILO 2016 3/5

Ice cream

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

Tasks

Submissions (Pietari Kaskela)