Submission #687572

#	Time	Username	Problem	Language	Result	Execution time	Memory
687572		ksjsjsjsjsjsjs	Visiting Singapore (NOI20_visitingsingapore)	C++14	100 / 100	340 ms	536 KiB

VisitingSingapore

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ers erase
#define bg begin
#define ed end
#define ft front
#define bk back
#define mtp make_tupl
#define sz(x) (int)(x).size()
#define all(x) (x).bg(), (x).ed()
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define str string
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { WHILE(b) { a %= b; swap(a, b); } return a; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
const int oo = 1e9 + 5;
const int N = 5005;
int k, n, m, a, b, v[N], s[N], t[N], d[N][3], d1[N][3];
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    freopen(file".inp", "r", stdin);
//    freopen(file".out", "w", stdout);
    cin >> k >> n >> m >> a >> b;
    FOR(i, 1, k) cin >> v[i];
    FOR(i, 1, n) cin >> s[i];
    FOR(i, 1, m) cin >> t[i];
    FOS(j, m + 1, 1)
    FSN(z, 3) {
        if (z != 2) d1[j][z] = (j <= m? a : 0) + (m - j + 1) * b;
        else d1[j][z] = (m - j + 1) * b;
    }
    int rs = -oo;
    rs = max(rs, a + m * b);
    FOS(i, n, 1) {
        FRN(z, 3) d[m + 1][z] = 0;
        FOS(j, m, 1)
        FRN(z, 3) {
            d[j][z] = -oo;
            if (!z) {
                if (i <= n) d[j][z] = max(d[j][z], d1[j][1] + a + b);
                if (j <= m) d[j][z] = max(d[j][z], d[j + 1][2] + a + b);
                if (j <= m && s[i] == t[j]) d[j][z] = max(d[j][z], d1[j + 1][0] + v[s[i]]);
            }
            else if (z == 1) {
                if (i <= n) d[j][z] = max(d[j][z], d1[j][1] + b);
                d[j][z] = max(d[j][z], d[j][0]);
            }
            else {
                if (j <= m) d[j][z] = max(d[j][z], d[j + 1][2] + b);
                d[j][z] = max(d[j][z], d[j][0]);
            }
//            cerr << i << ' ' << j << ' ' << z << " : " << d[j][z] << '\n';
        }
        rs = max(rs, d[1][0]);
        swap(d, d1);
    }
    cout << rs;
//    cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}
/*
1 1 1 -7 -7
3
1
1

*/

• Subtask 1: 4 / 4
• Subtask 2: 6 / 6
• Subtask 3: 12 / 12
• Subtask 4: 7 / 7
• Subtask 5: 8 / 8
• Subtask 6: 13 / 13
• Subtask 7: 50 / 50