Submission #692925

#	Time	Username	Problem	Language	Result	Execution time	Memory
692925		saayan007	Visiting Singapore (NOI20_visitingsingapore)	C++17	4 / 100	313 ms	262144 KiB

VisitingSingapore

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

const ll inf = 1e15L;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll k, n, m, a, b;
    cin >> k >> n >> m >> a >> b;
    a = -a;
    b = -b;

    ll v[k + 1], s[n + 1], t[m + 1];

    fur(i, 1, k) {
        cin >> v[i];
    }
    fur(i, 1, n) {
        cin >> s[i];
    }
    fur(i, 1, m) {
        cin >> t[i];
    }

    ll dp[n + 1][m + 1][4];
    fur(i, 0, n)
        fur(j, 0, m)
            fur(x, 0, 3)
                dp[i][j][x] = -inf;

    ll res = -a;

    fur(i, 1, n) {
        fur(j, 1, m) {
            if(s[i] == t[j]) {
                fur(y, 0, 3) {
                    dp[i][j][3] = max({dp[i][j][3], dp[i - 1][j - 1][y] + v[t[j]], v[t[j]] - a * (j > 1ll ? 1ll : 0ll)});
                    res = max(res, dp[i][j][3] - a * (j < m ? 1ll : 0ll));
                }
                // cout << i << ' ' << j << nl;
                // cout << dp[i][j][3] << nl;
            }

            dp[i][j][0] = max({dp[i][j][0], dp[i - 1][j][0], dp[i - 1][j][2] - a, dp[i][j - 1][0], dp[i][j - 1][1] - a});
            fur(y, 0, 3) {
                dp[i][j][0] = max(dp[i][j][0], dp[i - 1][j - 1][y] - a * (ll)__builtin_popcountll(y));
            }
            dp[i][j][1] = max({dp[i][j][1], dp[i - 1][j][1], dp[i - 1][j][3] - a});
            dp[i][j][2] = max({dp[i][j][2], dp[i][j - 1][2], dp[i][j - 1][3] - a});
        }
    }
    // cout << nl;
    // cout << dp[5][1][3] << ' ' << dp[6][4][3] << nl;
    cout << res << nl;
}

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