手串

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
 
int main() {
    int n,m,c;
    cin >> n >> m >> c;
    // 3 1 2 3
    // 0
    // 2 2 3
    // 1 2
    // 1 3
    // 每种颜色出现在哪些珠子上
    unordered_map<int, vector<int>> clr_strings;
    for(int i=1; i<=n; i++) {
        int count;
        cin >> count; // 第i颗珠子多少种颜色
         
        int clr;
        for(int j=1; j<=count; j++) { // 颜色
            cin >> clr;
            clr_strings[clr].push_back(i); // 这种颜色放到这个珠子上
        }
    }
     
    // 遍历每种颜色，重复的珠子是否存在
    int res = 0;
    for(auto it = clr_strings.begin(); it != clr_strings.end(); it++) {
        vector<int> strs = it->second;
        int lens = strs.size();
        if(strs[lens-1] + strs[0] == n) { // 首尾相邻不符合要求
            res++; continue;
        }
        for(int i=1; i<lens; i++) {
            if(strs[i] - strs[i-1] < m) { // 前后相邻不符合要求
                res++; break;
            }
        }
    }
    cout << res << endl;
    return 0;
}

	importjava.util.HashMap;



	importjava.util.LinkedList;



	importjava.util.Map;



	importjava.util.Scanner;



	 



	publicclassMain {



	 



	    publicstaticvoidmain(String[] args) {



	        Scanner scanner = newScanner(System.in);



	        intn = scanner.nextInt();// n个手串



	        intm = scanner.nextInt();// 间隔为m



	        intc = scanner.nextInt();// 有c种颜色



	        Map<Integer, LinkedList<Integer>> map = newHashMap<Integer, LinkedList<Integer>>();



	        for(inti = 1; i <= c; i++) {



	            map.put(i, newLinkedList<Integer>());



	        }



	        inttotal = 1;



	        while(total <= n) {



	            intnum = scanner.nextInt();// 表示有多少顔色



	            for(inti = 0; i < num; i++) {



	                intcolor = scanner.nextInt();



	                LinkedList<Integer> linkedList = map.get(color);// 得到某種顔色的位置



	                linkedList.add(total);// 再加上此位置



	                map.put(color, linkedList);



	            }



	            total++;



	        }



	        interror = 0;



	        for(inti = 1; i <= c; i++) {



	            LinkedList<Integer> linkedList = map.get(i);// 得到某種顔色的位置



	            int[] array = newint[linkedList.size()];



	            intk = 0;



	            for(intj : linkedList) {



	                array[k++] = j;



	            }



	            for(intj = 0; j < array.length; j++) {



	                if(j + 1< array.length && array[j + 1] - array[j] < m) {



	                    error++;



	                    break;



	                } elseif(j + 1== array.length && array[0] + n - array[j] < m) {



	                    error++;



	                    break;



	                }



	            }



	        }



	        System.out.println(error);



	    }



	}

from collections import Counter

n, m, c = map(int, input().split())
color = []
for i in range(n):
    temp = list(map(int, input().split()))[1:]
    color.append(temp)
color.append(color[0])
i = 0
res = set()
while i < n:
    temp = color[i: i + m]
    t = []
    for each in temp:
        t += each
    d = dict(Counter(t))
    for k, v in d.items():
        if v >= 2:
            res.add(k)

    i += 1


print(len(res))

//为什么***写了这么多行
#include<iostream>
//#include<bits/stdc++.h>
#include<unordered_set>
#include<queue>
#include<unordered_map>
using namespace std;
                    
int main()
{
    int n,m,c;
    unordered_set<int> s;
    int len;
    queue<int> q;
    unordered_map<int,int> u_map;
    unordered_map<int,int>::iterator it;
    
    
    int temp;
    int min_n_m;
    while(cin>>n>>m>>c) {
            min_n_m=min(n,m);
            for(int i=0;i<min_n_m;i++) {    //初始化
                cin>>len;
                q.push(len);
                while(len>0) {
                    cin>>temp;
                    it=u_map.find(temp);
                    if(it!=u_map.end()) { //找到
                        it->second++;
                    }else {
                        u_map.insert(make_pair(temp,1));
                    }
                    q.push(temp);
                    len--;
                }
            }
            for(it=u_map.begin();it!=u_map.end();it++) { //查询不符合的颜色
                if((it->second>1)&&(it->first!=0))
                    s.insert(it->first);
            }
            queue<int> q_back(q);
            //unordered_map<int,int> u_map_back(u_map);

            int i=m;
            while(i<n) {
                len = q.front();
                q.pop();
                while(len>0) {          //弹出滑动窗口最左边对应这颗珠子
                    it=u_map.find(q.front());
                    it->second--;
                    q.pop();
                    len--;
                }

                cin>>len;
                q.push(len);
                while(len>0) {     //将当前颗加入滑动窗口最右边
                    cin>>temp;
                    it=u_map.find(temp);
                    if(it!=u_map.end()) { //找到
                        it->second++;
                    }else {
                        u_map.insert(make_pair(temp,1));
                    }
                    q.push(temp);
                    len--;
                }

                for(it=u_map.begin();it!=u_map.end();it++) {//查询不符合的颜色
                    if((it->second>1)&&(it->first!=0))
                        s.insert(it->first);
                    }

                i++;
            }

            i=n;
            while(i<n+m) {
                len = q.front();
                q.pop();
                while(len>0) {          //弹出滑动窗口最左边对应这颗珠子
                    it=u_map.find(q.front());
                    it->second--;
                    q.pop();
                    len--;
                }

                len=q_back.front();
                q_back.pop();
                q.push(len);
                while(len>0) {     //将backup当前颗加入滑动窗口最右边
                    temp=q_back.front();
                    q_back.pop();
                    it=u_map.find(temp);
                    if(it!=u_map.end()) { //找到
                        it->second++;
                    }else {
                        u_map.insert(make_pair(temp,1));
                    }
                    q.push(temp);
                    len--;
                }

                for(it=u_map.begin();it!=u_map.end();it++) {//查询不符合的颜色
                    if((it->second>1)&&(it->first!=0))
                        s.insert(it->first);
                    }

                i++;
            }
        cout<<s.size()<<endl;
    }

    return 0;
}

	#include <iostream>



	#include <vector>



	usingnamespacestd;



	  



	intmain(void)



	{



	    intnumber = 0, m_limit = 0, color_num = 0;



	    cin >> number >> m_limit >> color_num;



	      



	    vector<vector<int> > data;



	    inti = 0, j = 0;



	    for(i = 0; i<color_num; i++)



	    {



	        vector<int> temp;



	        data.push_back(temp);



	    }



	      



	    intcolor = 0;



	    inttemp_n;



	    for(i=0; i<number; i++)



	    {



	          



	        cin >> temp_n;



	          



	            for(j=0; j<temp_n; j++)



	            {



	                cin >> color;



	                data[color-1].push_back(i);



	            }



	    }



	      



	    intcount = 0;



	    for(i = 0; i<color_num; i++)



	    {



	        inttemp = data[i].size();



	        for(j=1; j<temp; j++)



	        {



	            if(data[i][j] != number-1)



	            {



	                if(data[i][j] - data[i][j-1] < m_limit-1)



	                {



	                    count++;



	                    break;



	                }



	            }



	            elseif(data[i][0] == 0)



	            {



	                count++;



	                break;



	            }



	        }



	    }



	      



	    cout << count;



	      



	    return0;



	}

/*设置一个大小为wnd(m)的滑动窗口，vis向量记录窗口内珠子颜色的种类及其次数，
窗口每次向右吸纳新一个珠子前将最左边珠子的颜色信息删除，这样可以避免重复计算，
由于是环形，设置left=i%n可以做到窗口包含第一个和最后一个珠子，当vis[i]>=2
时，说明该颜色已经记录到结果中了，不用管它，继续检查下一种颜色*/
 
#include<iostream>
#include<stdlib.h>
#include<vector>
using namespace std;
int main(){
    int n,wnd,color,res=0;
    vector<vector<int>> vec;
    cin>>n;
    cin>>wnd;
    cin>>color;
    vector<int> vis(color+1,0);
        int tmp1;
    while(cin>>tmp1){
        vector<int> num;
            for(int i=0;i<tmp1;i++){
                int tmp2;
                cin>>tmp2;
                num.push_back(tmp2);
            }
        vec.push_back(num);
        num.clear();
    }
    for(int i=0;i<n+wnd;i++){
        if(i>=wnd){
        for(int j=0;j<vec[i-wnd].size();j++){
            if(vis[vec[i-wnd][j]]==1)
                vis[vec[i-wnd][j]]--;
        }
        }
            int left=i%n;
        for(int j=0;j<vec[left].size();j++){
            if(vis[vec[left][j]]<2)//vis[a]只能是等于0，1，2或者3
                vis[vec[left][j]]++;
            if(vis[vec[left][j]]==2){
                res++;
                vis[vec[left][j]]++;
            }
        }
    }
        cout<<res<<endl;
    return 0;
}

根据题意，暴力也能过

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m,c;
    cin>>n>>m>>c;
    map<pair<int,int>,int> mp;
    for(int i=0;i<n;i++){
        int size;
        cin>>size;
        for(int j=0;j<size;j++){
            int color;
            cin>>color;
            mp[make_pair(i,color)]++;
        }
    }
    vector<int> ans(c);
    for(int i=0;i<n;i++){
        for(int j=1;j<=c;j++){
            //j就是颜色
            if(mp[make_pair(i,j)]==0) continue;
            int count=1;
            while(count<m){
                int pos=i+count;
                if(pos>n-1) pos-=n;
                if(mp[make_pair(pos,j)]>0) ans[j-1]++;
                count++;
            }
        }
    }
    int res=0;
    for(int i=0;i<c;i++){
        if(ans[i]>0) res++;
    }
    cout<<res<<endl;
    return 0;
}

# n,m,c = map(int,input().strip().split()) # L = [[] for i in range(0, c+1)] # def color_m(list1,m,r): #     list1.sort() #     l = len(list1) #     for i_1 in range(l): #         for j_1 in range(i_1+1,l): #             if (list1[j_1]-list1[i_1]+1)<=m or (list1[i_1]+n-list1[j_1]+1) <= m: #                 # print("i:",r,list1[j_1],list1[i_1]) #                 return 1 #     return 0 # for i in range(n): #     index = [int(o) for o in input().split()] #     num = len(index) #     if(index[0]==0):L[0].append(i) #     else: #         for j in range(1,index[0]+1): #             L[index[j]].append(i) #     ans = 0 # # print(L) # for i_2 in range(1,c+1): #     ans = ans + color_m(L[i_2],m,i_2) #     # print(i_2) # # print(ans) 

n,m,c = map(int,input().strip().split())
L = [[] for i in range(0, c+1)]
def color_m(list1,m,r):
    list1.sort()
    l = len(list1)
    for i_1 in range(l):
        for j_1 in range(i_1+1,l):
            if (list1[j_1]-list1[i_1]+1)<=m&nbs***bsp;(list1[i_1]+n-list1[j_1]+1) <= m:
                return 1
    return 0
for i in range(n):
    index = [int(o) for o in input().split()]
    num = len(index)
    if(index[0]==0):L[0].append(i)
    else:
        for j in range(1,index[0]+1):
            L[index[j]].append(i)
    ans = 0
for i_2 in range(1,c+1):
    ans = ans + color_m(L[i_2],m,i_2)
print(ans)