oj.uz

답안 #450431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
450431 2021-08-02T21:28:52 Z nickmet2004 구간 성분 (KOI15_interval) C++11
0 / 100
 44 ms 31384 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N = 2005;
int A = 987654323;
int B = 1e9 + 9;
int C = 985201597;
int D = 660353359;
string s , t;
int pw1[27] , pw2[27];
vector<pair<int , int>> a[N] , b[N];
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 % B;
    for(int i = 1; i< 26; ++i) pw2[i] = pw2[i - 1] * C % 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);
        }
    }
    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;
            b[j - i + 1].emplace_back(x , y);
        }
    }
    for(int i = min(n , m); ~i; --i){
        sort(a[i].begin() , a[i].end());
        sort(b[i].begin() , b[i].end());
        int k = 0;
        for(int j= 0; i <a[i].size(); ++j){
            while(a[i][j] > b[i][j] && k < b[i].size())++k;
            if(a[i][j] == b[i][j]){cout << i << endl; return 0;}
        }
    }cout << 0;



}

Compilation message

interval.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main (){
      | ^~~~
interval.cpp: In function 'int main()':
interval.cpp:45:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int j= 0; i <a[i].size(); ++j){
      |                       ~~^~~~~~~~~~~~
interval.cpp:46:42: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             while(a[i][j] > b[i][j] && k < b[i].size())++k;
      |                                        ~~^~~~~~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 23.0

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

Subtask #3
0 / 31.0

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

Subtask #4
0 / 39.0

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