제출 #840007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
840007		math_rabbit_1028	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	1058 ms	23996 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, c[202020], d[202020];
vector<pll> adj[202020];
priority_queue<pll> pq;

int greedy(int s1, int s2) {
    int ret = 0;

    if (0 <= s1 && s1 < n) pq.push({-0, s1});
    if (0 <= s2 && s2 < n) pq.push({-0, s2});

    while (!pq.empty()) {
        int v = pq.top().second; ll w = -pq.top().first;
        pq.pop();
        //cout << v << " " << w << "\n";
        if (k - w >= 0) {
            ret++;
            k -= w;
        }
        else break;

        ch[v] = 1;
        for (int i = 0; i < (int)adj[v].size(); i++) {
            if (ch[adj[v][i].first] == 1) continue;
            pq.push({-w-adj[v][i].second, adj[v][i].first});
        }
    }
    return ret;
}

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 a = 0; a < n - x; a++) {
        for (int b = 0; b <= y; b++) {
            for (int i = 0; i < n; i++) c[i] = 0;
            k = K;

            for (int i = x + 1; i <= x + a; i++) c[i] = max(c[i], c[i - 1] + d[i]);
            for (int i = y - 1; i >= y - b; i--) c[i] = max(c[i], c[i + 1] + d[i + 1]);
            for (int i = x; i <= y; i++) k -= c[i];
            int cnt = a + b + 2;
            if (k < 0) continue;
            
            for (int i = 0; i < n; i++) ch[i] = 0;
            ch[x] = ch[y] = 1;
            while (!pq.empty()) pq.pop();
            ans = max(ans, cnt + greedy(x - 1, y + 1)); 
        }
    }

    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