oj.uz

Submission #648731

# Submission time Handle Problem Language Result Execution time Memory
648731 2022-10-07T22:41:37 Z Lobo Necklace (Subtask 1-3) (BOI19_necklace1) C++17
0 / 85
 31 ms 1492 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 3030;
const int mod1 = 1e9+7;
const int mod12 = 1e9+9;

string a,b;
int n, m, pw1[maxn], lra[maxn][maxn], lrb[maxn][maxn];

void solve() {
    cin >> a >> b;
    n = a.size();
    m = b.size();

    pw1[0] = 1;
    pw1[1] = 19079;
    for(int i = 2; i <= max(n,m); i++) {
        pw1[i] = pw1[i-1]*pw1[1]%mod1;
    }

    map<int,int> st;
    for(int i = 0; i < n; i++) {
        int cur = 0;
        for(int j = i; j < n; j++) {
            cur = (cur+a[j]*pw1[j-i])%mod1;
            lra[i][j] = cur;
            st[cur] = i;
        }
    }

    for(int i = 0; i < m; i++) {
        int cur = 0;
        for(int j = i; j < m; j++) {
            cur = (cur+b[j]*pw1[j-i])%mod1;
            lrb[i][j] = cur;
        }
    }

    int ans = 0;
    int ansa,ansb;
    for(int i = 0; i < m; i++) {
        for(int j = i; j < m; j++) {
            for(int k = j; k < m; k++) {
                //(j,k) (i,j-1)
                int val = lrb[j][k]+ lrb[i][j-1]*pw1[k-j+1];
                val%= mod1;
                if(st.count(val) && k-i+1 > ans) {
                    ans = k-i+1;
                    ansa = st[val];
                    ansb = i;
                }
            }
        }
    }

    reverse(all(b));
    for(int i = 0; i < m; i++) {
        int cur = 0;
        for(int j = i; j < m; j++) {
            cur = (cur+b[j]*pw1[j-i])%mod1;
            lrb[i][j] = cur;
        }
    }

    for(int i = 0; i < m; i++) {
        for(int j = i; j < m; j++) {
            for(int k = j; k < m; k++) {
                //(j,k) (i,j-1)
                int val = lrb[j][k]+ lrb[i][j-1]*pw1[k-j+1];
                val%= mod1;
                if(st.count(val) && k-i+1 > ans) {
                    ans = k-i+1;
                    ansa = st[val];
                    ansb = m-k-1;
                }
            }
        }
    }

    cout << ans << endl;
    cout << ansa << " " << ansb << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1236 KB Output is correct
2 Correct 26 ms 1316 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 22 ms 1380 KB Output is correct
5 Incorrect 31 ms 1492 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1236 KB Output is correct
2 Correct 26 ms 1316 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 22 ms 1380 KB Output is correct
5 Incorrect 31 ms 1492 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1236 KB Output is correct
2 Correct 26 ms 1316 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 22 ms 1380 KB Output is correct
5 Incorrect 31 ms 1492 KB Output isn't correct
6 Halted 0 ms 0 KB -