# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019212 | Kodik | Commuter Pass (JOI18_commuter_pass) | C++17 | 2043 ms | 262144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ss second
#define ff first
typedef long long ll;
// #define int ll
int mod = 1e9+7;
// int inf = 1e18;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ifstream cin ("shortcut.in");
// ofstream cout ("shortcut.out");
int n, m, s, t, u, v;
cin >> n >> m >> s >> t >> u >> v;
--s; --t; --u; --v;
vector<pair<int,int>> adj[n];
for(int i = 0; i < m; ++i){
int a,b,c;
cin >> a >> b >> c;
--a; --b;
adj[a].push_back({c,b});
adj[b].push_back({c,a});
}
vector<int> dis(n, 1e9);
dis[s] = 0;
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
vector<int> par[n], chi[n];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |