Submission #962049

#	Time	Username	Problem	Language	Result	Execution time	Memory
962049		Amr	다리 (APIO19_bridges)	C++17	16 / 100	667 ms	8784 KiB

bridges

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=3e5+7;
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}
ll seg[N*2];
ll a[N];
ll siz= 1;
ll n , m, q;
ll get(ll l ,ll r , ll x = 0, ll lx = 0, ll rx = siz)
{
    if(l==r) return 0;
    if(lx>=r||rx<=l) return 1e18;
    if(lx>=l&&rx<=r) return seg[x];
    ll mid = (lx+rx)/2;
    ll s1 = get(l,r,2*x+1,lx,mid);
    ll s2 = get(l,r,2*x+2,mid,rx);
    return min(s1,s2);
}
void update(ll in, ll val, ll x  =0, ll lx = 0, ll rx = siz)
{
    if(rx-lx==1)
    {
        seg[x] = val;
        return;
    }
    ll mid = (lx+rx)/2;
    if(in<mid) update(in,val,2*x+1,lx,mid);
    else update(in,val,2*x+2,mid,rx);
    seg[x] = min(seg[2*x+1],seg[2*x+2]);
}
void build(ll x =0, ll lx = 0, ll rx = siz)
{
    if(rx-lx==1)
    {
        seg[x] = a[lx];
        return;
    }
    ll mid = (lx+rx)/2;
    build(2*x+1,lx,mid);
    build(2*x+2,mid,rx);
    seg[x] = min(seg[2*x+1],seg[2*x+2]);
}
void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        ll x, y; cin >> x >> x >> y;
        a[i] = y;
    }
    siz = 1;
    while(siz<=n) siz*=2;
    build();
    ll q; cin >> q;
    while(q--)
    {
        ll tp, x , y; cin >> tp >> x >> y;
        if(tp==1)
        {
            a[x] = y;
            update(x,y);
        }
        else
        {
            ll st = x,  w = y;
            ll l = st, r = n+1;
            while(l+1<r)
            {
                ll mid = (l+r)/2;
                if(get(st,mid)>=w) l = mid;
                else r = mid;
            }
            ll r2 = l;
            l = 0, r = st;
            while(l+1<r)
            {
                ll mid = (l+r)/2;
                if(get(mid,st)>=w) r = mid;
                else l = mid;
            }
            ll r1 = r;
            cout << r2-r1+1<< endl;
        }
    }
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("friday.out","w",stdout);
    fast;
    while(TT--)
        solve();

    return 0;
}

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