oj.uz

답안 #156685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156685 2019-10-06T20:38:43 Z tpoppo Deda (COCI17_deda) C++14
140 / 140
 139 ms 3424 KB 
 #include<bits/stdc++.h>

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define all(a) a.begin(),a.end()
#define endl '\n'
#define y1 y123132
#define sqr(a) ((a)*(a))

using namespace std;

const int N=200001;
const int md=1e9+7;
const int inf=1e9+3;

int n,q,sz;
int d[N*4];

void update(int v,int x)
{
    v+=sz-1;
    d[v]=x;
    v/=2;
    while(v)
    {
        d[v]=min(d[v+v],d[v+v+1]);
        v/=2;
    }
}

char c;
int x,y;

int get_first(int v, int lv, int rv, int l, int r, int x) {
    if(lv > r || rv < l) return -1;
    if(l <= lv && rv <= r) {
        if(d[v] > x) return -1;
        while(lv != rv) {
            int mid = lv + (rv-lv)/2;
            if(d[2*v] > x) {
                v = 2*v+1;
                lv = mid+1;
            }else {
                v = 2*v;
                rv = mid;
            }
        }
        return lv;
    }

    int mid = lv + (rv-lv)/2;
    int rs = get_first(2*v, lv, mid, l, r, x);
    if(rs != -1) return rs;
    return get_first(2*v+1, mid+1, rv, l ,r, x);
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>q;
    sz=1;
    while(sz<n)sz*=2;
    for(int i=1;i<=sz*2;++i)d[i]=inf;

    for(int i=1;i<=q;++i)
    {
        cin>>c;
        cin>>y>>x;
        if(c=='M')update(x,y);
        else
        {
            cout<<get_first(1,1,sz,x,n,y)<<endl;
        }
    }

}

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 139 ms 3420 KB Output is correct
5 Correct 110 ms 2168 KB Output is correct
6 Correct 120 ms 3344 KB Output is correct
7 Correct 126 ms 3424 KB Output is correct