Submission #758967

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
758967	2023-06-15 15:26:24	Adrian_Soriaga	Voting Cities (NOI22_votingcity)	C++14	15 / 100	11 ms	1236 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 10
• Subtask 7: 0 / 15
• Subtask 8: 0 / 50