oj.uz

답안 #71185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71185 2018-08-24T07:54:32 Z vanogam 구간 성분 (KOI15_interval) C++14
61 / 100
 1000 ms 42996 KB 
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
long long s,d[30],f[1502],g,h,j,k,mod=1000000000736009,mar=1507;
int i,a,l,n,m;
string x,z;
unordered_set<long long> q[2002];
main(){
    //ios::sync_with_stdio(0);
    d[0]=1;
    for(i=1;i<30;i++){
        d[i]=(d[i-1]*mar)%mod;
    }
    char c;
    while((c=getchar())!='\n') x+=c;
    while((c=getchar())!='\n') z+=c;
    //if(x.size()>z.size()) swap(x,z);
    //cout<<"*"<<x<<" "<<z<<"*";
    n=x.size();
    for(i=0;i<x.size();i++) x[i]-='a';
    for(i=0;i<z.size();i++) {z[i]-='a';f[i]=i;}
    random_shuffle(f,f+z.size());
    for(i=0;i<n;i++){
        h=0;
        for(a=i;a<n;a++){
            h+=d[x[a]];
            if(h>mod) h-=mod;
            q[a-i].insert(h);
        }
    }
    m=z.size();
    for(i=0;i<m;i++){
        h=0;//cout<<f[i]<<" ";
        //f=min(z.size(),i+x.size());
        for(a=f[i];a<m;a++){
            //if(a>i+x.size()) break;

            h+=d[z[a]];
            if(h>mod) h-=mod;
            if(l<a-f[i]+1 && q[a-f[i]].find(h)!=q[a-f[i]].end()) l=a-f[i]+1;
        }
    }

    cout<<l;
}

Compilation message

interval.cpp:8:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
interval.cpp: In function 'int main()':
interval.cpp:20:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<x.size();i++) x[i]-='a';
             ~^~~~~~~~~
interval.cpp:21:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<z.size();i++) {z[i]-='a';f[i]=i;}
             ~^~~~~~~~~
interval.cpp:26:22: warning: array subscript has type 'char' [-Wchar-subscripts]
             h+=d[x[a]];
                      ^
interval.cpp:38:22: warning: array subscript has type 'char' [-Wchar-subscripts]
             h+=d[z[a]];
                      ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 612 KB Output is correct
3 Correct 3 ms 612 KB Output is correct
4 Correct 4 ms 740 KB Output is correct
5 Correct 4 ms 796 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 3972 KB Output is correct
2 Correct 42 ms 4748 KB Output is correct
3 Correct 7 ms 4748 KB Output is correct
4 Correct 5 ms 4748 KB Output is correct
5 Correct 52 ms 5580 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 374 ms 20688 KB Output is correct
2 Correct 341 ms 21624 KB Output is correct
3 Correct 373 ms 21624 KB Output is correct
4 Correct 416 ms 21624 KB Output is correct
5 Correct 458 ms 21624 KB Output is correct
6 Correct 432 ms 21624 KB Output is correct
7 Correct 432 ms 21624 KB Output is correct
8 Correct 431 ms 21624 KB Output is correct
9 Correct 439 ms 21624 KB Output is correct
10 Correct 473 ms 21624 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 21624 KB Output is correct
2 Execution timed out 1042 ms 42996 KB Time limit exceeded
3 Halted 0 ms 0 KB -