답안 #38734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38734 2018-01-06T10:51:25 Z daniel_02 원숭이와 사과 나무 (IZhO12_apple) C++14
100 / 100
536 ms 122328 KB
#include <bits/stdc++.h>

#define ll long long
#define OK cout << "OK" << endl;

using namespace std;

const int N = 7e6 + 7e5;
const int inf = 1e9 + 7;

struct node
{
    int sum, l, r,add;
    node()
    {
        sum = l = r = add = 0;
    }
}t[N];

int m;
int cnt = 2,c;
int ty, l, r;

void push (int v,int tl,int tr) {
    if (t[v].add != 0) {
        if (!t[v].l)
            t[v].l = cnt ++;
        if  (!t[v].r)
            t[v].r = cnt ++;

        t[t[v].l].add = 1;
        t[t[v].r].add = 1;
        t[v].sum = (tr - tl + 1);
        t[v].add = 0;
    }
}
void update(int v, int tl, int tr, int l, int r)
{
    if (tl > tr || tr < l || tl > r)
        return;

    push (v, tl, tr);

    if (tl >= l && r >= tr)
    {
        t[v].add = 1;
    }
    else
    {
        int mid = (tl + tr) >> 1;

        if (!t[v].l)
        {
            t[v].l = cnt++;
        }
        update(t[v].l, tl, mid, l, r);

        if (!t[v].r)
        {
            t[v].r = cnt++;
        }
        update(t[v].r, mid + 1, tr, l, r);

        push (v, tl, tr);
        push (t[v].l, tl, mid);
        push (t[v].r, mid + 1, tr);

        t[v].sum = t[t[v].l].sum + t[t[v].r].sum;
    }
}
int get(int v, int tl, int tr, int l, int r)
{
    if (tl > tr || tl > r || l > tr)
        return 0;

    push (v, tl, tr);

    if (tl >= l && r >= tr)
    {
        return t[v].sum;
    }
    else
    {
        int mid = (tl + tr) >> 1;

        int s1 = 0, s2 = 0;

        if (t[v].l)
        {
            s1 = get(t[v].l, tl, mid, l, r);
        }
        if (t[v].r)
        {
            s2 = get(t[v].r, mid + 1, tr, l, r);
        }

        return (s1 + s2);
    }
}
main()
{
    scanf ("%d", &m);

    while (m--)
    {
        scanf("%d", &ty);
        scanf("%d%d", &l, &r);

        l += c;
        r += c;

        if (ty == 1)
        {
            c = get(1, 1, inf, l, r);
            printf("%d\n", c);
        }
        else
        {
            update(1, 1, inf, l, r);
        }
    }
}


Compilation message

apple.cpp:100:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
apple.cpp: In function 'int main()':
apple.cpp:102:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d", &m);
                     ^
apple.cpp:106:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &ty);
                         ^
apple.cpp:107:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &l, &r);
                              ^
# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 122328 KB Output is correct
2 Correct 23 ms 122328 KB Output is correct
3 Correct 16 ms 122328 KB Output is correct
4 Correct 39 ms 122328 KB Output is correct
5 Correct 43 ms 122328 KB Output is correct
6 Correct 46 ms 122328 KB Output is correct
7 Correct 49 ms 122328 KB Output is correct
8 Correct 229 ms 122328 KB Output is correct
9 Correct 436 ms 122328 KB Output is correct
10 Correct 436 ms 122328 KB Output is correct
11 Correct 419 ms 122328 KB Output is correct
12 Correct 466 ms 122328 KB Output is correct
13 Correct 383 ms 122328 KB Output is correct
14 Correct 359 ms 122328 KB Output is correct
15 Correct 536 ms 122328 KB Output is correct
16 Correct 493 ms 122328 KB Output is correct
17 Correct 333 ms 122328 KB Output is correct
18 Correct 346 ms 122328 KB Output is correct
19 Correct 536 ms 122328 KB Output is correct
20 Correct 516 ms 122328 KB Output is correct