oj.uz

Submission #116644

# Submission time Handle Problem Language Result Execution time Memory
116644 2019-06-13T10:00:16 Z roseanne_pcy Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 203 ms 13048 KB 
//I don't want a lot for Christmas
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
const int maxn = 2e5+5;
ll ft[maxn];
int n;
ll a[maxn];
void update(int x, int dx)
{
    for(; x<= n; x+=x&(-x)) ft[x] += dx;
}
ll sum(int x)
{
    ll res = 0;
    for(; x; x -= x&(-x)) res += ft[x];
    return res;
}
ll ask(int a, int b)
{
    return sum(a);
}
void add(int a, int b, int dx)
{
    update(a, dx);
    update(b+1, -dx);
}
int main()
{
    //#ifndef atom freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif
    int q, s, t; scanf("%d %d %d %d", &n, &q, &s, &t);
    for(int i = 0; i<= n; i++) scanf("%lld", a+i);
    ll now = 0;
    for(int i = 0; i+1<= n; i++)
    {
        int dx = abs(a[i]-a[i+1]);
        if(a[i]< a[i+1])
        {
            now -= 1LL*s*dx;
        }
        else now += 1LL*t*dx;
    }
    for(int i = 1; i<= n; i++)
    {
        add(i, i, (int)a[i]);
    }
    while(q--)
    {
        //printf("%d\n", q);
        int L, R, x; scanf("%d %d %d", &L, &R, &x);
        ll aL = ask(L-1, L-1);
        ll aLp = ask(L, L);
        //printf("*%d %d\n", aL, aLp);
        ll dx = abs(aL-aLp);
        if(aL< aLp) now += 1LL*s*dx;
        else now -= 1LL*t*dx;
        aLp += x;
        dx = abs(aL-aLp);
        if(aL< aLp) now -= 1LL*s*dx;
        else now += 1LL*t*dx;
        //printf("temp %lld\n", now);
        if(R == n)
        {
            add(L, R, x);
            printf("%lld\n", now);
            continue;
        }
        aL = ask(R, R);
        aLp = ask(R+1, R+1);
        //printf("**%d %d\n", aL, aLp);
        dx = abs(aL-aLp);
        if(aL< aLp) now += 1LL*s*dx;
        else now -= 1LL*t*dx;
        aL += x;
        dx = abs(aL-aLp);
        if(aL< aLp) now -= 1LL*s*dx;
        else now += 1LL*t*dx;
        add(L, R, x);
        printf("%lld\n", now);
    }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:40:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int q, s, t; scanf("%d %d %d %d", &n, &q, &s, &t);
                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:41:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i<= n; i++) scanf("%lld", a+i);
                                ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:59:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int L, R, x; scanf("%d %d %d", &L, &R, &x);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 10316 KB Output is correct
2 Correct 177 ms 10864 KB Output is correct
3 Correct 169 ms 11400 KB Output is correct
4 Correct 154 ms 10864 KB Output is correct
5 Correct 181 ms 11988 KB Output is correct
6 Correct 133 ms 11052 KB Output is correct
7 Correct 132 ms 10920 KB Output is correct
8 Correct 182 ms 11760 KB Output is correct
9 Correct 164 ms 12204 KB Output is correct
10 Correct 174 ms 11056 KB Output is correct
11 Correct 121 ms 10872 KB Output is correct
12 Correct 122 ms 11640 KB Output is correct
13 Correct 120 ms 11768 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 173 ms 10316 KB Output is correct
23 Correct 177 ms 10864 KB Output is correct
24 Correct 169 ms 11400 KB Output is correct
25 Correct 154 ms 10864 KB Output is correct
26 Correct 181 ms 11988 KB Output is correct
27 Correct 133 ms 11052 KB Output is correct
28 Correct 132 ms 10920 KB Output is correct
29 Correct 182 ms 11760 KB Output is correct
30 Correct 164 ms 12204 KB Output is correct
31 Correct 174 ms 11056 KB Output is correct
32 Correct 121 ms 10872 KB Output is correct
33 Correct 122 ms 11640 KB Output is correct
34 Correct 120 ms 11768 KB Output is correct
35 Correct 161 ms 10360 KB Output is correct
36 Correct 182 ms 11908 KB Output is correct
37 Correct 186 ms 12624 KB Output is correct
38 Correct 203 ms 12500 KB Output is correct
39 Correct 201 ms 12544 KB Output is correct
40 Correct 179 ms 12408 KB Output is correct
41 Correct 179 ms 12284 KB Output is correct
42 Correct 188 ms 12424 KB Output is correct
43 Correct 182 ms 11768 KB Output is correct
44 Correct 187 ms 12152 KB Output is correct
45 Correct 170 ms 12088 KB Output is correct
46 Correct 170 ms 13048 KB Output is correct
47 Correct 133 ms 11640 KB Output is correct
48 Correct 138 ms 11640 KB Output is correct
49 Correct 160 ms 10616 KB Output is correct
50 Correct 121 ms 11512 KB Output is correct
51 Correct 123 ms 11856 KB Output is correct
52 Correct 125 ms 11640 KB Output is correct