| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 741751 | shadow_sami | Bridges (APIO19_bridges) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 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];
typedef struct SEGMENT_TREE{
vi arr;
ll range;
void init(ll k){
range = log2(k);
range = 1 << (range + 3);
arr.resize(range);
return;
}
ll construct(ll ptr,ll l,ll r){
if(l==r){
arr[ptr] = val[l];
return arr[ptr];
}
ll mid = l + (r-l)/2;
arr[ptr] = min(construct(2*ptr,l,mid),construct(2*ptr+1,mid+1,r));
return arr[ptr];
}
ll query(ll ptr,ll l,ll r,ll st,ll en){
if(l>en || r<st)
return 1e9;
if(l>=st && r<=en)
return arr[ptr];
ll mid = l + (r-l) / 2;
return min(query(2*ptr,l,mid,st,en),query(2*ptr+1,mid+1,r,st,en));
}
ll update(ll ptr,ll l,ll r,ll pos,ll value){
if(l==r && l==pos){
val[l] = value;
arr[ptr] = value;
return arr[ptr];
}
if(l > pos || r<pos)
return arr[ptr];
ll mid = l + (r-l) / 2;
arr[ptr] = min(update(2*ptr,l,mid,pos,value),update(2*ptr+1,mid+1,r,pos,value));
return arr[ptr];
}
void debugg(ll ptr,ll l,ll r){
cout<<l<< " "<<r<<" "<<arr[ptr]<<nli;
if(l==r)
return;
ll mid = l + (r-l) / 2;
debugg(2*ptr,l,mid);
debugg(2*ptr+1,mid+1,r);
}
}SGT;
SGT sgt;
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;
val[i] = wet;
}
sgt.init(m);
sgt.construct(1,0,m-1);
// sgt.debugg(1,0,m-1);
// cout<<sgt.query(1,0,m-1,1,2)<<nli;
cin>>q;
while(q--){
cin>>tp;
ll l,r,mid,pt;
if(tp==1){
cin>>sr>>de;
sr--;
sgt.update(1,0,m-1,sr,de);
}
else{
cin>>sr>>de;
cnt = 0;
if(sr>1){
sr-=2;
ans = -1;
l = 0;
r = sr;
while(l<=r){
mid = l + (r-l)/2;
pt = sgt.query(1,0,m-1,mid,sr);
// cout<<l<<" "<<r<<" "<<mid<<" "<<pt<<nli;
if(pt>=de){
ans = mid;
r = mid - 1;
}else
l = mid + 1;
}
if(ans!=-1){
cnt += sr-ans+1;
}
sr+=2;
}
if(sr<n){
sr--;
ans = -1;
l = sr;
r = m-1;
while(l<=r){
mid = l + (r-l)/2;
pt = sgt.query(1,0,m-1,sr,mid);
// cout<<l<<" "<<r<<" "<<mid<<" "<<pt<<nli;
if(pt>=de){
ans = mid;
l = mid + 1;
}else
r = mid - 1;
}
if(ans!=-1){
cnt += ans-sr+1;
}
// debug(ans);
sr++;
}
cnt++;
cout<<cnt<<nli;
}
}
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}