oj.uz

답안 #698839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698839 2023-02-14T11:59:53 Z Gital Autobus (COCI22_autobus) C++11
15 / 70
 1000 ms 524288 KB 
#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<int>>,vector<pair<pair<ll,ll>,set<int>>>,greater<pair<pair<ll,ll>,set<int>>>> 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;
        }
    }
    for(int i = 0; i < q; i++) {
        int c,d; cin >> c >> d;
        priority_queue<pair<pair<ll,ll>,set<int>>,vector<pair<pair<ll,ll>,set<int>>>,greater<pair<pair<ll,ll>,set<int>>>> pq;
        dp[c][c] = 0;
        if(dp[c][d] != -1) {
            cout << dp[c][d] << endl;
            continue;
        }
        set<int> s;
        pq.push({{0,c},s});
        while(!pq.empty()) {
            ll a = pq.top().first.first;
            ll b = pq.top().first.second;
            set<int> cnt = pq.top().second;
            pq.pop();
            cnt.insert(b);
            if(cnt.size() >= k + 1) continue;
            for(int j = 0; j < v[b].size(); j++) {
                if(dp[c][v[b][j].second] == -1) dp[c][v[b][j].second] = a + v[b][j].first;
                else dp[c][v[b][j].second] = min(dp[c][v[b][j].second],a + v[b][j].first);
                if(!cnt.count(v[b][j].second))pq.push({{a + v[b][j].first,v[b][j].second},cnt});
            }
        }
        cout << dp[c][d] << endl;
    }
    return 0;
}

Compilation message

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

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 392 KB Output is correct
2 Correct 43 ms 404 KB Output is correct
3 Correct 27 ms 468 KB Output is correct
4 Correct 19 ms 468 KB Output is correct
5 Correct 184 ms 1012 KB Output is correct
6 Correct 164 ms 1292 KB Output is correct
7 Execution timed out 1098 ms 38024 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Runtime error 978 ms 524288 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 11 ms 392 KB Output is correct
8 Correct 43 ms 404 KB Output is correct
9 Correct 27 ms 468 KB Output is correct
10 Correct 19 ms 468 KB Output is correct
11 Correct 184 ms 1012 KB Output is correct
12 Correct 164 ms 1292 KB Output is correct
13 Execution timed out 1098 ms 38024 KB Time limit exceeded
14 Halted 0 ms 0 KB -