oj.uz

Submission #929043

# Submission time Handle Problem Language Result Execution time Memory
929043 2024-02-17T14:34:38 Z NourWael Deda (COCI17_deda) C++17
20 / 140
 76 ms 13836 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std; 
int const mxN = 2e5+5;
int n,q, seg[8*mxN], a[8*mxN];

int get ( int node, int l_n, int r_n, int l, int r, int v) {
   if(seg[node]>v) return 1e17;
   if(l_n==r_n-1) return l_n;
   int m = (l_n+r_n)/2;
   if(seg[node*2+1]<=v && m>l) return get(node*2+1, l_n, m, l, r, v );
   else if(seg[node*2+2]<=v && r>m) return get(node*2+2, m, r_n, l, r, v );
   else return 1e17;
}

void update(int node, int l, int r, int x, int v ) {
   if(l==r-1) { seg[node] = v; return; }
   int m = (l+r)/2;
   if(x<m) update(node*2+1, l, m, x, v);
   else update(node*2+2, m, r, x, v);
   seg[node] = min(seg[node*2+1], seg[node*2+2]);
}

signed main() {
  
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);

  cin>>n>>q;
  int pw = (1<<(__lg(n)+1));
  for(int i=0; i<8*mxN; i++) seg[i] = 1e17;
  
  for(int i=0; i<q; i++) {
   char c; cin>>c;
   if(c=='M') {
       int x,a; cin>>x>>a;
       update(0,0,pw,a,x);
   }
   else  {
      int rides,b; cin>>rides>>b;
      int ans = get(0,0,pw,b,n+1, rides);
      cout<<(ans==1e17? -1:ans)<<'\n';
   }
  }
  return 0;
}

Subtask #1
20.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Incorrect 3 ms 12888 KB Output isn't correct
3 Incorrect 3 ms 12892 KB Output isn't correct
4 Incorrect 60 ms 13836 KB Output isn't correct
5 Incorrect 70 ms 13512 KB Output isn't correct
6 Incorrect 64 ms 13472 KB Output isn't correct
7 Incorrect 76 ms 13652 KB Output isn't correct