# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918917 | vjudge1 | Deda (COCI17_deda) | C++17 | 177 ms | 50680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, q, T[N], idx1[N], idx2[N];
vector<int> v[N];
void build(int l, int r, int k){
// cout << k << ' ' << l << ' ' << r << '\n';
if(l == r){
idx1[k] = l, idx2[k] = r;
T[k] = MOD;
return;
}
int m = l+r>>1;
build(l, m, k<<1);
build(m+1, r, k<<1|1);
T[k] = MOD;
idx1[k] = l, idx2[k] = r;
}
void upd(int l, int r, int p, int k, int val){
if(l == r){
T[k] = val;
return;
}
int m = l+r>>1;
if(p <= m) upd(l, m, p, k<<1, val);
else upd(m+1, r, p, k<<1|1, val);
T[k] = min(T[k<<1], T[k<<1|1]);
}
int get2(int l, int r, int k, int val){
if(l == r) return l;
int m = l+r>>1;
if(T[k<<1] <= val) return get2(l, m, k<<1, val);
return get2(m+1, r, k<<1|1, val);
}
int get(int p, int val){
for(auto &idx: v[p]){
// cout << idx
if(T[idx] <= val){
return get2(idx1[idx], idx2[idx], idx, val);
}
}
return -1;
}
void s(int l, int r, int p, int k){
if(l == r){
v[p].pb(k);
return;
}
int m = l+r>>1;
if(p <= m){
v[p].pb(k<<1|1);
s(l, m, p, k<<1);
}else s(m+1, r, p, k<<1|1);
}
void solve(){
cin >> n >> q;
build(1, n, 1);
for(int i = 1; i <= n; ++i){
s(1, n, i, 1);
// cout << i << ":\n";
// for(int j : v[i]) cout << j << ' ';
// en;
sort(all(v[i]), [&](const int &x, const int &y){
return idx1[x] < idx1[y];
});
}
for(int i = 0; i < q; ++i){
char c; cin >> c;
if(c == 'M'){
int X, A; cin >> X >> A;
upd(1, n, A, 1, X);
}else{
int B, Y; cin >> Y >> B;
cout << get(B, Y) << '\n';
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int tt = 1, aa;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
while(tt--){
solve();
en;
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |