Submission #420656

#TimeUsernameProblemLanguageResultExecution timeMemory
420656Return_0Bridges (APIO19_bridges)C++17
73 / 100
3054 ms152256 KiB
#pragma GCC optimize("Ofast,unroll-loops") // #pragma comment(linker, "/stack:200000000") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef int ll; typedef long double ld; typedef pair <ll, ll> pll; #ifdef SINA #define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); } #define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush(); #else #define dbg(...) 0 #define dbg2(x, j, n) 0 #endif #define SZ(x) ((ll)((x).size())) #define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout); #define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i]; #define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n'); #define kill(x) return cout<< (x) << endl, 0 #define cl const ll #define fr first #define sc second #define lc (v << 1) #define rc (lc | 1) #define mid ((l + r) >> 1) #define All(x) (x).begin(), (x).end() cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353; template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';} template <class A> ostream& operator << (ostream& out, const vector<A> &a) { out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; } template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>; cl N = 50'003, M = 100'003, SQ = 1022; ll V [M], U [M], W [M], T [M], X [M], Y [M], ans [M], par [N], sz [N], n, m, q, lst; vector <ll> query, upd, nupd, vec [M]; vector <ll> his; bool mark [M]; inline ll root (ll v) { for (; par[v]; v = par[v]); return v; } inline bool unite (ll v, ll u) { v = root(v); u = root(u); if (v == u) return false; if (sz[v] < sz[u]) swap(v, u); par[u] = v; sz[v] += sz[u]; his.push_back(u); return true; } inline void undo (ll x) { for (; x--; his.pop_back()) { ll &v = his.back(); sz[par[v]] -= sz[v]; par[v] = 0; } } int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>> n >> m; for (ll i = 1; i <= m; i++) cin>> V[i] >> U[i] >> W[i]; cin>> q; for (ll i = 1; i <= q; i++) cin>> T[i] >> X [i] >> Y [i]; for (ll l = 1, r; l <= q; l += SQ) { memset(par, 0, sizeof par); fill(sz, sz + N, 1); query.clear(); upd.clear(); nupd.clear(); his.clear(); r = min(l + SQ, q + 1); for (ll i = l; i < r; i++) { if (T[i] == 1) { mark[X[i]] = 1; upd.push_back(X[i]); } else query.push_back(i); } for (ll i = 1; i <= m; i++) { if (!mark[i]) nupd.push_back(i); else mark[i] = false; } for (ll i = l; i < r; i++) { if (T[i] == 1) W[X[i]] = Y[i]; else for (auto &id : upd) if (W[id] >= Y[i]) vec[i].push_back(id); } sort(All(query), [&](cl &i, cl &j) { return Y[i] > Y[j]; }); sort(All(nupd), [&](cl &i, cl &j) { return W[i] > W[j]; }); lst = 0; for (auto &id : query) { for (; lst < SZ(nupd) && W[nupd[lst]] >= Y[id]; lst++) unite(V[nupd[lst]], U[nupd[lst]]); ll sv = SZ(his); for (auto &e : vec[id]) unite(V[e], U[e]); ans[id] = sz[root(X[id])]; undo(SZ(his) - sv); } } for (ll i = 1; i <= q; i++) if (T[i] == 2) cout<< ans[i] << '\n'; cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; return 0; } /* 3 4 1 2 5 2 3 2 3 1 4 2 3 8 5 2 1 5 1 4 1 2 2 5 1 1 1 2 3 2 7 8 1 2 5 1 6 5 2 3 5 2 7 5 3 4 5 4 5 5 5 6 5 6 7 5 12 2 1 6 1 1 1 2 1 2 1 2 3 2 2 2 1 5 2 1 3 1 2 2 4 2 4 2 1 8 1 2 1 1 2 1 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...