Submission #1010538

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010538		thinknoexit	Closing Time (IOI23_closing)	C++17	35 / 100	125 ms	13648 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int pl[3030], pr[3030];
ll qs[3030];
ll qsx[3030], qsy[3030], qsmx[3030];
ll vx[3030], vy[3030];
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    int x = X + 1, y = Y + 1;
    for (int i = 1;i < n;i++) {
        qs[i] = qs[i - 1] + W[i - 1];
    }
    for (int i = 1;i <= n;i++) {
        vx[i] = qs[max(x, i) - 1] - qs[min(x, i) - 1];
        vy[i] = qs[max(y, i) - 1] - qs[min(y, i) - 1];
        qsx[i] = qsx[i - 1] + vx[i];
        qsy[i] = qsy[i - 1] + vy[i];
        qsmx[i] = qsmx[i - 1] + max(vx[i], vy[i]);
    }
    int mx = 0;
    { // not intercept
        vector<bool> vis(n + 1, false);
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
        pq.push({ 0ll, x });
        pq.push({ 0ll, -y });
        ll cost = 0;
        while (!pq.empty()) {
            auto x = pq.top();
            pq.pop();
            int v = x.second, vv = abs(x.second);
            if (vis[vv]) continue;
            vis[vv] = 1;
            if (cost + x.first > K) break;
            cost += x.first;
            mx++;
            if (vv != 1 && !vis[vv - 1])
                pq.push({ (v < 0) ? vy[vv - 1] : vx[vv - 1], (v < 0) ? v + 1 : v - 1 });
            if (vv != n && !vis[vv + 1])
                pq.push({ (v < 0) ? vy[vv + 1] : vx[vv + 1], (v < 0) ? v - 1 : v + 1 });
        }
    }
    pl[0] = x - 1, pr[0] = y + 1;
    for (int i = 1;i <= n;i++) {
        pl[i] = pl[i - 1], pr[i] = pr[i - 1];
        if (pl[i] == 0 && pr[i] == n + 1) continue;
        if (pr[i] == n + 1) pl[i]--;
        else if (pl[i] == 0) pr[i]++;
        else {
            if (vx[pl[i]] < vy[pr[i]])
                pl[i]--;
            else
                pr[i]++;
        }
    }
    // intercept    
    for (int l = 1;l <= y;l++) {
        for (int r = max(l, x);r <= n;r++) {
            int cnt = (r - l + 1) * 2;
            ll cost = qsmx[r] - qsmx[l - 1];
            if (r < y) cost += qsy[y] - qsy[r], cnt += y - r;
            if (x < l) cost += qsx[l - 1] - qsx[x - 1], cnt += l - x;
            if (cost > K) continue;
            int L = min(x, l) - 1, R = max(y, r) + 1;
            int lo = 0, hi = n;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                ll w = 0;
                if (pl[mi] <= L) w += qsx[L] - qsx[pl[mi]];
                if (R <= pr[mi]) w += qsy[pr[mi] - 1] - qsy[R - 1];
                if (cost + w > K) hi = mi - 1;
                else lo = mi;
            }
            cnt += max(0, L - pl[lo]) + max(0, pr[hi] - R);
            mx = max(mx, cnt);
        }
    }
    return mx;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 9 / 9
• Subtask 3: 12 / 12
• Subtask 4: 14 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17