# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963607 | 2024-04-15T11:37:24 Z | Amr | Crocodile's Underground City (IOI11_crocodile) | C++17 | 2 ms | 12892 KB |
#include "crocodile.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; #define F first #define S second #define sz size() const int N = 3e5+2; const ll inf = 1e18; ll vis[N]; pair<ll,ll> d[N]; vector<pair<ll,ll> > v[N]; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { for(int i = 0; i < M; i++) { ll x = R[i][0] , y = R[i][1]; ll z = L[i]; v[x].push_back({y,z}); v[y].push_back({x,z}); } for(int i = 0; i < N; i++) d[i].F = d[i].S = inf; multiset<pair<ll,ll> > s; for(int i = 0; i < K; i++) { ll x = P[i]; s.insert({0,x}); //s.insert({0,x}); //vis[x] = 1; d[x] = {0,0}; } while(s.sz) { ll cur = s.begin()->S; //cout << cur << " " << s.begin()->F << endl; ll dis1 = d[cur].F , dis2 = d[cur].S; s.erase(s.begin()); ll dis = dis2; //vis[cur]++; //if(vis[i]==1) continue; for(int i = 0; i < v[cur].sz; i++) { ll newn = v[cur][i].F , w = v[cur][i].S; //if(vis[newn]==2) continue; if(w+dis<d[newn].S) { if(d[newn].F==inf) { d[newn].F=w+dis; continue; } s.erase({d[newn].S,newn}); d[newn].S = w+dis; s.insert({d[newn].S,newn}); if(d[newn].S<d[newn].F) swap(d[newn].F,d[newn].S); } } } return d[0].S; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 12892 KB | Output is correct |
2 | Correct | 2 ms | 12892 KB | Output is correct |
3 | Incorrect | 2 ms | 12892 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 12892 KB | Output is correct |
2 | Correct | 2 ms | 12892 KB | Output is correct |
3 | Incorrect | 2 ms | 12892 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 12892 KB | Output is correct |
2 | Correct | 2 ms | 12892 KB | Output is correct |
3 | Incorrect | 2 ms | 12892 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |