제출 #1131148

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131148		Nonoze	Bridges (APIO19_bridges)	C++20	0 / 100	3095 ms	15512 KiB

bridges

/*
*	Author: Nonoze
*	Created: Tuesday 31/12/2024
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef IN_LOCAL
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}


vector<int> par, sz, pastpar, pastsz;
vector<int> modified;

int getparbase(int x) {
	if (x==par[x]) return x;
	return par[x]=getparbase(par[x]);
}

int getpar(int x) {
	if (x==par[x]) return x;
	return getpar(par[x]);
}

void unitebase(int a, int b) {
	a=getparbase(a), b=getparbase(b);
	if (a==b) return;
	if (sz[a]<sz[b]) swap(a, b);
	sz[a]+=sz[b], par[b]=a;
}


void unite(int a, int b) {
	a=getpar(a), b=getpar(b);
	if (a==b) return;
	if (sz[a]<sz[b]) swap(a, b);
	if (pastpar[a]==-1) pastpar[a]=par[a], pastsz[a]=sz[a], modified.pb(a);
	if (pastpar[b]==-1) pastpar[b]=par[b], pastsz[b]=sz[b], modified.pb(b);
	sz[a]+=sz[b], par[b]=a;
}


int n, k, m, q;


void solve() {
	read(n, m);
	vector<vector<int>> base;
	for (int i=0; i<m; i++) {
		int u, v, w; read(u, v, w); u--, v--;
		base.pb({w, u, v});
	}
	read(q); const int SQRT=sqrt(q);
	vector<vector<int>> queries;
	int act=0;
	for (int t=1; t<=q; t++) {
		int o, x, y; cin >> o >> x >> y;
		queries.pb({o, x-1, y});
		if (o==2) queries.back().push_back(act++);
		if (t%SQRT==0 || t==q) {
			par.clear(), sz.clear(); par.resize(n), sz.resize(n, 1); iota(all(par), 0);
			pastpar.clear(), pastpar.resize(n, -1), pastsz.clear(), pastsz.resize(n, -1);
			vector<bool> can(m, 1);
			for (auto u: queries) if (u[0]==1) can[u[1]]=0;

			vector<vector<int>> bridges;
			for (int i=0; i<m; i++) if (can[i]) bridges.pb(base[i]);
			sort(all(bridges));
			vector<vector<int>> que;
			for (int i=0; i<sz(queries); i++) {
				if (queries[i][0]==2) que.pb({queries[i][2], queries[i][1], i, queries[i][3]});
			}
			sort(rall(que));
			vector<int> ans(act);
			vector<int> modif(m); for (int i=0; i<m; i++) modif[i]=base[i][0];
			for (auto query: que) {
				int w=query[0], s=query[1], i=query[3];
				while (!bridges.empty() && bridges.back()[0]>=w) unitebase(bridges.back()[1], bridges.back()[2]), bridges.pop_back();
				modified.clear();
				for (int j=0; j<query[2]; j++) {
					if (queries[j][0]==1) modif[queries[j][1]]=queries[j][2];
				}
				for (int j=0; j<sz(queries); j++) {
					if (queries[j][0]==1 && modif[queries[j][1]]>=w) unite(base[queries[j][1]][1], base[queries[j][1]][2]);
				}
				ans[i]=sz[getpar(s)];
				for (auto u: modified) par[u]=pastpar[u], sz[u]=pastsz[u], pastpar[u]=-1, pastsz[u]=-1;
			}

			for (auto u: ans) cout << u << endl;


			for (auto &u: queries) if (u[0]==1) base[u[1]][0]=u[2];
			queries.clear(), act=0;
		}
	}
}

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