提出 #62116381

---

ソースコード 拡げる

// LUOGU_RID: 200588712
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10,maxq = 3e5 + 10,maxm = 5e5 + 10;
int n,m,q;
int L[maxn],R[maxn];
int p[maxq];
int res[maxm];
int min_val[maxm << 2],max_val[maxm << 2],tag[maxm << 2];

void pushdown(int i){
    tag[i * 2] += tag[i]; tag[i * 2 + 1] += tag[i];
    min_val[i * 2] += tag[i]; min_val[i * 2 + 1] += tag[i];
    max_val[i * 2] += tag[i]; max_val[i * 2 + 1] += tag[i];
    tag[i] = 0;
}

void pushup(int i){
    min_val[i] = min_val[i * 2];
    max_val[i] = max_val[i * 2 + 1];
}

void build(int i,int l,int r){
    if(l == r){
        min_val[i] = l; max_val[i] = r;
        return;
    }
    int mid = (l + r) / 2;
    build(i * 2,l,mid);
    build(i * 2 + 1,mid + 1,r);
    pushup(i);
}

int find_min(int i,int l,int r,int x){
    if(l == r)  return l;
    if(tag[i] > 0)  pushdown(i);
    int mid = (l + r) / 2;
    if(max_val[i * 2] >= x) return find_min(i * 2,l,mid,x);
    else if(max_val[i * 2 + 1] >= x)    return find_min(i * 2 + 1,mid + 1,r,x);
    else    return -1; 
}

int find_max(int i,int l,int r,int x){
    if(l == r)  return l;
    if(tag[i] > 0)  pushdown(i);
    int mid = (l + r) / 2;
    if(min_val[i * 2 + 1] <= x) return find_max(i * 2 + 1,mid + 1,r,x);
    else if(min_val[i * 2] <= x)   return find_max(i * 2,l,mid,x);
    else    return -1;
}

void update(int i,int l,int r,int fl,int fr){
    if(fl <= l && r <= fr){
        tag[i] ++;
        min_val[i] ++; max_val[i] ++;
        return;
    }
    if(tag[i] > 0)  pushdown(i);
    int mid = (l + r) / 2;
    if(fl <= mid)   update(i * 2,l,mid,fl,fr);
    if(mid < fr)    update(i * 2 + 1,mid + 1,r,fl,fr);
    pushup(i);
}

void _export(int i,int l,int r){
    if(l == r){
        res[l] = min_val[i];
        return;
    }
    if(tag[i] > 0)  pushdown(i);
    int mid = (l + r) / 2;
    _export(i * 2,l,mid);
    _export(i * 2 + 1,mid + 1,r);
}

int main(){
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++){
        scanf("%d %d",&L[i],&R[i]);
    }
    scanf("%d",&q);
    for(int i = 1;i <= q;i ++){
        scanf("%d",&p[i]);
        m = max(m,p[i]);
    }
    build(1,1,m);
    for(int i = 1;i <= n;i ++){
        int fl = find_min(1,1,m,L[i]),fr = find_max(1,1,m,R[i]);
        if(fl > 0 && fr > 0)    update(1,1,m,fl,fr);
    }
    _export(1,1,m);
    for(int i = 1;i <= q;i ++){
        printf("%d\n",res[p[i]]);
    }
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:77:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   77 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:79:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   79 |         scanf("%d %d",&L[i],&R[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp:81:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   81 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
Main.cpp:83:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   83 |         scanf("%d",&p[i]);
      |         ~~~~~^~~~~~~~~~~~

ジャッジ結果