Submission #409386

#	Time	Username	Problem	Language	Result	Execution time	Memory
409386		Blistering_Barnacles	Bridges (APIO19_bridges)	C++11	0 / 100	1097 ms	524292 KiB

bridges

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , vis[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vector < pair < pll , ll > > adj[555555];
const ll mod = 1e9+7;
str s;
pll pr[555555] ;
ll tree[555555] ;
void build(ll s,  ll e , ll node){
    if(s == e){
        tree[node] = a[s] ;
        R ;
    }
    build(s , md , lx) , build(md + 1 , e , rx) ;
    tree[node] = min(tree[lx] , tree[rx]) ;
}
void update(ll s , ll e , ll node , ll idx , ll val){
    if(s > idx || e < idx)R ;
    if(s == e){
        tree[node] = val ;
        R ;
    }
    update(s , md , lx , idx , val) , update(md + 1 , e , rx , idx , val) ;
    tree[node] = min(tree[lx] , tree[rx]) ;
}
ll query(ll s , ll e , ll node , ll l , ll r){
    if(s > r || e < l)R 1e15 ;
    if(l <= s && e <= r)R tree[node] ;
    R min(query(s , md , lx , l , r) , query(md + 1 , e , rx , l , r)) ;
}
void solve(){
    cin >> n >> m ;
    for(ll i = 1 ; i <= m ; i++){
        cin >> o >> p >> a[i] ;
    }
    build(1 , m , 1 ) ;
    ll cnt = 0 ;
    cin >> cnt ;
    while(cnt--){
        cin >> k ;
        if(k == 1){
            cin >> o >> p ;
            update(1 , m , 1 , o , p) ;
        }
        else {
            cin >> o >> p ;
            ll l = 0 , r = o ;
            while(r - l > 1){
                if(query(1 , m , 1 , mid , o - 1) >= p)r = mid ;
                else l = mid ;
            }
            ll o1 = r ;
            l = o , r = n + 1 ;
            while(r - l > 1){
                if(query(1 , m , 1 , o , mid - 1) >= p)l = mid ;
                else r = mid ;
            }
            cout << l - o1 + 1 << endl ;
        }
    }
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

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