oj.uz

Submission #57884

# Submission time Handle Problem Language Result Execution time Memory
57884 2018-07-16T13:27:37 Z jorik Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 313 ms 26336 KB 
#include <bits/stdc++.h>

using namespace std;

//int dirs[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//int dirs[8][2]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};

vector<long long> ft;

void single_update(int start, long long val)
{
    for(int i=start; i<ft.size(); i+=i&(-i))
    {
        ft[i]+=val;
    }
}

void update(int from, int to, long long val)
{
    single_update(from,val);
    single_update(to+1,-val);
}

long long get_val(int start)
{
    long long ret=0;
    for(int i=start; i>0; i-=i&(-i)) ret += ft[i];
    return ret;
}

long long s, t;

long long trans(long long val1, long long val2)
{
    if(val2>val1) return -abs(val1-val2)*s;
    return abs(val1-val2)*t;
}

int main()
{
    //freopen("inp.in", "r", stdin);
    //freopen("outp.out", "w", stdout);
    //ios::sync_with_stdio(false);
    int n, q;
    scanf("%d %d %lld %lld", &n, &q, &s, &t);
    n=n+1;
    vector<long long> heights(n);
    for(int i=0; i<n; i++) scanf("%lld", &heights[i]);
    ft.assign(n+1,0);
    for(int i=1; i<=n; i++) update(i,i,heights[i-1]);
    /*for(int i=1; i<=n; i++)
    {
        cerr << "ft[" << i << "]: " << ft[i] << endl;
    }*/
    long long ans=0;
    for(int i=1; i<n; i++)
    {
        ans += trans(heights[i-1],heights[i]);
    }
    //cerr << "ans: " << ans << endl;
    for(int query_no=1; query_no<=q; query_no++)
    {
        int from, to;
        long long by;
        scanf("%d %d %lld", &from, &to, &by);
        //from--;
        //to--;
        if(from-1>=0) ans -= trans(get_val(from), get_val(from+1));
        //if(query_no==1) cerr << "hier1: " << ans << endl;
        if(to+1<n) ans -= trans(get_val(to+1),get_val(to+2));
        //if(query_no==1) cerr << "hier2: " << ans << endl;
        //cerr << get_val(2) << " " << get_val(3) << endl;
        //cerr << from+1 << " " << to+1 << endl;
        update(from+1,to+1,by);
        /*for(int i=1; i<=n; i++)
        {
            cerr << "ft[" << i << "]: " << ft[i] << endl;
        }*/
        //cerr << get_val(2) << " " << get_val(3) << endl;
        if(from-1>=0) ans += trans(get_val(from), get_val(from+1));
        //if(query_no==1) cerr << "hier3: " << ans << endl;
        //cerr << to+1 << " " << to+2 << endl;
        if(to+1<n) ans += trans(get_val(to+1),get_val(to+2));
        //if(query_no==1) cerr << "hier4: " << ans << endl;
        printf("%lld\n", ans);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void single_update(int, long long int)':
foehn_phenomena.cpp:12:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=start; i<ft.size(); i+=i&(-i))
                      ~^~~~~~~~~~
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %lld %lld", &n, &q, &s, &t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:48:33: 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", &heights[i]);
                            ~~~~~^~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld", &from, &to, &by);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 4 ms 584 KB Output is correct
3 Correct 4 ms 648 KB Output is correct
4 Correct 4 ms 764 KB Output is correct
5 Correct 5 ms 764 KB Output is correct
6 Correct 4 ms 932 KB Output is correct
7 Correct 5 ms 1000 KB Output is correct
8 Correct 4 ms 1000 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 6 ms 1164 KB Output is correct
13 Correct 5 ms 1220 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 4 ms 1312 KB Output is correct
16 Correct 4 ms 1548 KB Output is correct
17 Correct 5 ms 1548 KB Output is correct
18 Correct 3 ms 1548 KB Output is correct
19 Correct 3 ms 1548 KB Output is correct
20 Correct 2 ms 1548 KB Output is correct
21 Correct 3 ms 1556 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 11436 KB Output is correct
2 Correct 281 ms 17484 KB Output is correct
3 Correct 313 ms 23548 KB Output is correct
4 Correct 263 ms 24440 KB Output is correct
5 Correct 217 ms 25248 KB Output is correct
6 Correct 172 ms 25576 KB Output is correct
7 Correct 157 ms 25576 KB Output is correct
8 Correct 247 ms 25576 KB Output is correct
9 Correct 207 ms 25816 KB Output is correct
10 Correct 208 ms 25816 KB Output is correct
11 Correct 137 ms 25816 KB Output is correct
12 Correct 276 ms 25944 KB Output is correct
13 Correct 166 ms 26328 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 4 ms 584 KB Output is correct
3 Correct 4 ms 648 KB Output is correct
4 Correct 4 ms 764 KB Output is correct
5 Correct 5 ms 764 KB Output is correct
6 Correct 4 ms 932 KB Output is correct
7 Correct 5 ms 1000 KB Output is correct
8 Correct 4 ms 1000 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 6 ms 1164 KB Output is correct
13 Correct 5 ms 1220 KB Output is correct
14 Correct 5 ms 1260 KB Output is correct
15 Correct 4 ms 1312 KB Output is correct
16 Correct 4 ms 1548 KB Output is correct
17 Correct 5 ms 1548 KB Output is correct
18 Correct 3 ms 1548 KB Output is correct
19 Correct 3 ms 1548 KB Output is correct
20 Correct 2 ms 1548 KB Output is correct
21 Correct 3 ms 1556 KB Output is correct
22 Correct 278 ms 11436 KB Output is correct
23 Correct 281 ms 17484 KB Output is correct
24 Correct 313 ms 23548 KB Output is correct
25 Correct 263 ms 24440 KB Output is correct
26 Correct 217 ms 25248 KB Output is correct
27 Correct 172 ms 25576 KB Output is correct
28 Correct 157 ms 25576 KB Output is correct
29 Correct 247 ms 25576 KB Output is correct
30 Correct 207 ms 25816 KB Output is correct
31 Correct 208 ms 25816 KB Output is correct
32 Correct 137 ms 25816 KB Output is correct
33 Correct 276 ms 25944 KB Output is correct
34 Correct 166 ms 26328 KB Output is correct
35 Correct 253 ms 26328 KB Output is correct
36 Correct 288 ms 26328 KB Output is correct
37 Correct 293 ms 26328 KB Output is correct
38 Correct 278 ms 26328 KB Output is correct
39 Correct 226 ms 26328 KB Output is correct
40 Correct 252 ms 26328 KB Output is correct
41 Correct 244 ms 26328 KB Output is correct
42 Correct 227 ms 26328 KB Output is correct
43 Correct 223 ms 26328 KB Output is correct
44 Correct 237 ms 26328 KB Output is correct
45 Correct 240 ms 26328 KB Output is correct
46 Correct 301 ms 26328 KB Output is correct
47 Correct 197 ms 26328 KB Output is correct
48 Correct 179 ms 26336 KB Output is correct
49 Correct 243 ms 26336 KB Output is correct
50 Correct 141 ms 26336 KB Output is correct
51 Correct 249 ms 26336 KB Output is correct
52 Correct 162 ms 26336 KB Output is correct