oj.uz

Submission #748306

# Submission time Handle Problem Language Result Execution time Memory
748306 2023-05-26T05:10:39 Z Toxtaq Voting Cities (NOI22_votingcity) C++17
15 / 100
 15 ms 852 KB 
#include<bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>>G;
vector<int>cities;
int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    G.resize(n + 1);
    for(int i = 0;i < k;++i){
        int a;
        cin >> a;
        a++;
        cities.push_back(a);
    }
    for(int i = 0;i < m;++i){
        int u, v, c;
        cin >> u >> v >> c;
        u++;
        v++;
        G[v].push_back({u, c});
    }

    vector<long long>dist(n + 1, 1e18);
    priority_queue<pair<long long, int>>pq;
    vector<int>check(n + 1);
    dist[cities[0]] = 0;
    pq.push({0, cities[0]});
    while(!pq.empty()){
        int cur = pq.top().second;
        pq.pop();
        if(check[cur])continue;
        check[cur] = 1;
        for(pair<int, int> &temp: G[cur]){
            long long v = temp.first, w = temp.second;
            if(dist[v] > dist[cur] + w){
                dist[v] = dist[cur] + w;
                pq.push({-dist[v], v});
            }
        }
    }
    int q;
    cin >> q;
    while(q--){
        int s, p1, p2, p3, p4, p5;
        cin >> s >> p1 >> p2 >> p3 >> p4 >> p5;
        s++;
        long long mn = 1e18;
        mn = min(mn, dist[s]);
        if(mn == 1e18){
            cout << -1 << '\n';
        }
        else cout << mn << '\n';
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 756 KB Output is correct
7 Correct 7 ms 724 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 756 KB Output is correct
7 Correct 7 ms 724 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Incorrect 15 ms 852 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 14 ms 744 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 12 ms 852 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 756 KB Output is correct
7 Correct 7 ms 724 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 14 ms 744 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 12 ms 852 KB Output is correct
14 Incorrect 14 ms 852 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 820 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 12 ms 828 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 756 KB Output is correct
7 Correct 7 ms 724 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Incorrect 15 ms 852 KB Output isn't correct
12 Halted 0 ms 0 KB -