hihoCoder太阁最新面经算法竞赛9 register

Ended

Participants:256

Verdict:Time Limit Exceeded
Score:90 / 100
Submitted:2016-07-21 10:49:37

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
int main()
{  
   int N,M;
   char web[5001][100];
   int  seq[5001];
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        int i,j,k,min;
        char s[100];
        bool find;
        for(i=j=0;i<N;i++){
            scanf("%s",s);
            for(find=k=0;k<j;k++){
                if(strcmp(web[k],s)==0) {
                    printf("Cache\n");
                    seq[k]=i;
                    find=1;
                    break;
                }
            }
            if(find==1) {continue;}
            else {
                printf("Internet\n");
                if(j<M){  //insert
                strcpy(web[j],s);
                seq[j]=i;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX