# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161620 | AlgorithmWarrior | Bridges (APIO19_bridges) | C++20 | 3031 ms | 22616 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=2e5+5;
int const SQRT=316;
int n,m;
struct EDGE{
int u,v;
}edge[MAX];
int cost[MAX];
int q;
struct QUERY{
int type,loc,w,ans;
}query[MAX];
void read(){
cin>>n>>m;
int i;
for(i=1;i<=m;++i)
cin>>edge[i].u>>edge[i].v>>cost[i];
cin>>q;
for(i=1;i<=q;++i)
cin>>query[i].type>>query[i].loc>>query[i].w;
}
void normalize(){
map<int,int>mep;
int i;
for(i=1;i<=m;++i)
# | 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... |