【模拟】【USACO】contact

 

The cows have developed a new interest in scanning the universe outside their farm with radiotelescopes. Recently, they noticed a very curious microwave pulsing emission sent right from the centre of the galaxy. They wish to know if the emission is transmitted by some extraterrestrial form of intelligent life or if it is nothing but the usual heartbeat of the stars.

Help the cows to find the Truth by providing a tool to analyze bit patterns in the files they record. They are seeking bit patterns of length A through B inclusive (1 <= A <= B <= 12) that repeat themselves most often in each day's data file. They are looking for the patterns that repeat themselves most often. An input limit tells how many of the most frequent patterns to output.

Pattern occurrences may overlap, and only patterns that occur at least once are taken into account.

PROGRAM NAME: contact

INPUT FORMAT

Line 1:	Three space-separated integers: A, B, N; (1 <= N < 50)
Lines 2 and beyond:	A sequence of as many as 200,000 characters, all 0 or 1; the characters are presented 80 per line, except potentially the last line.

SAMPLE INPUT (file contact.in)

2 4 10
01010010010001000111101100001010011001111000010010011110010000000

In this example, pattern 100 occurs 12 times, and pattern 1000 occurs 5 times. The most frequent pattern is 00, with 23 occurrences.

OUTPUT FORMAT

Lines that list the N highest frequencies (in descending order of frequency) along with the patterns that occur in those frequencies. Order those patterns by shortest-to-longest and increasing binary number for those of the same frequency. If fewer than N highest frequencies are available, print only those that are.

Print the frequency alone by itself on a line. Then print the actual patterns space separated, six to a line (unless fewer than six remain).

SAMPLE OUTPUT (file contact.out)

23
00
15
01 10
12
100
11
11 000 001
10
010
8
0100
7
0010 1001
6
111 0000
5
011 110 1000
4
0001 0011 1100

---

描述

奶牛们开始对用射电望远镜扫描牧场外的宇宙感兴趣。最近，他们注意到了一种非常奇怪的脉冲调制微波从星系的中央发射出来。他们希望知道电波是否是被某些地外生命发射出来的，还是仅仅是普通的的星星发出的。

帮助奶牛们用一个能够分析他们在文件中记下的记录的工具来找到真相。他们在寻找长度在A到B之间（含）在每天的数据文件中重复得最多的比特序列 (1 <= A <= B <= 12)。他们在找那些重复得最多的比特序列。一个输入限制告诉你应输出多少频率最多的序列。

符合的序列可能会重叠，并且至少重复一次的序列会被计数。

[编辑]格式

PROGRAM NAME: contact

INPUT FORMAT:

(file contact.in)

第一行： 三个用空格分隔的整数: A, B, N; (1 <= N < 50)

第二行及以后: 一个最多200，000字符的序列，全是0或1; 每行字符数不大于80。

OUTPUT FORMAT:

(file contact.out)

输出N个频率最高的序列（按照频率由高到低的次序）。由短到长排列频率相同的这些序列，如果长短相同，按二进制大小排列。如果出现的序列个数小于N，输出存在的序列。

对于每个存在的频率，先输出单独包含该频率的一行，再输出以空格分隔的这些频率。每行六个（除非少于六个剩下）。

[编辑]SAMPLE INPUT

2 4 10 
01010010010001000111101100001010011001111000010010011110010000000

在样例里，序列100出现了12次，而序列1000出现了5次。次数最多的序列是00，出现了23次。

[编辑]SAMPLE OUTPUT

23
00
15
01 10
12
100
11
11 000 001
10
010
8
0100
7
0010 1001
6
111 0000
5
011 110 1000
4
0001 0011 1100

  
  
直接模拟。

/*
ID:sephiro5
LANG:C++
PROG:contact
*/
#include <stdio.h>
#include <string.h>
#define maxn 200010

int a[maxn];//原始 
int f[15][5000];//个数 
struct ss
{
       int s,t;
} tu[15][5000],ans[maxn];//每个的st
bool v[15][5000];//是否已输出。
int x,y,n,m;
char s[100];

void init()
{
     scanf("%d%d%d",&x,&y,&n);
     while (scanf("%s",s)!=EOF)
     {
           int teml=strlen(s);
           for (int i=0;i<teml;++i)
           {
               ++m;
               a[m]=s[i]-'0';
           }
           for (int i=0;i<teml;++i) s[i]='/0';
     }
}

int change(int s,int t)
{
    int temval=0,tw=1;
    for (int i=t;i>=s;--i)
    {
        temval+=a[i]*tw;
        tw*=2;
    }
    return temval;
}

void work()
{
     int st=1,en=1,temval;
     for (int i=x;i<=y;++i)
     {
         st=en=1;
         for (int j=1;j<=m-i+1;++j)
         {
             if (j==1) en=i;
             else
             {
                 ++st; 
                 ++en;
             }
             temval=change(st,en);
             ++f[i][temval];
             if (!tu[i][temval].s)
             {
                                tu[i][temval].s=st;
                                tu[i][temval].t=en;
             }
         }
     }
     
     for (int i=1;i<=n;++i)
     {
         int max=0,temj,temk;
         for (int j=x;j<=y;++j)
             for (int k=0;k<=(1<<y)-1;++k)
                 if ((!v[j][k])&&(f[j][k]>max))
                 {
                    max=f[j][k];
                    temj=j;
                    temk=k;
                    }
         if (max==0) return;
         printf("%d/n",max);
         int tot=0,setp=0;
         for (int j=x;j<=y;++j)
             for (int k=0;k<=4095;++k)
                 if (f[j][k]==max)
                 {
                                  ans[++tot].s=tu[j][k].s;
                                  ans[tot].t=tu[j][k].t;
                                  v[j][k]=1;
                 }
         for (int j=1;j<tot;++j)
         {
             for (int k=ans[j].s;k<=ans[j].t;++k) printf("%d",a[k]);
             ++setp;
             if (setp%6==0) printf("/n");
             else printf(" ");
         }
         for (int k=ans[tot].s;k<=ans[tot].t;++k) printf("%d",a[k]);
         printf("/n");
     }
     return ;
}

int main()
{
    freopen("contact.in","r",stdin);
    freopen("contact.out","w",stdout);
    init();
    work();
    return 0;
}