Submission #3810791
Source Code Expand
#include<iostream> #include<cstring> #include<algorithm> using namespace std; typedef long long ll; int main(){ // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); std::ios_base::sync_with_stdio(false), cin.tie(0); const int N = 100005; int n; pair<int, int> f1, s1, f2, s2, fr[N]; for(int i = 0 ; i < N ; i++){ fr[i].second = i; fr[i].first = 0; } cin >> n; int a[n]; for(int i = 0 ; i < n ; i++){ cin >> a[i]; } for(int i = 0 ; i < n ; i += 2){ ++fr[a[i]].first; } sort(fr, fr + N); f1 = fr[N - 1]; s1 = fr[N - 2]; for(int i = 0 ; i < N ; i++){ fr[i].second = i; fr[i].first = 0; } for(int i = 1 ; i < n ; i += 2){ ++fr[a[i]].first; } sort(fr, fr + N); f2 = fr[N - 1]; s2 = fr[N - 2]; if(f1.second != f2.second){ cout << (n >> 1) - f1.first + (n >> 1) - f2.first; }else{ if(s1.first < s2.first){ cout << (n >> 1) - f1.first + (n >> 1) - s2.first; }else{ cout << (n >> 1) - s1.first + (n >> 1) - f2.first; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - /\/\/\/ |
User | Mustafa_Magdy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1065 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1_3132.txt, sample2_iw.txt, sample3_1111.txt |
All | ababa_0.txt, ababa_1.txt, eq_0.txt, eq_1.txt, rnd_17.txt, sample1_3132.txt, sample2_iw.txt, sample3_1111.txt, top2_0.txt, top2_1.txt, top2_2.txt, top2_3.txt, top2modoki_0.txt, top2modoki_1.txt, top2modoki_2.txt, top2modoki_3.txt, vary_1.txt, vary_2.txt, vary_3.txt, zoro_0.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
ababa_0.txt | AC | 17 ms | 1408 KB |
ababa_1.txt | AC | 18 ms | 1408 KB |
eq_0.txt | AC | 28 ms | 1408 KB |
eq_1.txt | AC | 27 ms | 1408 KB |
rnd_17.txt | AC | 28 ms | 1408 KB |
sample1_3132.txt | AC | 13 ms | 1024 KB |
sample2_iw.txt | AC | 5 ms | 1024 KB |
sample3_1111.txt | AC | 6 ms | 1024 KB |
top2_0.txt | AC | 19 ms | 1408 KB |
top2_1.txt | AC | 19 ms | 1408 KB |
top2_2.txt | AC | 19 ms | 1408 KB |
top2_3.txt | AC | 19 ms | 1408 KB |
top2modoki_0.txt | AC | 19 ms | 1408 KB |
top2modoki_1.txt | AC | 19 ms | 1408 KB |
top2modoki_2.txt | AC | 19 ms | 1408 KB |
top2modoki_3.txt | AC | 19 ms | 1408 KB |
vary_1.txt | AC | 22 ms | 1408 KB |
vary_2.txt | AC | 22 ms | 1408 KB |
vary_3.txt | AC | 22 ms | 1408 KB |
zoro_0.txt | AC | 6 ms | 1024 KB |