C++14 解法, 执行用时: 3ms, 内存消耗: 444KB, 提交时间: 2020-09-19

#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <vector>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <regex>
#include <unordered_set>
#include <unordered_map>

using namespace std;

int wrongColor(vector<vector<int>> color, int n, int m) {
    int count = 0;
    for(int i = 0; i < color.size(); ++i) {
        for(int j = 1; j < color[i].size(); ++j) {
            if(color[i][j] - color[i][j-1] < m) {
                ++count;
                break;
            }
            if(j == color[i].size()-1 && ((color[i][j]+m)%n > color[i][0])) {
                ++count;
                break;
            }
        }
    }
    return count;
}



int main() {
    int n, m, c;
    scanf("%d %d %d", &n, &m, &c);
    vector<vector<int>> color(c);
    for(int i = 0; i < n; ++i) {
        int num_i = 0;
        scanf("%d", &num_i);
        for(int j = 0; j < num_i; ++j) {
            int color_index = 0;
            scanf("%d", &color_index);
            color[color_index-1].push_back(i);
        }
    }

    printf("%d", wrongColor(color, n, m));

    return 0;
}

C++ 解法, 执行用时: 3ms, 内存消耗: 504KB, 提交时间: 2020-08-10

#include <cstring>
#include <iostream>
#include <vector>

using namespace std;

const int N = 10010, M = 52;

int pre[M], start[M];
bool st[M];
int n, m, c;

int main() {
    scanf("%d%d%d", &n, &m, &c);
    memset(pre, -1, sizeof pre);
    int ans = 0;
    
    for (int i = 0; i < n; i ++) {
        int cnt;
        scanf("%d", &cnt);
        for (int j = 0; j < cnt; j ++) {
            int color;
            scanf("%d", &color);
            if (st[color]) continue;
            if (pre[color] != -1 && i - pre[color] < m) {
                ans ++;
                st[color] = true;
            }
            if (pre[color] == -1) start[color] = i;
            pre[color] = i;
        }
    }
    
    // check circular
    for (int i = 1; i <= c; i ++) {
        if (st[i]) continue;
        if (start[i] == pre[i]) continue;
        if (n - pre[i] + start[i] < m) ans ++;
    }
    
    cout << ans << endl;
    return 0;
}

C++ 解法, 执行用时: 3ms, 内存消耗: 504KB, 提交时间: 2020-07-09

#include <cstring>
#include <iostream>
#include <vector>

using namespace std;

const int N = 10010, M = 52;

int pre[M], start[M];
bool st[M];
int n, m, c;

int main() {
    scanf("%d%d%d", &n, &m, &c);
    memset(pre, -1, sizeof pre);
    int ans = 0;
    
    for (int i = 0; i < n; i ++) {
        int cnt;
        scanf("%d", &cnt);
        for (int j = 0; j < cnt; j ++) {
            int color;
            scanf("%d", &color);
            if (st[color]) continue;
            if (pre[color] != -1 && i - pre[color] < m) {
                ans ++;
                st[color] = true;
            }
            if (pre[color] == -1) start[color] = i;
            pre[color] = i;
        }
    }
    
    // check circular
    for (int i = 1; i <= c; i ++) {
        if (st[i]) continue;
        if (start[i] == pre[i]) continue;
        if (n - pre[i] + start[i] < m) ans ++;
    }
    
    cout << ans << endl;
    return 0;
}

C 解法, 执行用时: 3ms, 内存消耗: 2296KB, 提交时间: 2020-10-08

#include<stdio.h>

int main()
{
    int n = 0, m = 0, c = 0;
    scanf("%d %d %d", &n, &m, &c);
    
    int colorPos[51][10000] = {0};
    int colorNum[51] = {0};
    for (int i = 0; i < n; i++) {
        int num_i = 0;
        scanf("%d", &num_i);
        
        for (int j = 0; j < num_i; j++) {
            int color = 0;
            scanf("%d", &color);
            colorPos[color][colorNum[color]] = i;
            colorNum[color] = colorNum[color] + 1;
        }
    }
    //printf("%d", colorNum[3]);
    int ret = 0;
    for (int i = 1; i <= c; i++) {
        if (colorNum[i] == 1) continue;
        if (colorPos[i][0] + n - colorPos[i][colorNum[i] - 1] < m) {
            ret++;
            continue;
        }
        for (int j = 1; j < colorNum[i]; j++) {
            if (colorPos[i][j] - colorPos[i][j - 1] < m) {
                ret++;
                break;
            }
        }
    }
    printf("%d", ret);
    return 0;
}

C++ 解法, 执行用时: 4ms, 内存消耗: 380KB, 提交时间: 2020-11-21

#include <bits/stdc++.h>
using namespace std;
    
int main() {
    int n, m, c;
    cin >> n >> m >> c;
    vector<vector<int>> p(c);
    for (int i = 0; i < n; ++i) {
        int k, t;
        scanf("%d", &k);
        while (k--) {
            scanf("%d", &t);
            p[t-1].emplace_back(i);
        }
    }
    long long res = 0;
    for (auto &v : p) {
        if (v.empty()) continue;
        int pre = v[0];
        for (int i = 1; i < v.size(); ++i) {
            if (v[i] - pre >= m && v[0]+n - v[i] >= m) pre = v[i];
            else {++res; break;}
        }
    }
    cout << res << "\n";
}