oj.uz

Submission #106999

# Submission time Handle Problem Language Result Execution time Memory
106999 2019-04-21T12:31:29 Z FiloSanza Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 320 ms 17504 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

int N, Q, S, T;
const int MAXN = 200005;
vector<int> seg;

inline int left(int x){return 2*x+1;}
inline int right(int x){return 2*(x+1);}
inline int father(int x){return (x-1)/2;}

void build(const vector<int>& in){
    int sz = (1<<(int)ceil(log2(in.size()))) * 2 - 1;
    seg.resize(sz, 0);

    for(int i=0; i<in.size(); i++)
        seg[i+seg.size()/2] = in[i] >= 0 ? T*in[i] : S*in[i];

    for(int i=seg.size()/2-1; i>=0; i--)
        seg[i] = seg[left(i)] + seg[right(i)];
}

void debug(){
    for(auto i : seg) cout << i << " ";
    cout << "\n\n";
}

void update(int pos, int delta){
    pos += seg.size()/2;
    int curr = seg[pos];
    curr /= curr >= 0 ? T : S;
    curr += delta;
    curr *= curr >= 0 ? T : S;
    seg[pos] = curr;

    while(pos != 0){
        pos = father(pos);
        seg[pos] = seg[left(pos)] + seg[right(pos)];
    }

//    debug();
}

int query(){
    return seg.front();
}

signed main(){
    cin.tie(0);
    cin.sync_with_stdio(0);

    cin >> N >> Q >> S >> T;

    vector<int> in(N+1), v;

    for(auto &i : in) cin >> i;

    for(int i=1; i<=N; i++) v.push_back(in[i-1] - in[i]);

    build(v);

    int a, b, c;
    while(Q--){
        cin >> a >> b >> c;
        update(a-1, -c);
        if(b < N) update(b, c);

        cout << query() << "\n";
    }
}

Compilation message

foehn_phenomena.cpp: In function 'void build(const std::vector<long long int>&)':
foehn_phenomena.cpp:19:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<in.size(); i++)
                  ~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 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 3 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 5 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 3 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 264 ms 14560 KB Output is correct
2 Correct 246 ms 15400 KB Output is correct
3 Correct 287 ms 15736 KB Output is correct
4 Correct 237 ms 15152 KB Output is correct
5 Correct 291 ms 16336 KB Output is correct
6 Correct 145 ms 15340 KB Output is correct
7 Correct 131 ms 15208 KB Output is correct
8 Correct 260 ms 16220 KB Output is correct
9 Correct 215 ms 16396 KB Output is correct
10 Correct 243 ms 15220 KB Output is correct
11 Correct 176 ms 15152 KB Output is correct
12 Correct 184 ms 16004 KB Output is correct
13 Correct 166 ms 16036 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 5 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 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 3 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 5 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 3 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 264 ms 14560 KB Output is correct
23 Correct 246 ms 15400 KB Output is correct
24 Correct 287 ms 15736 KB Output is correct
25 Correct 237 ms 15152 KB Output is correct
26 Correct 291 ms 16336 KB Output is correct
27 Correct 145 ms 15340 KB Output is correct
28 Correct 131 ms 15208 KB Output is correct
29 Correct 260 ms 16220 KB Output is correct
30 Correct 215 ms 16396 KB Output is correct
31 Correct 243 ms 15220 KB Output is correct
32 Correct 176 ms 15152 KB Output is correct
33 Correct 184 ms 16004 KB Output is correct
34 Correct 166 ms 16036 KB Output is correct
35 Correct 267 ms 14672 KB Output is correct
36 Correct 245 ms 16044 KB Output is correct
37 Correct 272 ms 17100 KB Output is correct
38 Correct 290 ms 16752 KB Output is correct
39 Correct 281 ms 16748 KB Output is correct
40 Correct 256 ms 16748 KB Output is correct
41 Correct 259 ms 16624 KB Output is correct
42 Correct 320 ms 16620 KB Output is correct
43 Correct 263 ms 16024 KB Output is correct
44 Correct 319 ms 16252 KB Output is correct
45 Correct 280 ms 16440 KB Output is correct
46 Correct 229 ms 17504 KB Output is correct
47 Correct 122 ms 15980 KB Output is correct
48 Correct 133 ms 15852 KB Output is correct
49 Correct 198 ms 14956 KB Output is correct
50 Correct 132 ms 15992 KB Output is correct
51 Correct 167 ms 16236 KB Output is correct
52 Correct 172 ms 16108 KB Output is correct