oj.uz

답안 #453777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
453777 2021-08-04T18:45:40 Z nickmet2004 구간 성분 (KOI15_interval) C++11
61 / 100
 1000 ms 62540 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N = 2005;
int A = 37;
int B = 1e9 + 9;
int C = 31;
int D = 1e9 + 2;
string s , t;
int pw1[27] , pw2[27];
set<pair<int , int>>H;
main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> s >> t;
    int n = s.size() , m = t.size();
    pw1[0] = pw2[0] = 1;
    for(int i = 1; i < 26; ++i) pw1[i] = pw1[i - 1] * A*(i + 1) % B;
    for(int i = 1; i< 26; ++i) pw2[i] = pw2[i - 1] * C*(i + 1) % D;
    for(int i = 0; i < n; ++i){
        int x= 0 , y =0;
        for(int j = i; j < n; ++j){
            x += pw1[s[j] - 'a'];
            y += pw2[s[j] - 'a'];
            if(x>=B)x-=B;
            if(y>=D)y-=D;
           // a[j - i + 1].emplace_back(x , y);
           H.insert({x , y});
        }
    }
    int ans = 0;
    for(int i = 0; i < m; ++i){
        int x= 0 , y =0;
        for(int j = i; j < m; ++j){
            x += pw1[t[j] - 'a'];
            y += pw2[t[j] - 'a'];
            if(x>=B)x-=B;
            if(y>=D)y-=D;
            if(H.count({x ,y}))ans = max(ans , j - i + 1);
        }
    }
    cout << ans;



}

Compilation message

interval.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main (){
      | ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 460 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 4964 KB Output is correct
2 Correct 40 ms 6316 KB Output is correct
3 Correct 18 ms 588 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 75 ms 7352 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 593 ms 28992 KB Output is correct
2 Correct 666 ms 30168 KB Output is correct
3 Correct 635 ms 29756 KB Output is correct
4 Correct 599 ms 29096 KB Output is correct
5 Correct 692 ms 30032 KB Output is correct
6 Correct 597 ms 29232 KB Output is correct
7 Correct 641 ms 30024 KB Output is correct
8 Correct 646 ms 30108 KB Output is correct
9 Correct 670 ms 30080 KB Output is correct
10 Correct 687 ms 29952 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 11660 KB Output is correct
2 Execution timed out 1093 ms 62540 KB Time limit exceeded
3 Halted 0 ms 0 KB -