-
Notifications
You must be signed in to change notification settings - Fork 0
/
Stickogon.cpp
42 lines (38 loc) · 1.69 KB
/
Stickogon.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// Link : https://codeforces.com/contest/1957/problem/A
// ====================================================================== //
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(x) (x).begin(), (x).end() // Sort The String From The Beginning.
#define rall(x) (x).rbegin(), (x).rend() // Sort The String From The End.
#define from_begin(array, num) sort(array, (array+num)) // Sort the array in ascending order.
#define from_end(array, num) sort((array), (array+num), greater<ll>()) // Sort the array in descending order.
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
#define Hero ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
Hero
ll test; cin >> test;
while (test--){
ll num; cin >> num;
ll arr[num], sum = 0, count = 1;
deque <ll> res; // Declares a deque to store counts of each unique number.
for (int i = 0; i < num; ++i) {cin >> arr[i];}
from_begin(arr, num); // Sorts the array in ascending order.
// Counts the frequency of each unique number and stores it in 'res'.
for (int i = 0; i < num-1; ++i){
if (arr[i] == arr[i+1]){count++;}
else {
res.push_back(count);
count = 1;}
}
res.push_back(count); // Pushes the last count.
// Calculates the sum of the floor division of each count by 3.
for (int i = 0; i < res.size(); ++i) {
sum += res[i]/3;
}
cout << sum << endl;
}
return 0;
}