Contest/aoj1258.cpp at master · ryojiro/Contest · 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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); i++)
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1<<28;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

int main() {
	int m, c, n;
	while(cin >> m >> c >> n, m|c|n) {
		vector<vi> d(m), ppl(n);
		int cnt = 0;
		REP(i, n) {
			int k; cin >> k;
			ppl[i].resize(k);
			REP(j, k)
				cin >> ppl[i][j];
		}

		int lmt = 0;
		for(int loop=0;; loop = (loop+1)%n) {
			if(!ppl[loop].size()) {
				if(lmt++ > n) break;
				continue;
			}
			lmt = 0;
			int book = *ppl[loop].begin();
			ppl[loop].erase(ppl[loop].begin());

			//take a book
			bool flg = false;
			REP(i, m) {
				REP(j, d[i].size()) {
					if(d[i][j] == book) {
						d[i].erase(d[i].begin() + j);
						cnt += i+1;
						flg = true;
						break;
					}
				}
				if(flg) break;
			}
			if(!flg) cnt += m+1;

			//return a book
			flg = false;
			bool flg2 = false;
			int put = m;
			REP(i, m) {
				if(d[i].size() < c) {
					d[i].pb(book);
					flg = true;
					cnt += i+1;
					put = i;
					if(!i) flg2 = true;
					break;
				}
			}
			if(flg2) continue;
			if(!flg) cnt += m+1;


			//set
			int get = *d[0].begin();
			d[0].erase(d[0].begin());
			cnt += 1;

			flg = false;
			FOR(i, 1, m) {
				if(d[i].size() < c) {
					flg = true;
					cnt += i+1;
					d[i].pb(get);
					break;
				}
			}
			if(!flg) cnt += m+1;

			d[put].erase(d[put].end()-1);
			d[0].pb(book);
			cnt += put + 2;

		}
		cout << cnt << endl;
	}
	return 0;
}