[Codeforces Round #310 DIV1A (CF555A)] Case of Matryoshkas

题意

现有俄罗斯套娃娃，大小$1$到$n$共$n$个，只能大的套在小的上面。已有$m$堆娃娃，拿起娃娃花一秒，放回娃娃花一秒，最少需要多少秒

题解

$n$个娃娃，$m$堆，$1$上面连续数字长度为$l$
$ans=2n-m-2l+1$

代码

/// by ztx

#include <cstdio>

int main() {
    int n, m, l = 1, k, a, ans;
    scanf("%d%d", &n, &k);
    ans = n*2-k;
    while (k --> 0) {
        scanf("%d%d", &m, &a), m -- ;
        if (a == 1) while (m --> 0) if (scanf("%d", &a), a == l+1) l ++ ; else break ;
        while (m --> 0) scanf("%*d");
    }
    printf("%d\n", ans-l*2+1);
    getchar(), getchar();
    return 0;
}