제출 #940832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940832		shadow_sami	다리 (APIO19_bridges)	C++17	100 / 100	2806 ms	169188 KiB

bridges

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
const ll blk = 450;

typedef struct Disjoint_Set_Union_Dynamic{
	vi par;
	vi sz;
	ll src,dest;
	vi lis;
	ll range;
	ll id;
	void init(ll k){
		range = k + 5;
		par.resize(range);
		sz.resize(range);
		fip(1,n+1){
			par[i] = i;
			sz[i] = 1;
		}
		return;
	}
	ll find(ll k){
		while(par[k]!=k)
			k = par[k];
		return k;
	}
	bool unite(ll u,ll v){
		src = find(u);
		dest = find(v);
		if(src==dest)
			return 0;
		if(sz[src]<sz[dest])
			swap(src,dest);
		par[dest] = src;
		sz[src] += sz[dest];
		lis.push_back(dest);
		return 1;
	}
	ll get(){
		return (ll)lis.size();
	}
	void rollback(ll k){
		while((ll)lis.size()>k){
			id = lis.back();
			sz[par[id]] -= sz[id];
			par[id] = id;
			lis.pop_back();
		}
		return;
	}
}DSU;

ll sr[mx];
ll de[mx];
ll we[mx];
ll pt[mx];
ll u[mx];
ll v[mx];
ll w[mx];
bool mark[mx];
ll na[mx];
vi lit[mx];
ll ptr = 0;

DSU dsu;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        fip(0,m)
        	cin>>sr[i]>>de[i]>>we[i];
        cin>>tp;
        fip(0,tp){
        	cin>>u[i]>>v[i]>>w[i];
        	if(u[i]==1)
        		v[i]--;
        }
        ll l,r;
        vi query,edge,vv;
        fip(0,tp){
        	l = i;
        	r = min(tp,i+blk);
        	query.clear();
        	edge.clear();
        	vv.clear();
        	fjp(0,m)
        		mark[j] = 0;
        	fjp(l,r){
        		if(u[j]==1){
        			mark[v[j]] = 1;
        		}
        	}
        	fjp(0,m){
        		if(!mark[j])
        			edge.push_back(j);
        		else
        			vv.push_back(j);
        	}
        	fjp(l,r){
        		if(u[j]==2){
        			query.push_back(j);
        			lit[j-l].clear();
        			fx(vv)
        				if(we[x]>=w[j])
        					lit[j-l].push_back(x);
        		}else{
        			we[v[j]] = w[j];
        		}
        	}
        	sort(query.begin(),query.end(),[](const ll aa,const ll bb){
        		return w[aa] > w[bb];
        	});
        	sort(edge.begin(),edge.end(),[](const ll aa,const ll bb){
        		return we[aa] > we[bb];
        	});
        	ptr = 0;
        	dsu.init(n);
        	fx(query){
        		while(ptr<(ll)edge.size() && we[edge[ptr]]>=w[x]){
        			tp2 = edge[ptr];
        			dsu.unite(sr[tp2],de[tp2]);
        			ptr++;
        		}
        		res = dsu.get();
        		for(auto y: lit[x-l])
        			dsu.unite(sr[y],de[y]);
        		na[x] = dsu.sz[dsu.find(v[x])];
        		dsu.rollback(res);        		
        	}
        	i += (blk-1);
        }
        fip(0,tp){
        	if(u[i]==1)
        		continue;
        	cout<<na[i]<<nli;
        }

    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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