oj.uz

답안 #26682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26682 2017-07-04T16:39:08 Z TAMREF 구간 성분 (KOI15_interval) C++11
7 / 100
 323 ms 2160 KB 
#include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod[2]={1000000007,1610612741};
ll pow1500[2][26]={{1},{1}};
char A[1505], B[1505];
int N,M;
set<pair<ll,ll>> S;
void init(){
    for(int i=1;i<26;i++) for(int b=0;b<2;b++) pow1500[b][i]=(pow1500[b][i-1]*1500)%mod[b];
    fgets(A,1502,stdin); N=strlen(A); A[--N]=0;
    fgets(B,1502,stdin); M=strlen(B); B[--M]=0;
    for(int i=0;i<N;i++) A[i]&=15;
    for(int i=0;i<M;i++) B[i]&=15;
}
bool pro(int x){
    S.clear();
    ll H[2]={0,0};
    for(int i=0;i<x;i++)for(int b=0;b<2;b++) H[b]=(H[b]+pow1500[b][A[i]-1])%mod[b];
    S.insert(mp(H[0],H[1]));
    for(int i=x;i<N;i++){
        for(int b=0;b<2;b++)
            H[b]=(((H[b]+pow1500[b][A[i]-1])%mod[b]-pow1500[b][A[i-x]-1])%mod[b]+mod[b])%mod[b];
        S.insert(mp(H[0],H[1]));
    }
    H[0]=H[1]=0;
    for(int i=0;i<x;i++) for(int b=0;b<2;b++) H[b]=(H[b]+pow1500[b][B[i]-1])%mod[b];
    if(S.find(mp(H[0],H[1]))!=S.end()) return true;
    for(int i=x;i<M;i++){
        for(int b=0;b<2;b++)
            H[b]=(((H[b]+pow1500[b][B[i]-1])%mod[b]-pow1500[b][B[i-x]-1])%mod[b]+mod[b])%mod[b];
        if(S.find(mp(H[0],H[1]))!=S.end()) return true;
    }
    return false;
}
int main(){
    init();
    int ans=0, x=min(N,M);
    for(int i=1;i<=x;i++) if(pro(i)) ans=max(ans,i);
    printf("%d\n",ans);
}

Compilation message

interval.cpp: In function 'void init()':
interval.cpp:12:24: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fgets(A,1502,stdin); N=strlen(A); A[--N]=0;
                        ^
interval.cpp:13:24: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fgets(B,1502,stdin); M=strlen(B); B[--M]=0;
                        ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2028 KB Output is correct
2 Correct 0 ms 2028 KB Output is correct
3 Correct 0 ms 2028 KB Output is correct
4 Correct 0 ms 2028 KB Output is correct
5 Correct 0 ms 2028 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 2028 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 2160 KB Output is correct
2 Incorrect 129 ms 2160 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 2028 KB Output is correct
2 Correct 309 ms 2160 KB Output is correct
3 Correct 289 ms 2160 KB Output is correct
4 Correct 116 ms 2028 KB Output is correct
5 Incorrect 323 ms 2160 KB Output isn't correct