Submission #1058985

#TimeUsernameProblemLanguageResultExecution timeMemory
1058985BoasCopy and Paste 3 (JOI22_copypaste3)C++17
20 / 100
3101 ms367976 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; template <typename T1, typename T2> using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> using indexed_set = indexed_map<T, null_type>; #define loop(x, i) for (int i = 0; i < (x); i++) #define loop1(x, i) for (int i = 1; i <= (x); i++) #define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--) #define itloop(x) for (auto it = begin(x); x != end(x); it++) #define itrev(x) for (auto it = rbegin(x); x != rend(x); it++) #define int long long #define INF ((int)(2e18 + 1)) #define ALL(x) begin(x), end(x) #define RALL(x) rbegin(x), rend(x) #define existsIn(x, l) (count(ALL(l), x) > 0) #define removeIn(x, l) l.erase(find(ALL(l), x)) #define pb push_back #define sz(x) (int)(x).size() #define F first #define S second #define var const auto & #define foreach(l) for (var e : l) typedef int8_t in8; typedef int16_t in16; typedef int32_t in32; typedef int64_t in64; typedef pair<int, int> ii; typedef tuple<int, int, int> iii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<vii> vvii; typedef vector<viii> vviii; typedef set<int> si; typedef set<ii> sii; typedef set<iii> siii; typedef vector<si> vsi; typedef vector<sii> vsii; typedef vector<vsi> vvsi; typedef vector<string> vstr; typedef vector<vector<string>> vvstr; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vi::iterator viit; typedef si::iterator siit; typedef tuple<int, int, int, int> iiii; typedef tuple<int, int, int, int, int> iiiii; int n, a, b, c; string s; // map<iiii, int> dp; set<iiii> seen; vi ixs; void solve() { ixs.clear(); cin >> n >> s >> a >> b >> c; map<string, si> strIxs; si chars; loop(n, i) { if (!chars.count(s[i])) { chars.insert(s[i]); ixs.pb(i); } } if (chars.size() > 1) loop(n, l) for (int r = l; r < n; r++) strIxs[s.substr(l, r - l + 1)].insert(l); priority_queue<iiiii> q; q.push({0, 0, 0, 0, 0}); while (!q.empty()) { auto [cur, lX, sX, lY, sY] = q.top(); q.pop(); if (sX == n) { cout << -cur << endl; exit(0); } if (sX > n) continue; if (seen.count({lX, sX, lY, sY})) continue; seen.insert({lX, sX, lY, sY}); if (sX == 0LL) { for (int i : ixs) { q.push({cur - a, i, 1LL, lY, sY}); } } else { q.push({cur - a, lX, sX + 1LL, lY, sY}); } if (sX) { q.push({cur - b, 0LL, 0LL, lX, sX}); } if (sY && lX + sX + sY <= n) { if (chars.size() == 1) { q.push({cur - c, lX, sX + sY, lY, sY}); } else { string x = s.substr(lX, sX); string y = s.substr(lY, sY); if (x.empty()) { q.push({cur - c, lY, sY, lY, sY}); } else for (int i : strIxs[x]) { if (i + sX + sY <= n && strIxs[y].count(i + sX)) q.push({cur - c, i, sX + sY, lY, sY}); } } } } } signed main() { cin.tie(0)->sync_with_stdio(0); int t = 1; // cin >> t; while (t--) solve(); }
#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...