답안 #860097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860097	2023-10-11T16:01:28 Z	pctirziu	Deda (COCI17_deda)	C++17	0 / 140	392 ms	6172 KB

deda

#include <iostream>

using namespace std;

const int nmax = 3e5 + 5;
const int valmax = 2e9 + 5;
int aint[nmax * 4];

void update(int node, int st, int dr, int l, int r, int val)
{
    if(st > r or dr < l)
        return ;
    if(st == dr){
        aint[node] = val;
        return;
    }
    int mid = (st + dr) / 2;
    update(node * 2, st, mid, l, r, val);
    update(node * 2 + 1, mid + 1, dr, l, r, val);
    aint[node] = min(aint[2 * node], aint[2 * node + 1]);
}

int query(int node, int st, int dr, int l, int r, int val)
{
    if(st > r or dr < l)
        return -1;
    if(l <= st and dr <= r){
        if(aint[node] > val)
            return -1;
        if(st == dr and aint[node] <= val)
            return st;
        int rasp;
        while(st != dr){
            int mid = (st + dr) / 2;
            if(aint[2 * node] <= val){
                dr = mid;
                rasp = mid;
                node = node * 2;
            }
            else{
                st = mid + 1;
                node = node * 2 + 1;
            }
        }
        return rasp;
    }
    int mid = (st + dr) / 2;
    int rasp = query(node * 2, st, mid, l, r, val);
    if(rasp != -1)
        return rasp;
    return query(node * 2 + 1, mid + 1, dr, l, r, val);
}

int main()
{
    int n, q;
    cin >> n >> q;
    for(int i = 0; i <= 4 * nmax - 5; i++)
        aint[i] = valmax;
    while(q--){
        string s;
        cin >> s;
        if(s == "M"){
            int x, y;
            cin >> x >> y;
            update(1, 1, n, y, y, x);
        }
        else{
            int x, y;
            cin >> x >> y;
            cout << query(1, 1, n, y, n, x) << "\n";
        }
    }
}

Compilation message

deda.cpp: In function 'int query(int, int, int, int, int, int)':
deda.cpp:32:13: warning: 'rasp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   32 |         int rasp;
      |             ^~~~

Subtask #1

0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	4964 KB	Output isn't correct
2	Incorrect	3 ms	4956 KB	Output isn't correct
3	Incorrect	9 ms	4956 KB	Output isn't correct
4	Incorrect	392 ms	6008 KB	Output isn't correct
5	Incorrect	322 ms	5732 KB	Output isn't correct
6	Incorrect	386 ms	6004 KB	Output isn't correct
7	Incorrect	359 ms	6172 KB	Output isn't correct