# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167673 | Knight | Commuter Pass (JOI18_commuter_pass) | C++20 | 3 ms | 5704 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
long long ds[100001], dt[100001], du[100001], dv[100001], l, a;
int main() {
ifstream cin("in.in");
ios_base::sync_with_stdio(0);cin.tie(0);
int n, m, s, u, t, v, x, y;
vector<pair<int, long long>> g[100001];
priority_queue<pair<long long, int>> q;
fill(ds, ds+100001, LLONG_MAX);
fill(du, du+100001, LLONG_MAX);
fill(dt, dt+100001, LLONG_MAX);
fill(dv, dv+100001, LLONG_MAX);
cin >> n >> m;
cin >> s >> t >> u >> v;
for(int i=1;i<=m;i++){
cin >> x >> y >> l;
g[x].push_back({y, l});
g[y].push_back({x, l});
}
ds[s] = 0;
q.push({0, s});
while(!q.empty()){
# | 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... |