# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541385 | _karan_gandhi | Commuter Pass (JOI18_commuter_pass) | C++17 | 113 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.
// subtask 2
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long
ll int inf = 1e16;
void solve() {
int n, m; cin >> n >> m;
int s, t; cin >> s >> t;
int U, V; cin >> U >> V;
s--; t--; U--; V--;
vector<vector<pair<int, ll int>>> adj(n);
vector<vector<ll int>> wt(n, vector<ll int>(n, inf));
for (int i = 0; i < m; i++) {
int a, b; ll int c; cin >> a >> b >> c;
a--; b--;
wt[a][b] = c;
wt[b][a] = c;
adj[a].emplace_back(b, c);
adj[b].emplace_back(a, c);
}
# | 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... |