can anyone give idea , how to solve question 4 in order of time complexity N , atcoder beginner contest 159. Link: https://atcoder.jp/contests/abc159/tasks/abc159_d
can anyone give idea , how to solve question 4 in order of time complexity N , atcoder beginner contest 159. Link: https://atcoder.jp/contests/abc159/tasks/abc159_d
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
Название |
---|
First take a map, iterate through array once and calculate number of balls for each number i.e.
m[a[i]]++;
Now iterate through map and calculate sum of number of ways of choosing 2 balls for each number
for(auto i:m) total_count+=((i.second)(i.second-1))/2
Now all you need to do is to go through the array one more time and print
total_count-m[a[i]]*(m[a[i]]-1)/2+(m[a[i]]-1)*(m[a[i]]-2)/2
for each element.Idea is to first subtract number of ways of choosing two balls from m[a[i]] balls and then add number of ways of choosing two balls from m[a[i]]-1 balls.
code link