# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
649648 | RealSnake | Commuter Pass (JOI18_commuter_pass) | C++17 | 277 ms | 18668 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"
#define ll long long
using namespace std;
int par[100005];
ll dist[100005];
vector<pair<int, ll>> node[100005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, s, t, u, v;
cin >> n >> m >> s >> t >> u >> v;
for(int i = 0; i < m; i++) {
int a, b;
ll c;
cin >> a >> b >> c;
node[a].push_back({b, c});
node[b].push_back({a, c});
}
set<pair<ll, int>> ss;
ss.insert({0, t});
// subtask 1 and 2
bool b[n + 1] = {};
b[v] = 1;
for(int i = 1; i <= n; i++)
dist[i] = 1e18;
# | 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... |