Submission #741738

#	Time	Username	Problem	Language	Result	Execution time	Memory
741738		shadow_sami	Bridges (APIO19_bridges)	C++17	14 / 100	87 ms	13316 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 = 1e5+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;
vector<pi> adj[mx];
ll sr,de,wet,q;
ll val[mx];
ll na[mx];
bool vis[mx];

typedef struct EDGE{
	ll src,dest,weigt;
	void init(ll a,ll b,ll c){
		src = a;
		dest =b;
		weigt = c;
		return;
	}
}edge;

vector<edge> ve;
edge ee;

typedef struct QUERY{
	ll src,idx,weigt;
	void init(ll a,ll b,ll c){
		src = a;
		idx = b;
		weigt = c;
		return;
	}
}query;

vector<query> vq;
query qq;

typedef struct Disjoint_Set_Union{
	ll parent[mx];
	ll siz[mx],src,dest;
	void init(ll k){
		fip(0,k+2){
			parent[i]=i;
			siz[i] = 1;
		}
		return;
	}
	ll find(ll k){
		return parent[k] == k ? k : parent[k] = find(parent[k]);
	}
	bool unite(ll sr,ll de){
		src = find(sr);
		dest = find(de);
		if(src==dest)
			return 0;
		if(siz[src] < siz[dest])
			swap(src,dest);
		siz[src] += siz[dest];
		parent[dest] = src;
		return 1;
	}
}DSU;

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,n+2)
        	adj[i].clear();
        fip(0,m){
        	cin>>sr>>de>>wet;
        	ee.init(sr,de,wet);
        	ve.push_back(ee);
        }
        cin>>q;
        fip(0,q){
        	cin>>sr>>de>>wet;
        	qq.init(de,i,wet);
        	vq.push_back(qq);
        }
        sort(vq.begin(),vq.end(),[](const query &aa,const query &bb){
        	return aa.weigt > bb.weigt;
        });
        sort(ve.begin(),ve.end(),[](const edge &aa,const edge &bb){
        	return aa.weigt > bb.weigt;
        });
        dsu.init(n);
        ll ptr,ptr2;
        ptr = 0,ptr2 = 0;
        while(ptr2<q){
        	while(ptr < m && ve[ptr].weigt >= vq[ptr2].weigt){
        		// cout<<ptr2<<nli;
        		// cout<<ve[ptr].src<<" "<<ve[ptr].dest<<nli;
        		dsu.unite(ve[ptr].src,ve[ptr].dest);
        		ptr++;
        	}
        	// cout<<vq[ptr2].src<<nli;
        	// cout<<"ii " <<vq[ptr2].idx<<nli;
        	na[vq[ptr2].idx] = dsu.siz[dsu.find(vq[ptr2].src)];
        	ptr2++;
        }
        fip(0,q)
        	cout<<na[i]<<nli;

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

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