제출 #89809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89809		Vardanyan	원숭이와 사과 나무 (IZhO12_apple)	C++14	100 / 100	570 ms	133340 KiB

apple

#include <bits/stdc++.h>
using namespace std;
struct node{
    int val,lz;
};
const int N = 1000*1000+5;
node t[10*N];
int son1[10*N];
int son2[10*N];
int timer = 1;
void push(int v,int s,int e){
    if(t[v].lz!=0){
        t[v].val = (e-s+1)*(t[v].lz);
        if(s!=e){
            if(son1[v] == 0){
                son1[v] = ++timer;
                son2[v] = ++timer;
            }
            t[son1[v]].lz = 1;
            t[son2[v]].lz = 1;
              //  t[son1[v]]->lz = t[v].lz;
                //t[v].r->lz = t[v].lz;
        }
    }
    t[v].lz = 0;
}
void update(int v,int s,int e,int l,int r,int val){
    push(v,s,e);
    if(l>r) return;
    if(s == l && e == r){
        t[v].lz = val;
        return;
    }
    int m = (s+e)/2;
    if(son1[v] == 0){
        son1[v] = ++timer;
        son2[v] = ++timer;
    }
    update(son1[v],s,m,l,min(m,r),val);
    update(son2[v],m+1,e,max(l,m+1),r,val);
    push(son1[v],s,m);
    push(son2[v],m+1,e);
    t[v].val = t[son1[v]].val+t[son2[v]].val;
}
int get(int v,int s,int e,int l,int r){
    push(v,s,e);
    if(l>r) return 0;
    if(s == l && e == r) return t[v].val;
    int m = (s+e)/2;
    return get(son1[v],s,m,l,min(m,r))+
           get(son2[v],m+1,e,max(l,m+1),r);
}
int main(){

    int m;
    scanf("%d",&m);
    int C = 0;
    while(m--){
        int d,x,y;
        scanf("%d%d%d",&d,&x,&y);
        if(d == 1){
            int ans = get(1,1,1000*1000*1000,x+C,y+C);
            C = ans;
            printf("%d\n",ans);
        }
        else{
            update(1,1,1000*1000*1000,x+C,y+C,1);
        }
    }

    return 0;
}

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

apple.cpp: In function 'int main()':
apple.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&m);
     ~~~~~^~~~~~~~~
apple.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&d,&x,&y);
         ~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100