# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716132 | Darren0724 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 815 ms | 98788 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
#define endl '\n'
const int K=29,INF=1e18,mod=123456789098761;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<char> v(n+1);
for(int i=1;i<=n;i++){
cin>>v[i];
}
int A,B,C;cin>>A>>B>>C;
vector<vector<int>> h(n+2,vector<int>(n+2));
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
h[i][j]=h[i][j-1]*K+v[j]-'a'+1;
h[i][j]%=mod;
}
}
vector<vector<int>> dp(n+2,vector<int>(n+2,INF));
for(int i=1;i<=n;i++){
dp[i][i]=A;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |