# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176573 | lechaa | Commuter Pass (JOI18_commuter_pass) | C++20 | 444 ms | 60008 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<vector<int>> p;
vector<bool> j;
map<pair<int, int>, bool> b;
void dfs(int k){
j[k] = true;
for(int i = 0; i < p[k].size(); i++){
b[{p[k][i], k}] = true;
if(j[p[k][i]]) continue;
dfs(p[k][i]);
}
}
main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m; cin >> n >> m;
int s, t; cin >> s >> t;
int u, v; cin >> u >> v;
j.resize(n+1);
vector<vector<pair<int, int>>> g(n+1);
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
int c; cin >> c;
g[a].push_back({b, c});
g[b].push_back({a, c});
}
Compilation message (stderr)
# | 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... |