Submission #1158592

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1158592	2025-02-27 09:10:53	byunjaewoo	Bridges (APIO19_bridges)	C++20	0 / 100	3092 ms	14012 KiB

bridges

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=100010, sqrtN=300;
int n, m, q, u[N], v[N], w[N], g[N], ans[N];
bool chk[N];
vector<array<int, 3>> vec, vec2;
vector<int> vec3;
array<int, 3> x[N];
vector<pair<int, int>> rol;
void Rollback(int c) {
    while(c--) g[rol.back().first]=rol.back().second, rol.pop_back();
}
int Find(int x) {return (g[x]>=0)?Find(g[x]):x;}
void Union(int u, int v) {
    u=Find(u), v=Find(v);
    if(g[u]<g[v]) swap(u, v);
    rol.push_back({u, g[u]}), rol.push_back({v, g[v]});
    if(u!=v) g[v]+=g[u], g[u]=v;
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for(int i=1; i<=m; i++) cin>>u[i]>>v[i]>>w[i];
    cin>>q;
    for(int i=1; i<=q; i++) cin>>x[i][0]>>x[i][1]>>x[i][2];
    fill(g+1, g+n+1, -1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27