Submission #860502

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
860502	2023-10-13T07:07:43 Z	VicBVic	Deda (COCI17_deda)	C++17	0 / 140	78 ms	5856 KB

deda

#include <bits/stdc++.h>
using namespace std;

const int MN= 5e5+5;
const int MV= 19+5;
int arb[MN*4];
int v[MN];
int n,m;

int cmp(int a, int b)
{
    return v[a]<=v[b]?a:b;
}

void update(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        //cerr<<"here "<<nod<<','<<poz<<' '<<dr<<'\n';
        v[poz]=val;
        arb[nod]=poz;
        return;
    }
    
    int mid=(st+dr)/2;
    if(poz<=mid) update(nod*2, st, mid, poz, val);
    else update(nod*2+1, mid+1, dr, poz, val);
    
    arb[nod]=cmp(arb[nod*2], arb[nod*2+1]);
}

int query(int nod, int st, int dr, int qst, int val)
{
    if(dr<qst) return dr+1;
    
    if(qst<=st && v[arb[nod]]<=val)
    {
        return st;
    }
    
    if(qst<=st && v[arb[nod]]>val)
    {
        return dr+1;
    }
    
    int mid=(st+dr)/2;
    int st_cb=query(nod*2, st, mid, qst, val);
    if(st_cb!=mid+1)
    {
        return st_cb;
    }
    return query(nod*2+1, mid+1, dr, qst, val);
}

void printArb()
{
    int p=1;
    for(int i=1;i<=4*n;i++)
    {
        cerr<<arb[i]<<' ';
        if(p==i)
        {
            cerr<<'\n';
            p=p<<1^1;
        }
    }
}

int main()
{
    ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    v[0]=MV;
    
    
    
    cin>>n>>m;
    
    char c; int b,y;
    for(int i=1;i<=m;i++)
    {
        cin>>c>>y>>b;
        if(c=='M')
        {
            //cerr<<"poz "<<b<<" val "<<y<<'\n';
            update(1,1,n,b,y);
        }
        else
        {
            int ans=query(1,1,n,b,y);
            cout<<(ans==n+1?-1:ans)<<'\n';
        }
        //printArb();
    }

    return 0;
}
/*
10 10
M 20 10
D 1 9
M 2 3
D 17 10
M 20 2
D 8 2
M 40 1
D 25 2
M 33 9
D 37 9
*/

Subtask #1

0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2396 KB	Output isn't correct
2	Incorrect	1 ms	2396 KB	Output isn't correct
3	Incorrect	2 ms	2396 KB	Output isn't correct
4	Incorrect	78 ms	5856 KB	Output isn't correct
5	Incorrect	66 ms	5420 KB	Output isn't correct
6	Incorrect	66 ms	5456 KB	Output isn't correct
7	Incorrect	69 ms	5712 KB	Output isn't correct