[ create a new paste ] login | about

Link: http://codepad.org/0LePV2tI    [ raw code | output | fork ]

C++, pasted on May 8: 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

#include <bits/stdc++.h>

using namespace std;
typedef long long int i64;
#define M 100009

i64 ara[M];
i64 tree[3*M]={0};
i64 lazy[3*M]={0};

void built_tree(i64 node, i64 a, i64 b)
{
    if (a>b)
        return;
    if (a==b){
        tree[node]=ara[a];
        return;
    }
    built_tree(2*node, a, (a+b)/2);
    built_tree(2*node+1, 1+(a+b)/2, b);
    tree[node]=tree[2*node]+tree[2*node+1];
}
void update_tree(i64 node, i64 a, i64 b, i64 i, i64 j, i64 value)
{

    if (lazy[node]!=0){
        tree[node]+=(b-a+1)*lazy[node];
        if (a!=b){
            lazy[2*node]+=lazy[node];
            lazy[2*node+1]+=lazy[node];
        }
        lazy[node]=0;
    }

    if (a>=i && b<=j){
        tree[node]+=(b-a+1)*value;
        if (a!=b){
            lazy[2*node]+=value;
            lazy[2*node+1]+=value;
        }
        return;
    }
    if (a>b || a>j || b<i)
        return;

    int mid=(a+b)/2;
    update_tree(2*node, a, mid, i, j, value);
    update_tree(2*node+1, mid+1, b, i, j, value);
    tree[node]=tree[2*node]+tree[2*node+1];
}
int query_tree(i64 node, i64 a, i64 b, i64 i, i64 j)
{
    if (lazy[node]!=0){
        tree[node]+=(b-a+1)*lazy[node];
        if (a!=b){
            lazy[2*node]+=lazy[node];
            lazy[2*node+1]+=lazy[node];
        }
        lazy[node]=0;
    }

    if (a>=i && b<=j)
        return tree[node];

    if (a>b || a>j || b<i)
        return 0;

    int mid=(a+b)/2;
    i64 q1=query_tree(2*node, a, mid, i, j);
    i64 q2=query_tree(2*node+1, mid+1, b, i, j);
    return q1+q2;
}
int main ()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    i64 T, n, c, i, j, ck, p, q, v, mx;
    scanf ("%lld", &T);
    while (T--){
        scanf ("%lld%lld", &n, &c);
        memset(ara, 0, n);
        memset(lazy, 0, 3*n);
        built_tree(1, 0, n-1);
        for (i=0; i<c; i++){
            scanf("%lld", &ck);
            if (ck==0){
                scanf ("%lld%lld%lld", &p, &q, &v);
                update_tree(1, 0, n-1, p-1, q-1, v);
            }
            else {
                scanf ("%lld%lld", &p, &q);
                mx=query_tree(1, 0, n-1, p-1, q-1);
                printf ("%lld\n", mx);
            }
        }

    }
    return 0;
}


Output: 
1
2
3

Line 24: error: bits/stdc++.h: No such file or directory
Line 4: error: ISO C++ does not support 'long long'
compilation terminated due to -Wfatal-errors.


Create a new paste based on this one


Comments: