oj.uz

답안 #232858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232858 2020-05-18T11:56:22 Z nicolaalexandra Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 865 ms 11684 KB 
#include <bits/stdc++.h>
#define DIM 200010
using namespace std;
long long aib[DIM],v[DIM];
int n,q,x,y,i;
long long s,t,val;
void update (int p, long long val){
    for (;p<=n;p+=(p&-p))
        aib[p] += val;
}
long long query (int p){
    if (p <= 0)
        return 0;
    long long sol = 0;
    for (;p;p-=(p&-p))
        sol += aib[p];
    return sol;
}

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>q>>s>>t;
    long long sum = 0;
    for (i=0;i<=n;i++){
        cin>>v[i];
        if (!i)
            continue;
        if (v[i-1] < v[i])
            sum -= s * (v[i] - v[i-1]);
        else sum += t * (v[i-1] - v[i]);

        update (i,v[i]);
        update (i+1,-v[i]);
    }

    for (;q--;){
        cin>>x>>y>>val;

        long long nr = query (x-1), nr2 = query (x);
        if (nr < nr2)
            sum += s * (nr2 - nr);
        else sum -= t * (nr - nr2);


        nr = query (y), nr2 = query (y+1);

        if (y < n){
            if (nr < nr2)
                sum += s * (nr2 - nr);
            else sum -= t * (nr - nr2);
        }

        update (x,val);
        update (y+1,-val);


        nr = query (x-1), nr2 = query (x);
        if (nr < nr2)
            sum -= s * (nr2 - nr);
        else sum += t * (nr - nr2);


        nr = query (y), nr2 = query (y+1);

        if (y < n){
            if (nr < nr2)
                sum -= s * (nr2 - nr);
            else sum += t * (nr - nr2);
        }

        cout<<sum<<"\n";
    }


    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 12 ms 512 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 16 ms 384 KB Output is correct
10 Correct 12 ms 512 KB Output is correct
11 Correct 12 ms 384 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 12 ms 384 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 819 ms 5044 KB Output is correct
2 Correct 820 ms 5676 KB Output is correct
3 Correct 821 ms 6136 KB Output is correct
4 Correct 819 ms 9080 KB Output is correct
5 Correct 840 ms 10516 KB Output is correct
6 Correct 755 ms 10620 KB Output is correct
7 Correct 763 ms 10488 KB Output is correct
8 Correct 837 ms 10324 KB Output is correct
9 Correct 838 ms 10744 KB Output is correct
10 Correct 826 ms 9464 KB Output is correct
11 Correct 752 ms 10392 KB Output is correct
12 Correct 755 ms 10716 KB Output is correct
13 Correct 743 ms 11384 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 384 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 12 ms 512 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 16 ms 384 KB Output is correct
10 Correct 12 ms 512 KB Output is correct
11 Correct 12 ms 384 KB Output is correct
12 Correct 13 ms 384 KB Output is correct
13 Correct 12 ms 384 KB Output is correct
14 Correct 12 ms 512 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 819 ms 5044 KB Output is correct
23 Correct 820 ms 5676 KB Output is correct
24 Correct 821 ms 6136 KB Output is correct
25 Correct 819 ms 9080 KB Output is correct
26 Correct 840 ms 10516 KB Output is correct
27 Correct 755 ms 10620 KB Output is correct
28 Correct 763 ms 10488 KB Output is correct
29 Correct 837 ms 10324 KB Output is correct
30 Correct 838 ms 10744 KB Output is correct
31 Correct 826 ms 9464 KB Output is correct
32 Correct 752 ms 10392 KB Output is correct
33 Correct 755 ms 10716 KB Output is correct
34 Correct 743 ms 11384 KB Output is correct
35 Correct 809 ms 9080 KB Output is correct
36 Correct 823 ms 10368 KB Output is correct
37 Correct 815 ms 11436 KB Output is correct
38 Correct 822 ms 11000 KB Output is correct
39 Correct 815 ms 11120 KB Output is correct
40 Correct 828 ms 11000 KB Output is correct
41 Correct 815 ms 10872 KB Output is correct
42 Correct 822 ms 11000 KB Output is correct
43 Correct 812 ms 10232 KB Output is correct
44 Correct 807 ms 10744 KB Output is correct
45 Correct 828 ms 10616 KB Output is correct
46 Correct 865 ms 11684 KB Output is correct
47 Correct 751 ms 11184 KB Output is correct
48 Correct 750 ms 11436 KB Output is correct
49 Correct 757 ms 10360 KB Output is correct
50 Correct 740 ms 11128 KB Output is correct
51 Correct 776 ms 10988 KB Output is correct
52 Correct 751 ms 11384 KB Output is correct