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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

using namespace std;

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 19, mod = 998244353;

std::map <int, int> stock;

void hireFrom(std::map <int, int> :: iterator iter)
{
	if (--(iter->second) == 0)
		stock.erase(iter);
}

void hireFor(int root, int leaf)
{
	auto iter = stock.lower_bound(root);
	iter = std::prev(iter);
	hireFrom(iter);
	stock[leaf]++;
}

void processCompleteSegments(int lastDay, const std::vector <int>& startDay)
{
	for (int start : startDay)
		if (start)
			hireFor(start, lastDay);
}

void solve()
{
	int k, n1;
	scanf ("%d%d", &k, &n1);
	std::vector <int> curr, prev(n1, 1);
	stock[0] = 0;

	FOR(d, 2, k+1)
	{
		int n;
		scanf ("%d", &n);
		curr.resize(n);
		std::vector <bool> prevIndPresent(prev.size(), false);
		for (int& i : curr)
		{
			scanf ("%d", &i);
			if (i == 0)
				i = d;
			else
			{
				int indInPrev = i-1;
				i = prev[indInPrev];
				prevIndPresent[indInPrev] = true;
			}
		}

		FOR(i, 0, SZ(prev))
			if (prevIndPresent[i])
				prev[i] = 0;
		
		processCompleteSegments(d-1, prev);
		std::swap(curr, prev);
	}
	processCompleteSegments(k, prev);
	
	int res = -stock[0];
	printf("%d\n", res);
}

int main()
{
	int tc = 1;
//	scanf ("%d", &tc);	

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}