oj.uz

답안 #464053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464053 2021-08-12T10:11:58 Z cinnabar233 Deda (COCI17_deda) C++14
60 / 140
 1000 ms 4444 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<stack>
#include<map>
#include<iomanip>
#include<math.h>
#include<queue>
#include<cmath>
#include<complex.h>
#include<deque>
using namespace std;
#define pb push_back
#define ll long long int
# define pll pair<ll,ll>
# define pii pair<int,int>
#define sec second
#define ft first
#define mp make_pair
#define fio ios_base::sync_with_stdio(false)
int n, q ;
int a[200009];
int t[800009];
void update(int v , int l , int r , int pos , int val )
{
   if(l == r)
   {
       t[v] = val ;
       return  ;
   }
    int mid = (l+r)/2;
    if(mid < pos) update(2*v+1,mid+1,r,pos,val);
    else update(2*v,l,mid,pos,val);
    t[v] = min(t[2*v],t[2*v+1]);
}

int get(int v , int l , int r , int tl , int tr)
{
    //cout << l << " " << r << tl << " " << tr << "\n";
    if(tl > tr) return 1e9+1 ;
    if(l == tl and r == tr) return t[v];
    int mid = (l+r)/2;
    return min(get(2*v,l,mid,tl,min(mid,tr)),get(2*v+1,mid+1,r,max(tl,mid+1),tr));
}
int main()
{
    fio;
    cin >> n >> q ;
    for(int i  = 1 ; i <= 4*n ; i++) t[i] = 1e9+1 ;
   while(q--)
   {
       char c ;
       int x , y ;
       cin >> c >> x >> y;
       if(c == 'M') update(1,1,n,y,x);
       else
       {
        int  l = y , r = n ;
        //cout << l << " " << r << "\n";
        while(l < r)
        {
               //cout << l << " " << r << "\n";
               int mid = (l+r)/2;
               if(get(1,1,n,y,mid) <= x) r = mid;
               else l = mid+1 ;
        }
        if(get(1,1,n,y,r) <= x or y > n) cout <<r << "\n";
        else cout << "-1\n";
       }
   }
}

Subtask #1
60.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 15 ms 356 KB Output is correct
4 Execution timed out 1095 ms 4184 KB Time limit exceeded
5 Execution timed out 1037 ms 2520 KB Time limit exceeded
6 Execution timed out 1096 ms 3624 KB Time limit exceeded
7 Execution timed out 1096 ms 4444 KB Time limit exceeded