제출 #744622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744622		shadow_sami	다리 (APIO19_bridges)	C++17	0 / 100	3038 ms	524288 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<ll, null_type,less_equal< ll >, 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 = 2e5+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;
ordered_set arr[mx];
vector<pi> adj[mx];
ll val[mx];
ll parent[mx];
ll con[mx];
ll par_val[mx];

void dfs(ll u,ll par){
	fx(adj[u]){
		if(x.ff!=par){
			parent[x.ff] = u;
			dfs(x.ff,u);
			arr[u].insert(val[x.ss]);
			par_val[x.ff] = val[x.ss];
			for(auto Y : arr[x.ff]){
				arr[u].insert(min(val[x.ss],Y));
			}
		}
	}
	return;
}

void remove(ll u,ll val){
	debug(u);
	debug(val);
	if(u==0)return;	
	arr[u].erase(arr[u].lower_bound(val-1));
	remove(parent[u],min(par_val[u],val));
	return;
}

void add(ll u,ll val){
	if(u==0)return;
	arr[u].insert(val);
	add(parent[u],min(par_val[u],val));
	return;
}

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;
        int sr,de;
        parent[1] = 0;
        fip(1,m+1){
        	cin>>sr>>de>>tp;
        	adj[sr].push_back({de,i});
        	adj[de].push_back({sr,i});
        	con[i] = de;
        	val[i] = tp;
        }
        dfs(1,-1);
        // fip(1,n+1)	{
        // 	fx(arr[i])
        // 		cout<<x<<" ";
        // 		cout<<nli;
        // }
        // fip(1,m+1){
        // 	cout<<con[i]<< " ";
        // }
        // cout<<nli;
        int q;
        cin>>q;
        while(q--){
        	cin>>tp;
        	if(tp==1){
        		cin>>sr>>de;
        		val[sr] = de;
        		remove(parent[con[sr]],par_val[con[sr]]);
        		add(parent[con[sr]],de);
        	}
        	else{
        		cin>>sr>>de;
        		while(sr != 1 && par_val[sr]>=de){
        			sr = parent[sr];
        		}

        		ans = arr[sr].order_of_key(mod) - arr[sr].order_of_key(de);
        		ans ++;
        		cout<<ans<<nli;
        	}
        }     
        // fip(1,n+1)	{
        // 	fx(arr[i])
        // 		cout<<x<<" ";
        // 	cout<<nli;
        // }   
        // cout<<"ok";
        
    // 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: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27