oj.uz

Submission #143932

# Submission time Handle Problem Language Result Execution time Memory
143932 2019-08-15T13:13:32 Z WhipppedCream Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 222 ms 13116 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 476 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 372 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 412 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 10320 KB Output is correct
2 Correct 194 ms 11012 KB Output is correct
3 Correct 198 ms 11444 KB Output is correct
4 Correct 194 ms 10868 KB Output is correct
5 Correct 184 ms 12044 KB Output is correct
6 Correct 153 ms 11088 KB Output is correct
7 Correct 151 ms 11000 KB Output is correct
8 Correct 195 ms 11832 KB Output is correct
9 Correct 204 ms 12152 KB Output is correct
10 Correct 202 ms 10852 KB Output is correct
11 Correct 150 ms 10964 KB Output is correct
12 Correct 149 ms 11680 KB Output is correct
13 Correct 165 ms 11916 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 476 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 372 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 412 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 196 ms 10320 KB Output is correct
23 Correct 194 ms 11012 KB Output is correct
24 Correct 198 ms 11444 KB Output is correct
25 Correct 194 ms 10868 KB Output is correct
26 Correct 184 ms 12044 KB Output is correct
27 Correct 153 ms 11088 KB Output is correct
28 Correct 151 ms 11000 KB Output is correct
29 Correct 195 ms 11832 KB Output is correct
30 Correct 204 ms 12152 KB Output is correct
31 Correct 202 ms 10852 KB Output is correct
32 Correct 150 ms 10964 KB Output is correct
33 Correct 149 ms 11680 KB Output is correct
34 Correct 165 ms 11916 KB Output is correct
35 Correct 214 ms 10460 KB Output is correct
36 Correct 216 ms 11784 KB Output is correct
37 Correct 212 ms 12716 KB Output is correct
38 Correct 204 ms 12428 KB Output is correct
39 Correct 202 ms 12400 KB Output is correct
40 Correct 208 ms 12508 KB Output is correct
41 Correct 204 ms 12228 KB Output is correct
42 Correct 204 ms 12400 KB Output is correct
43 Correct 198 ms 11636 KB Output is correct
44 Correct 222 ms 12060 KB Output is correct
45 Correct 189 ms 12088 KB Output is correct
46 Correct 222 ms 13116 KB Output is correct
47 Correct 154 ms 11684 KB Output is correct
48 Correct 163 ms 11716 KB Output is correct
49 Correct 177 ms 10720 KB Output is correct
50 Correct 142 ms 11448 KB Output is correct
51 Correct 145 ms 11848 KB Output is correct
52 Correct 153 ms 11768 KB Output is correct