Submission #845951

#	Time	Username	Problem	Language	Result	Execution time	Memory
845951		math_rabbit_1028	Closing Time (IOI23_closing)	C++17	0 / 100	1030 ms	24968 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

int n, x, y, ch[202020], ans;
ll k, need[202020], d[202020], dsum[202020];
vector<pll> adj[202020];

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N, x = X, y = Y, k = K;

    ans = 0;
    for (int i = 0; i < n; i++) adj[i].clear();

    for (int i = 0; i < (int)U.size(); i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
        d[max(U[i], V[i])] = W[i];
    }

    for (int i = 1; i < n; i++) dsum[i] = dsum[i - 1] + d[i];

    for (int a = 0; a < n - x; a++) {
        ll sum = 0;
        for (int i = 0; i < n; i++) need[i] = 0;
        for (int i = x; i <= a + x; i++) need[i] = dsum[i] - dsum[x];
        for (int i = x; i <= a + x; i++) sum += need[i];
        for (int b = 0; b <= y; b++) {
            if (need[y - b] < dsum[y] - dsum[y - b]) {
                sum += dsum[y] - dsum[y - b] - need[y - b];
                need[y - b] = dsum[y] - dsum[y - b];
            }
            if (sum <= k) ans = max(ans, a + b + 2);
            else break;
            //cout << a << " " << b << "\n";
        }
    }

    return ans;
}

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