# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798570 | gg123_pe | Bridges (APIO19_bridges) | C++14 | 425 ms | 21564 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 f(i,a,b) for(int i = a; i < b; i++)
#define fa(i,a,b) for(int i = a; i >= b; i--)
const int N = 50005, inf = 2e9;
int n, m;
int ans;
int U[N], V[N], W[N];
bool vis[N];
vector <pair<int,int>> adj[N];
vector <pair<int, pair<int,int>>> edges;
void clear(){
ans = 0;
f(i,1,n+1) vis[i] = 0, adj[i].clear();
}
void add(){
f(i,1,m+1){
adj[U[i]].push_back({V[i], W[i]});
adj[V[i]].push_back({U[i], W[i]});
}
}
void dfs(int u, int wa){
ans++;
vis[u] = 1;
for(auto p: adj[u]){
int v = p.first, w = p.second;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |