CodeForces 367B. Sereja ans Anagrams

B. Sereja ans Anagrams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja has two sequencesaandband numberp. Sequenceaconsists ofnintegersa1, a2, ..., an. Similarly, sequencebconsists ofmintegersb1, b2, ..., bm. As usual, Sereja studies the sequences he has. Today he wants to find the number of positionsq(q + (m - 1)·p ≤ n;q ≥ 1), such that sequencebcan be obtained from sequenceaq, aq + p, aq + 2p, ..., aq + (m - 1)pby rearranging elements.

Sereja needs to rush to the gym, so he asked to find all the described positions ofq.

Input

The first line contains three integersn,mandp(1 ≤ n, m ≤ 2·105, 1 ≤ p ≤ 2·105). The next line containsnintegersa1,a2,...,an(1 ≤ ai ≤ 109). The next line containsmintegersb1,b2,...,bm(1 ≤ bi ≤ 109).

Output

In the first line print the number of validqs. In the second line, print the valid values in the increasing order.

Sample test(s)

input

5 3 1
1 2 3 2 1
1 2 3

output

2
1 3

input

6 3 2
1 3 2 2 3 1
1 2 3

output

2
1 2

STL操作。。。。当值减小到0的时候一定要记得将这个元素删除。。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <queue>

using namespace std;

const int maxn=220000;

typedef map<int,int> mII;
mII B;
int n,m,p,a[maxn],ans[maxn],cnt=0;
bool vis[maxn];

int main()
{
    scanf("%d%d%d",&n,&m,&p);
    B.clear();
    for(int i=1;i<=n;i++) scanf("%d",a+i);
    for(int i=0;i<m;i++)
    {
        int x;
        scanf("%d",&x);
        B[x]++;
    }
    if((m-1)*p+1>n) {printf("0\n");return 0;}
    for(int i=1;i<=p;i++)///P种不同的开始点
    {
        deque<int> q;mII tp;
        tp.clear();
        memset(vis,false,sizeof(vis));
        for(int j=i;j<=n;j+=p)
        {
            q.push_back(j);
            tp[a[j]]++;
            if(q.size()>m)
            {
                int u=q.front(); q.pop_front();
                tp[a[u]]--;
                if(tp[a[u]]==0)
                    tp.erase(a[u]);
            }
            if(tp==B)
            {
                ans[cnt++]=q.front();
            }
          }
    }
    sort(ans,ans+cnt);
    printf("%d\n",cnt);
    for(int i=0;i<cnt;i++)
    {
        if(i) putchar(32);
        printf("%d",ans[i]);
    }
    putchar(10);
    return 0;
}