Submission #965727

#TimeUsernameProblemLanguageResultExecution timeMemory
965727Der_VlaposCopy and Paste 3 (JOI22_copypaste3)C++17
62 / 100
3042 ms337696 KiB
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #include <x86intrin.h> #include <bits/stdc++.h> #include <chrono> #include <random> // @author: Vlapos namespace operators { template <typename T1, typename T2> std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x) { in >> x.first >> x.second; return in; } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x) { out << x.first << " " << x.second; return out; } template <typename T1> std::istream &operator>>(std::istream &in, std::vector<T1> &x) { for (auto &i : x) in >> i; return in; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::vector<T1> &x) { for (auto &i : x) out << i << " "; return out; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::set<T1> &x) { for (auto &i : x) out << i << " "; return out; } } // name spaces using namespace std; using namespace operators; // end of name spaces // defines #define ll long long #define ull unsigned long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define pll pair<ll, ll> #define f first #define s second #define uint unsigned int #define all(vc) vc.begin(), vc.end() // end of defines // usefull stuff void boost() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); } inline int getbit(int &x, int &bt) { return (x >> bt) & 1; } const int dx4[4] = {-1, 0, 0, 1}; const int dy4[4] = {0, -1, 1, 0}; const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1}; const ll INF = (1e18) + 500; const int BIG = (1e9) * 2 + 100; const int MAXN = (1e5) + 5; const int MOD7 = (1e9) + 7; const int MOD9 = (1e9) + 9; const uint MODFFT = 998244353; #define int ll struct test { void solve(int testcase) { boost(); int n; cin >> n; string s; cin >> s; int a, b, c; cin >> a >> b >> c; vector<vector<int>> dp(n, vector<int>(n, INF)); for (int i = 0; i < n; ++i) dp[i][i] = a; map<pii, vector<int>> last; vector<vector<int>> PR(n, vector<int>(n)); for (int l = 0; l < n; ++l) { int h1 = 0, h2 = 0; for (int r = l; r < n; ++r) { h1 = ((h1 * 911) % MODFFT + s[r]) % MODFFT; h2 = ((h2 * 13) % MOD7 + s[r]) % MOD7; auto &v = last[{h1, h2}]; auto it = lower_bound(all(v), l); if (it != v.begin()) PR[l][r] = *prev(it) - (r - l); else PR[l][r] = -1; last[{h1, h2}].pb(r); } } for (int l = n - 1; l >= 0; --l) for (int r = l; r < n; ++r) { if (l - 1 >= 0) dp[l - 1][r] = min(dp[l - 1][r], dp[l][r] + a); if (r + 1 < n) dp[l][r + 1] = min(dp[l][r + 1], dp[l][r] + a); int prevL = l, prevR = r, len = r - l, cnt = 0, op = c; while (prevL != -1) { dp[prevL][r] = min(dp[prevL][r], dp[l][r] + cnt * a + b + op); op += c; cnt += prevL - 1; prevL = PR[prevL][prevR]; prevR = prevL + len; cnt -= prevR; } } cout << dp[0][n - 1] << '\n'; } }; main() { boost(); int q = 1; // cin >> q; for (int i = 0; i < q; i++) { test t; t.solve(i); } return 0; } //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]// // // // Coded by Der_Vlἀpos // // // //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message (stderr)

copypaste3.cpp:158:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  158 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...