제출 #980138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980138		alo_54	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	135 ms	29244 KiB

closing

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

const long long oo = 1e14;

int x, y, n;

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


struct Nodo
{

    vector <Arista> ady;

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

struct Estado
{
    bool operator< (Estado otro) const
    {
        return p <otro.p;
    }

    long long p;
    int idx;
};

vector <Nodo> tree;


int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    
    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> pq;

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

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

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

        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 * -1);
    }

    int resp = 0;
    long long sum = 0;


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

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

컴파일 시 표준 에러 (stderr) 메시지

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:51:29: warning: control reaches end of non-void function [-Wreturn-type]
   51 |     priority_queue <Estado> pq;
      |                             ^~

• 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