forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfirefly.cpp
56 lines (47 loc) · 1 KB
/
firefly.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;
int inf = 1 << 30;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> suml(m,0);
vector<int> sumr(m,0);
// Read in input
for(int i = 0; i < n; i++) {
int t;
cin >> t;
if(i % 2 == 0) {
sumr[t-1]++;
}
else {
suml[m-t]++;
}
}
// Calculate prefix sums
int sum = 0;
for(int i = m-1; i >= 0; i--) {
sum += sumr[i];
sumr[i] = sum;
}
sum = 0;
for(int i = 0; i < m; i++) {
sum += suml[i];
suml[i] = sum;
}
// Find minimum value
int best = inf;
int count = 0;
for(int i = 0; i < m; i++) {
if(suml[i] + sumr[i] < best) {
best = suml[i] + sumr[i];
count = 0;
}
if(suml[i] + sumr[i] == best) {
count++;
}
}
// Print answer
cout << best << " " << count << endl;
}