oj.uz

Submission #58785

# Submission time Handle Problem Language Result Execution time Memory
58785 2018-07-19T11:24:46 Z leejseo Foehn Phenomena (JOI17_foehn_phenomena) C++
100 / 100
 277 ms 144660 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;

const int MAXN = 200001;

lld A[MAXN+2], S, T, ans;
int N, Q, L[MAXN+1];

inline lld sum_val(lld x) {return x > 0 ? -S*x : -T*x;}

void input(){
 scanf("%d%d%lld%lld", &N, &Q, &S, &T);
 for (int i=0; i<=N; i++) scanf("%d", &L[i]);
 for (int i=1; i<=N; i++){
  A[i] = L[i] - L[i-1];
  ans += sum_val(A[i]);
 }
}

int main(){
 input();
 int u, v;
 lld w;
 while (Q--){
  scanf("%d%d%lld", &u, &v, &w);
  ans -= sum_val(A[u]);
  A[u] += w;
  ans += sum_val(A[u]);
  if (v != N){
   ans -= sum_val(A[v+1]);
   A[v+1] -= w;
   ans += sum_val(A[v+1]);
  }
  printf("%lld\n", ans);
 }
}

Compilation message

foehn_phenomena.cpp: In function 'void input()':
foehn_phenomena.cpp:13:7: 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:14:32: 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("%d", &L[i]);
                           ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 540 KB Output is correct
3 Correct 5 ms 540 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 5 ms 732 KB Output is correct
7 Correct 4 ms 908 KB Output is correct
8 Correct 6 ms 908 KB Output is correct
9 Correct 5 ms 1020 KB Output is correct
10 Correct 6 ms 1020 KB Output is correct
11 Correct 6 ms 1048 KB Output is correct
12 Correct 5 ms 1232 KB Output is correct
13 Correct 5 ms 1336 KB Output is correct
14 Correct 5 ms 1424 KB Output is correct
15 Correct 5 ms 1424 KB Output is correct
16 Correct 5 ms 1436 KB Output is correct
17 Correct 4 ms 1452 KB Output is correct
18 Correct 5 ms 1624 KB Output is correct
19 Correct 4 ms 1624 KB Output is correct
20 Correct 2 ms 1624 KB Output is correct
21 Correct 4 ms 1624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 10636 KB Output is correct
2 Correct 205 ms 16672 KB Output is correct
3 Correct 206 ms 22588 KB Output is correct
4 Correct 200 ms 27452 KB Output is correct
5 Correct 196 ms 34232 KB Output is correct
6 Correct 136 ms 39288 KB Output is correct
7 Correct 156 ms 44012 KB Output is correct
8 Correct 205 ms 49348 KB Output is correct
9 Correct 212 ms 55092 KB Output is correct
10 Correct 189 ms 59348 KB Output is correct
11 Correct 123 ms 64940 KB Output is correct
12 Correct 211 ms 70184 KB Output is correct
13 Correct 166 ms 75304 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 540 KB Output is correct
3 Correct 5 ms 540 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 5 ms 716 KB Output is correct
6 Correct 5 ms 732 KB Output is correct
7 Correct 4 ms 908 KB Output is correct
8 Correct 6 ms 908 KB Output is correct
9 Correct 5 ms 1020 KB Output is correct
10 Correct 6 ms 1020 KB Output is correct
11 Correct 6 ms 1048 KB Output is correct
12 Correct 5 ms 1232 KB Output is correct
13 Correct 5 ms 1336 KB Output is correct
14 Correct 5 ms 1424 KB Output is correct
15 Correct 5 ms 1424 KB Output is correct
16 Correct 5 ms 1436 KB Output is correct
17 Correct 4 ms 1452 KB Output is correct
18 Correct 5 ms 1624 KB Output is correct
19 Correct 4 ms 1624 KB Output is correct
20 Correct 2 ms 1624 KB Output is correct
21 Correct 4 ms 1624 KB Output is correct
22 Correct 212 ms 10636 KB Output is correct
23 Correct 205 ms 16672 KB Output is correct
24 Correct 206 ms 22588 KB Output is correct
25 Correct 200 ms 27452 KB Output is correct
26 Correct 196 ms 34232 KB Output is correct
27 Correct 136 ms 39288 KB Output is correct
28 Correct 156 ms 44012 KB Output is correct
29 Correct 205 ms 49348 KB Output is correct
30 Correct 212 ms 55092 KB Output is correct
31 Correct 189 ms 59348 KB Output is correct
32 Correct 123 ms 64940 KB Output is correct
33 Correct 211 ms 70184 KB Output is correct
34 Correct 166 ms 75304 KB Output is correct
35 Correct 179 ms 78492 KB Output is correct
36 Correct 196 ms 85384 KB Output is correct
37 Correct 237 ms 91428 KB Output is correct
38 Correct 242 ms 96708 KB Output is correct
39 Correct 212 ms 102232 KB Output is correct
40 Correct 236 ms 107480 KB Output is correct
41 Correct 209 ms 112756 KB Output is correct
42 Correct 251 ms 118196 KB Output is correct
43 Correct 212 ms 122960 KB Output is correct
44 Correct 277 ms 128620 KB Output is correct
45 Correct 204 ms 134284 KB Output is correct
46 Correct 238 ms 140848 KB Output is correct
47 Correct 164 ms 144548 KB Output is correct
48 Correct 163 ms 144660 KB Output is correct
49 Correct 197 ms 144660 KB Output is correct
50 Correct 155 ms 144660 KB Output is correct
51 Correct 145 ms 144660 KB Output is correct
52 Correct 168 ms 144660 KB Output is correct