Submission #980846

#	Time	Username	Problem	Language	Result	Execution time	Memory
980846		alo_54	Closing Time (IOI23_closing)	C++17	8 / 100	108 ms	27116 KiB

closing

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

const long long oo = 1e14;

struct Arista
{
    int v;
    long long w;
};


struct Nodo
{

    vector <Arista> ady;

    long long dist, distP = oo;
    bool vis = false;
};

struct Estado
{

    long long p;
    int idx;
};

struct Comp
{
    bool operator() (Estado a, Estado b) const
    {
        return a.p > b.p;
    }
};





int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    vector <Nodo> tree;
    tree.resize(N);

    for (int i = 0; i < N-1; i++)
    {
        tree[U[i]].ady.push_back({V[i], W[i]});
        tree[V[i]].ady.push_back({U[i], W[i]});
    }

    priority_queue <Estado, vector <Estado>, Comp>pq;

    pq.push({0, X});
    pq.push({0, Y});

    tree[Y].distP = 0; 
    tree[X].distP = 0;

    while (!pq.empty())
    {
        Estado curr = pq.top();
        pq.pop();

        if (!tree[curr.idx].vis)
        {
            tree[curr.idx].dist = tree[curr.idx].distP;
            tree[curr.idx].vis = true;

            for (auto i : tree[curr.idx].ady)
            {
                if (!tree[i.v].vis)
                {
                    tree[i.v].distP = min(tree[i.v].distP, curr.p + i.w);
                    pq.push({tree[i.v].distP, i.v});
                }
            }
        }
        
 
    }

    priority_queue <long long> minW;

    for (auto i: tree)
    {
        minW.push(i.dist *(long long) -1);
    }

    int resp = 0;
    long long sum = 0;


    while (!minW.empty())
    {
        sum += minW.top()*(long long)-1;
        minW.pop();

        if (sum <= K)
        {
            resp ++;
        }else
        {
            break;
        }
         
    }

    return resp;
    
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 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