Submission #1268509

#TimeUsernameProblemLanguageResultExecution timeMemory
1268509m_mondzikCrocodile's Underground City (IOI11_crocodile)C++20
0 / 100
0 ms324 KiB
#include "crocodile.h" #include<bits/stdc++.h> #define F first #define S second using namespace std; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){ vector<pair<int, int>> graph[N]; for (int i = 0; i < M; i++) { graph[R[i][0]].push_back({R[i][1], L[i]}); graph[R[i][1]].push_back({R[i][0], L[i]}); } int degree[N]; queue<int> Q; vector<pair<int, int>> mini(N, {1e9, 1e9}); for (int i = 0; i < K; i++){ degree[P[i]] = 2; Q.push(P[i]); mini[P[i]] = {0, 0}; } while (!Q.empty()){ int v = Q.front(); Q.pop(); for (auto i: graph[v]){ degree[i.F]++; if (mini[v].S + i.S < mini[i.F].F) mini[i.F].S = mini[i.F].F, mini[i.F].F = mini[v].S + i.S; else if (mini[v].S + i.S < mini[i.F].S) mini[i.F].S = mini[v].S + i.S; if (degree[i.F] == 2) Q.push(i.F); } } return mini[0].S; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...