CodeForces 216D Spider's Web

D. Spider's Web

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Paw the Spider is making a web. Web-making is a real art, Paw has been learning to do it his whole life. Let's consider the structure of the web.

There are n main threads going from the center of the web. All main threads are located in one plane and divide it into n equal infinite sectors. The sectors are indexed from 1 to n in the clockwise direction. Sectors i and i + 1 are adjacent for every i, 1 ≤ i < n. In addition, sectors 1 and n are also adjacent.

Some sectors have bridge threads. Each bridge connects the two main threads that make up this sector. The points at which the bridge is attached to the main threads will be called attachment points. Both attachment points of a bridge are at the same distance from the center of the web. At each attachment point exactly one bridge is attached. The bridges are adjacent if they are in the same sector, and there are no other bridges between them.

A cell of the web is a trapezoid, which is located in one of the sectors and is bounded by two main threads and two adjacent bridges. You can see that the sides of the cell may have the attachment points of bridges from adjacent sectors. If the number of attachment points on one side of the cell is not equal to the number of attachment points on the other side, it creates an imbalance of pulling forces on this cell and this may eventually destroy the entire web. We'll call such a cell unstable. The perfect web does not contain unstable cells.

Unstable cells are marked red in the figure. Stable cells are marked green.

Paw the Spider isn't a skillful webmaker yet, he is only learning to make perfect webs. Help Paw to determine the number of unstable cells in the web he has just spun.

Input

The first line contains integer n (3 ≤ n ≤ 1000) — the number of main threads.

The i-th of following n lines describe the bridges located in the i-th sector: first it contains integer k_i (1 ≤ k_i ≤ 10⁵) equal to the number of bridges in the given sector. Then follow k_i different integers p_ij (1 ≤ p_ij ≤ 10⁵; 1 ≤ j ≤ k_i). Number p_ij equals the distance from the attachment points of the j-th bridge of the i-th sector to the center of the web.

It is guaranteed that any two bridges between adjacent sectors are attached at a different distance from the center of the web. It is guaranteed that the total number of the bridges doesn't exceed 10⁵.

Output

Print a single integer — the number of unstable cells in Paw the Spider's web.

Sample test(s)

Input

7
3 1 6 7
4 3 5 2 9
2 8 1
4 3 7 6 4
3 2 5 9
3 6 3 8
3 4 2 9

Output

6

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>

#define INT_INF 0x3fffffff
#define LL_INF 0x3fffffffffffffff
#define EPS 1e-12
#define MOD 1000000007
#define PI 3.141592653579798
#define N 1006

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef double DB;

vector<int> a[N];
int k[N];

int main()
{
    int n,p;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&k[i]);
        for(int j=1;j<=k[i];j++)
        {
            scanf("%d",&p);
            a[i].push_back(p);
        }
        sort(a[i].begin(),a[i].end());
    }
    int ans=0;
    int p1,p2,c1,c2;
    for(int i=1;i<=n;i++)
    {
        if(i==1)
        {
            c1=n;
            c2=2;
        }
        else if(i==n)
        {
            c1=n-1;
            c2=1;
        }
        else
        {
            c1=i-1;
            c2=i+1;
        }
        p1=p2=0;
        for(int j=0;j<k[i]-1;j++)
        {
            while(p1<k[c1] && a[c1][p1]<a[i][j]) p1++;
            while(p2<k[c2] && a[c2][p2]<a[i][j]) p2++;
            int cnt1=p1 , cnt2=p2;
            while(p1<k[c1] && a[c1][p1]<a[i][j+1]) p1++;
            while(p2<k[c2] && a[c2][p2]<a[i][j+1]) p2++;
            if(p1-cnt1!=p2-cnt2) ans++;
        }
    }
    printf("%d\n",ans);
    return 0;
}