제출 #840077

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

closing

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

// CC : g++ -std=gnu++17 -O2 -Wall -pipe -static -o "closing" "grader.cpp" "closing.cpp"

// Subtask 1
vector<vector<pair<int, int>>> adj;
vector<bool> vis;

void DFS_dist(vector<long long> &distx, int u, long long d)
{
    vis[u] = 1;
    distx[u] = d;
    for (auto [v, w] : adj[u])
        if (!vis[v])
            DFS_dist(distx, v, d + w);
}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    adj.resize(N, vector<pair<int, int>>());
    for (int i = 0; i < N - 1; i++)
        adj[U[i]].push_back(make_pair(V[i], W[i])), adj[V[i]].push_back(make_pair(U[i], W[i]));

    vector<ll> distx(N), disty(N);
    vis.assign(N, 0);
    DFS_dist(distx, X, 0);
    vis.assign(N, 0);
    DFS_dist(disty, Y, 0);

    distx.insert(distx.end(), disty.begin(), disty.end());
    sort(distx.begin(), distx.end());

    int j = 0, ans = 0;
    ll cc = 0;
    while (cc + distx[j] <= K && j < distx.size())
    {
        cc += distx[j];
        ++ans, ++j;
    }

    return ans;
}

컴파일 시 표준 에러 (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:38:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     while (cc + distx[j] <= K && j < distx.size())
      |                                  ~~^~~~~~~~~~~~~~

• 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