oj.uz

Submission #746295

# Submission time Handle Problem Language Result Execution time Memory
746295 2023-05-22T08:24:19 Z bgnbvnbv Necklace (Subtask 1-3) (BOI19_necklace1) C++14
85 / 85
 605 ms 412 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=3e4;
const ll inf=1e18;
const ll mod=1e9+7;
vector<int> prefix_function(string &s) {
    int n = (int)s.length();
    vector<int> pi(n);
    for (int i = 1; i < n; i++) {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j])
            j = pi[j-1];
        if (s[i] == s[j])
            j++;
        pi[i] = j;
    }
    return pi;
}
ll n;
string s,t;
ll cnt[maxN];
ll ans=0,id1=0,id2=0;
ll cal(bool tt)
{
    string a;
    for(int i=0;i<=n;i++)
    {
        a.clear();
        for(int j=i;j<n;j++)
        {
            a.pb(s[j]);
        }
        a.pb('#');
        for(int j=0;j<t.size();j++) a.pb(t[j]);
        auto vc=prefix_function(a);
        for(int j=0;j<=t.size();j++)
        {
            cnt[j]=0;
        }
        for(int j=0;j<=t.size();j++)
        {
            cnt[j]+=vc[j+n-i];
        }
        a.clear();
        for(int j=i-1;j>=0;j--)
        {
            a.pb(s[j]);
        }
        reverse(t.begin(),t.end());
        a.pb('#');
        for(int j=0;j<t.size();j++) a.pb(t[j]);
        vc=prefix_function(a);
        for(int j=0;j<=t.size();j++)
        {
            ll x=cnt[j]+vc[t.size()-j+i];
            if(ans<x)
            {
                ans=x;
                id1=i-vc[t.size()-j+i];
                if(tt)
                {
                    id1=id1+x-1;
                    id1=s.size()-id1-1;
                }
                id2=j-cnt[j];
            }
        }
        reverse(t.begin(),t.end());
    }
    return ans;
}
ll m;
void solve()
{
    cin >> s >> t;
    n=s.size();
    m=t.size();
    cal(0);
    reverse(s.begin(),s.end());
    cal(1);
    cout << ans<<'\n';
    cout << id1<<' '<<id2;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

necklace.cpp: In function 'll cal(bool)':
necklace.cpp:41:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int j=0;j<t.size();j++) a.pb(t[j]);
      |                     ~^~~~~~~~~
necklace.cpp:43:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j=0;j<=t.size();j++)
      |                     ~^~~~~~~~~~
necklace.cpp:47:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int j=0;j<=t.size();j++)
      |                     ~^~~~~~~~~~
necklace.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for(int j=0;j<t.size();j++) a.pb(t[j]);
      |                     ~^~~~~~~~~
necklace.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int j=0;j<=t.size();j++)
      |                     ~^~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 11 ms 340 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 11 ms 340 KB Output is correct
7 Correct 10 ms 340 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 10 ms 212 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 550 ms 388 KB Output is correct
14 Correct 561 ms 404 KB Output is correct
15 Correct 605 ms 400 KB Output is correct
16 Correct 569 ms 340 KB Output is correct
17 Correct 498 ms 340 KB Output is correct
18 Correct 530 ms 404 KB Output is correct
19 Correct 547 ms 404 KB Output is correct
20 Correct 560 ms 408 KB Output is correct
21 Correct 564 ms 412 KB Output is correct