Submission #966150

#	Time	Username	Problem	Language	Result	Execution time	Memory
966150		Boas	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	1006 ms	53244 KiB

closing

#include "closing.h"

#include <vector>
using namespace std;
#include <bits/stdc++.h>
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef set<ii> sii;
typedef vector<sii> vsii;
typedef tuple<int, int, int, bool> item;

#define ALL(x) (x).begin(), x.end()
#define loop(x, i) for (int i = 0; i < x; i++)

void getDist(int i, int d, vi &dist, const vsii &adj)
{
    dist[i] = d;
    for (auto [j, w] : adj[i])
    {
        if (dist[j] != -1)
            continue;
        getDist(j, dist[i] + w, dist, adj);
    }
}

int max_score(int N, int X, int Y, long long K, vi U, vi V, vi W)
{
    vsii adj(N);
    loop(N - 1, i)
    {
        adj[U[i]].insert({V[i], W[i]});
        adj[V[i]].insert({U[i], W[i]});
    }
    vi distX(N, -1), distY(N, -1);
    distX[X] = 0;
    distY[Y] = 0;
    getDist(X, 0, distX, adj);
    getDist(Y, 0, distY, adj);
    priority_queue<item> q;
    for (int i = 0; i < N; i++)
    {
        q.push({-distX[i], -distX[i], i, false});
        q.push({-distY[i], -distY[i], i, true});
    }
    int total = 0;
    vb visX(N), visY(N);
    int score = 0;
    vi time(N, 0);
    while (total <= K && !q.empty())
    {
        auto [oldDiff, d, i, fromY] = q.top();
        q.pop();
        int old = time[i];
        int nieuw = max(-d, time[i]);
        int diff = nieuw - old;
        if (total + diff > K)
            break;
        total += diff;
        time[i] = nieuw;
        score++;
        cerr << "Going to " << i << " from " << (fromY ? 'Y' : 'X') << endl;
        if (fromY)
            visY[i] = 1;
        else
            visX[i] = 1;
        if (!visX[i] && !visY[i])
        {
            int nieuw = max(distY[i], distX[i]);
            int old = fromY ? distY[i] : distX[i];
            int diff = nieuw - old;
            q.push({-diff, fromY ? -distX[i] : -distY[i], i, !fromY});
        }
    }
    cerr << endl;
    return score;
}

• 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