제출 #671252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671252		groshi	악어의 지하 도시 (IOI11_crocodile)	C++17	100 / 100	507 ms	67236 KiB

crocodile

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct wi{
    vector<int> Q;
    int odw=0;
    int ktory=0;
}*w;
int travel_plan(int n,int m,int R[][2],int L[],int k,int P[])
{
    w=new wi[n+3];
    for(int i=0;i<m;i++)
    {
        int x=R[i][0];
        int y=R[i][1];
        int z=L[i];
        cin>>x>>y>>z;
        w[x].Q.push_back(y);
        w[x].Q.push_back(z);
        w[y].Q.push_back(x);
        w[y].Q.push_back(z);
    }
    priority_queue<pair<int,int> > kolejka;
    for(int i=0;i<k;i++)
    {
        int x=P[i];
        w[x].odw=1;
        for(int j=0;j<w[x].Q.size();j+=2)
        {
            int pom=w[x].Q[j];
            kolejka.push({-w[x].Q[j+1],pom});
        }
    }
    while(!kolejka.empty())
    {
        auto para=kolejka.top();
        kolejka.pop();
        if(w[para.second].odw)
            continue;
        w[para.second].ktory++;
        if(w[para.second].ktory==2)
        {
            if(para.second==0)
                return -para.first;
            w[para.second].odw=1;
            for(int i=0;i<w[para.second].Q.size();i+=2)
            {
                int pom=w[para.second].Q[i];
                if(w[pom].odw)
                    continue;
                kolejka.push({para.first-w[para.second].Q[i+1],pom});
            }
        }
    }
    return -1;
}

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

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int j=0;j<w[x].Q.size();j+=2)
      |                     ~^~~~~~~~~~~~~~
crocodile.cpp:47:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             for(int i=0;i<w[para.second].Q.size();i+=2)
      |                         ~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11