Submission #1130967

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130967		Nonoze	Bridges (APIO19_bridges)	C++20	13 / 100	3094 ms	21524 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;
}



int n, k, m, Q;
vector<multiset<pair<int, int>>> adj;


void solve() {
	read(n, m);
	adj.resize(n);
	vector<vector<int>> bridges;
	for (int i=0; i<m; i++) {
		int u, v, w; read(u, v, w); u--, v--;
		adj[u].insert({v, w}), adj[v].insert({u, w});
		bridges.pb({u, v, w});
	}
	read(Q);
	while (Q--) {
		int o; cin >> o;
		if (o==1) {
			int b, r; cin >> b >> r; b--;
			int u=bridges[b][0], v=bridges[b][1], w=bridges[b][2];
			adj[u].extract({v, w}), adj[v].extract({u, w});
			adj[u].insert({v, r}), adj[v].insert({u, r});
			bridges[b][2]=r;
		} else {
			int s, weight; cin >> s >> weight; s--;
			vector<bool> visited(n, 0);
			queue<int> q; q.push(s);
			int ans=0;
			while (!q.empty()) {
				int u=q.front(); q.pop();
				if (visited[u]) continue;
				visited[u]=1, ans++;
				for (auto [v, w]: adj[u]) {
					if (w>=weight) q.push(v);
				}
			}
			cout << ans << endl;
		}
	}
}

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