oj.uz

Submission #758967

# Submission time Handle Problem Language Result Execution time Memory
758967 2023-06-15T15:26:24 Z Adrian_Soriaga Voting Cities (NOI22_votingcity) C++14
15 / 100
 11 ms 1236 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pail;
vector<ll> dij(vector<pail> adj[] , int start ,int target , int nodes){
    ll INF = 1000000000000000;
    vector<ll> ans;
    vector<int> done(nodes,0);
    vector<ll> distance(nodes,INF);
    priority_queue<pail, vector<pail>, greater<pail>> pq;
    pq.push({0,start});
    distance[start] = 0;
    while (!pq.empty()){
        ll u = pq.top().second;
        pq.pop();
        if (done[u]) continue;
        done[u] =1;
        for (auto x: adj[u]){
            ll v = x.first , w = x.second;
            if (distance[v] > distance[u]+ w) distance[v] = distance[u]+w;
            pq.push({distance[v],v});
        }
    }
    for (int i=0; i<nodes;i++) ans.push_back(distance[i]);
    return ans;
}
int main(){
    int n,e,k; cin>>n>>e>>k;
    int t; cin>>t;
    vector<pail> adj[n];
    for (int i=0; i<e;i++){
        ll a,b,w; cin>>a>>b>>w;
        //adj[a].push_back({b,w});
        adj[b].push_back({a,w});
    }
    int q,s; cin>>q>>s;
    vector<ll> check = dij(adj,t,s,n);
    if (check[s] ==1000000000000000 ) cout<<-1<<"\n";
    else cout<<check[s]<<"\n";
    //getting the dummy tickets;
    cin>>s>>s>>s>>s>>s;
    for (int i=1; i<q; i++){
        int t_1,t_2,t_3,t_4,t_5; cin>>s>>t_1>>t_2>>t_3>>t_4>>t_5;
    if (check[s] ==1000000000000000 ) cout<<-1<<"\n";
    else cout<<check[s]<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 796 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 796 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 744 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 8 ms 796 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 796 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 744 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 8 ms 796 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Runtime error 8 ms 1208 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 796 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 724 KB Output is correct
7 Correct 4 ms 620 KB Output is correct
8 Correct 11 ms 776 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 8 ms 1236 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 796 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 8 ms 852 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 744 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 8 ms 796 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Runtime error 8 ms 1208 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -