제출 #599151

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599151		M_W	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3038 ms	13508 KiB

sortbooks

#include <bits/stdc++.h>
#define ii pair<int, int>
using namespace std;
int t[1000001 << 2];
int a[1000001];

void build(int v, int l, int r){
    if(l == r){
        t[v] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(v * 2, l, mid); build(v * 2 + 1, mid + 1, r);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
}

int query(int v, int tl, int tr, int l, int r){
    if(l > r) return -1;
    if(tl == l && tr == r) return t[v];
    int tm = (tl + tr) >> 1;
    return max(query(v * 2, tl, tm, l, min(r, tm)), query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
}

int main(){
    int N, M;
    scanf("%d %d", &N, &M);
    for(int i = 1; i <= N; i++){
        scanf("%d", &a[i]);
    }
    build(1, 1, N);
    while(M--){
        int a, b, k;
        scanf("%d %d %d", &a, &b, &k);
        int l = a, r = b;
        while(l < r){
            int mid = (l + r) >> 1;
            int ll = query(1, 1, N, l, mid), rr = query(1, 1, N, mid + 1, r);
            if(ll <= rr) l = mid + 1;
            else r = mid;
        }
        int ll = query(1, 1, N, a, l), rr = query(1, 1, N, l + 1, b);
        if(ll + rr > k) printf("0\n");
        else printf("1\n");
    }
}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d %d", &N, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sortbooks.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         scanf("%d %d %d", &a, &b, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23