제출 #969315

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

closing

#include "closing.h"

#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>>a[200001];
void dfs(int x, long long int d, vector<long long int> &dist, bool visited[])
{
    visited[x]=1;
    dist[x]=d;
    for(int i=0; i<a[x].size(); i++)
    {
        if(!visited[a[x][i].first])
        {
            dfs(a[x][i].first, d+a[x][i].second, dist, visited);
        }
    }
}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    int n=N, x=X, y=Y;
    long long k=K;
    for(int i=0; i<n-1; i++)
    {
        a[U[i]].push_back({V[i], W[i]});
        a[V[i]].push_back({U[i], W[i]});
    }
    bool visited[n];
    memset(visited, false, sizeof(visited));
    vector<long long> dist(n), dist2(n);
    dfs(x, 0, dist, visited);
    memset(visited, false, sizeof(visited));
    dfs(y, 0, dist2, visited);
    /*long long int dist[2*n];
    int j=0, j1=n;
    for(int i=0; i<n; i++)
    {
        dist[j]=dist1[i];
        dist[j1]=dist2[i];
        j++; j1++;
    }*/
    dist.insert(dist.end(), dist2.begin(), dist2.end());
    sort(dist.begin(), dist.end());
    int sol=0, j=0;
    long long kk=0;
    while(kk+dist[j]<=k && j<dist.size())
    {
        kk+=dist[j];
        j++;
        sol++;
    }
    return sol;
}

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

closing.cpp: In function 'void dfs(int, long long int, std::vector<long long int>&, bool*)':
closing.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=0; i<a[x].size(); i++)
      |                  ~^~~~~~~~~~~~
closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:46:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     while(kk+dist[j]<=k && j<dist.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