제출 #698832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
698832		Gital	Autobus (COCI22_autobus)	C++11	15 / 70	1096 ms	524288 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
ll dp[75][75];
vector<pair<ll,ll>> v[75];
//bool checked[75];
int n,m;
priority_queue<pair<pair<ll,ll>,set<ll>>,vector<pair<pair<ll,ll>,set<ll>>>,greater<pair<pair<ll,ll>,set<ll>>>> pq;
int k,q;
int main () {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        ll a,b,c; cin >> a >> b >> c;
        v[a].push_back({c,b});
    }
    cin >> k >> q;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            dp[i][j] = -1;
        }
        dp[i][i] = 0;
        set<ll> s;
        pq.push({{0,i},s});
        while(!pq.empty()) {
            ll a = pq.top().first.first;
            ll b = pq.top().first.second;
            set<ll> cnt = pq.top().second;
            pq.pop();
            if(cnt.count(b)) continue;
            cnt.insert(b);
            if(cnt.size() >= k + 1) continue;
            for(int j = 0; j < v[b].size(); j++) {
                if(dp[i][v[b][j].second] == -1) dp[i][v[b][j].second] = a + v[b][j].first;
                else dp[i][v[b][j].second] = min(dp[i][v[b][j].second],a + v[b][j].first);
                pq.push({{a + v[b][j].first,v[b][j].second},cnt});
            }
        }
    }
    for(int i = 0; i < q; i++) {
        int c,d; cin >> c >> d;
        cout << dp[c][d] << endl;
    }
    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:33:27: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |             if(cnt.size() >= k + 1) continue;
      |                ~~~~~~~~~~~^~~~~~~~
Main.cpp:34:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |             for(int j = 0; j < v[b].size(); j++) {
      |                            ~~^~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25
• Subtask 4: 0 / 15