cp-problemset/CC-CHEFWED.cpp at master · ShammiAnand/cp-problemset · GitHub

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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
//This code is written by Shammi Anand
#include<bits/stdc++.h>
using namespace std;

#define ll              long long
#define Max(a,b,c)      max(a,max(b,c))
#define Min(a,b,c)      min(a,min(b,c))
#define pb              push_back
#define mp              make_pair
#define f               first
#define s               second
#define mod             1000000007
#define nl              "\n"
#define w(x)            int x; cin>>x; while(x--)

void shammi() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}
int main() {
	shammi();
	w(t) {
		int n, k; cin >> n >> k;
		int F[n];
		for (int i = 0; i < n; i++) {
			cin >> F[i];
		}
		bool first = true;
		int cost = 0;
		int selected[101] = {0};
		if (k == 1) {
			for (int i = 0; i < n; i++) {
				if (first) {
					first = false;
					selected[F[i]]++;
					cost = k;
				} else {
					if (selected[F[i]] > 0) {
						if (selected[F[i]] + 1 <= k) {//can be selected
							if (selected[F[i]] == 1) cost += 2;
							else cost++;
							selected[F[i]]++;
						} else {
							cost += k;
							for (int i = 0; i <= 100; i++) selected[i] = 0;
							selected[F[i]]++;

						}
					} else { //not present on table
						selected[F[i]]++;
					}
				}
			}
		} else {
			// cost = k;
			int cnt[101] = {0};
			for (int i = 0; i < n; i++) {
				cnt[F[i]]++;
			}
			int sum = 0;
			for (int i = 1; i <= 100; i++) if (cnt[i] > 1) sum += cnt[i];

			cost = k;
			selected[F[0]]++
			for (int i = 1; i < n; i++) {
				if (selected[F[i]] == 0) {
					selected[F[i]]++
				} else {

				}
			}

		}
		cout << cost << nl;
	}
	return 0;
}