oj.uz

Submission #450436

# Submission time Handle Problem Language Result Execution time Memory
450436 2021-08-02T21:36:38 Z nickmet2004 구간 성분 (KOI15_interval) C++11
100 / 100
 204 ms 48708 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 + 7;
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*(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);
        }
    }
    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; j <a[i].size(); ++j){
            while(a[i][j] > b[i][k] && k < b[i].size())++k;
            if(a[i][j] == b[i][k]){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; j <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][k] && k < b[i].size())++k;
      |                                        ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4976 KB Output is correct
2 Correct 13 ms 4940 KB Output is correct
3 Correct 6 ms 5708 KB Output is correct
4 Correct 6 ms 5708 KB Output is correct
5 Correct 19 ms 5708 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 21020 KB Output is correct
2 Correct 76 ms 21028 KB Output is correct
3 Correct 77 ms 21040 KB Output is correct
4 Correct 75 ms 21024 KB Output is correct
5 Correct 76 ms 21020 KB Output is correct
6 Correct 83 ms 21020 KB Output is correct
7 Correct 76 ms 20972 KB Output is correct
8 Correct 76 ms 21036 KB Output is correct
9 Correct 88 ms 21028 KB Output is correct
10 Correct 79 ms 20940 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 31488 KB Output is correct
2 Correct 170 ms 48708 KB Output is correct
3 Correct 152 ms 48324 KB Output is correct
4 Correct 54 ms 48588 KB Output is correct
5 Correct 204 ms 48708 KB Output is correct