Submission #1150263

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1150263	2025-02-14 10:02:23	abczz	Bridges (APIO19_bridges)	C++20	13 / 100	2251 ms	589824 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 <iostream>
#include <array>
#include <algorithm>
#include <cmath>
#define ll int
using namespace std;
array<ll, 3> A[100005];
vector <array<ll, 4>> Q;
vector <ll> U[100005];
ll n, m, q, a, b, c, t, rtq, P[100005], F[100005];
struct DSU{
  vector <ll> G, gsz;
  vector <array<ll, 4>> T;
  void init(ll sz) {
    G.resize(sz);
    gsz.resize(sz);
    for (int i=0; i<sz; ++i) G[i] = i, gsz[i] = 1;
  }
  ll dsu(ll u) {
    if (G[u] == u) return u;
    else return dsu(G[u]);
  }
  ll query(ll u) {
    return gsz[dsu(u)];
  }
  void merge(ll a, ll b) {
    ll u = dsu(a);
    ll v = dsu(b);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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