oj.uz

Submission #26930

# Submission time Handle Problem Language Result Execution time Memory
26930 2017-07-07T08:00:11 Z kajebiii Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 226 ms 5144 KB 
#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, int> pli;
typedef tuple<int, int, int> ti;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

const int MAX_N = 2e5 + 100;

int N, S, T, Q;
ll Nr[MAX_N], Diff[MAX_N];
ll getV(ll d) {
	if(d > 0) return -S * d;
	return T * -d;
}

int main() {
	cin >> N >> Q >> S >> T;
	for(int i=0; i<=N; i++) scanf("%lld", &Nr[i]);
	for(int i=0; i<N; i++) Diff[i] = Nr[i+1] - Nr[i];

	ll ans = 0;
	for(int i=0; i<N; i++) ans += getV(Diff[i]);

	while(Q--) {
		int x, y, t; scanf("%d%d%d", &x, &y, &t);
		ans -= getV(Diff[x-1]); ans += getV(Diff[x-1] += t);
		if(y == N) {printf("%lld\n", ans); continue;}
		ans -= getV(Diff[y]); ans += getV(Diff[y] -= t);
		printf("%lld\n", ans);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:28:47: 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", &Nr[i]);
                                               ^
foehn_phenomena.cpp:35:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, y, t; scanf("%d%d%d", &x, &y, &t);
                                           ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 5144 KB Output is correct
2 Correct 153 ms 5144 KB Output is correct
3 Correct 179 ms 5144 KB Output is correct
4 Correct 143 ms 5144 KB Output is correct
5 Correct 226 ms 5144 KB Output is correct
6 Correct 156 ms 5144 KB Output is correct
7 Correct 149 ms 5144 KB Output is correct
8 Correct 159 ms 5144 KB Output is correct
9 Correct 189 ms 5144 KB Output is correct
10 Correct 213 ms 5144 KB Output is correct
11 Correct 119 ms 5144 KB Output is correct
12 Correct 126 ms 5144 KB Output is correct
13 Correct 173 ms 5144 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Correct 3 ms 5144 KB Output is correct
4 Correct 0 ms 5144 KB Output is correct
5 Correct 0 ms 5144 KB Output is correct
6 Correct 0 ms 5144 KB Output is correct
7 Correct 0 ms 5144 KB Output is correct
8 Correct 0 ms 5144 KB Output is correct
9 Correct 3 ms 5144 KB Output is correct
10 Correct 0 ms 5144 KB Output is correct
11 Correct 0 ms 5144 KB Output is correct
12 Correct 0 ms 5144 KB Output is correct
13 Correct 0 ms 5144 KB Output is correct
14 Correct 0 ms 5144 KB Output is correct
15 Correct 0 ms 5144 KB Output is correct
16 Correct 0 ms 5144 KB Output is correct
17 Correct 0 ms 5144 KB Output is correct
18 Correct 0 ms 5144 KB Output is correct
19 Correct 0 ms 5144 KB Output is correct
20 Correct 0 ms 5144 KB Output is correct
21 Correct 0 ms 5144 KB Output is correct
22 Correct 166 ms 5144 KB Output is correct
23 Correct 153 ms 5144 KB Output is correct
24 Correct 179 ms 5144 KB Output is correct
25 Correct 143 ms 5144 KB Output is correct
26 Correct 226 ms 5144 KB Output is correct
27 Correct 156 ms 5144 KB Output is correct
28 Correct 149 ms 5144 KB Output is correct
29 Correct 159 ms 5144 KB Output is correct
30 Correct 189 ms 5144 KB Output is correct
31 Correct 213 ms 5144 KB Output is correct
32 Correct 119 ms 5144 KB Output is correct
33 Correct 126 ms 5144 KB Output is correct
34 Correct 173 ms 5144 KB Output is correct
35 Correct 216 ms 5144 KB Output is correct
36 Correct 183 ms 5144 KB Output is correct
37 Correct 206 ms 5144 KB Output is correct
38 Correct 173 ms 5144 KB Output is correct
39 Correct 213 ms 5144 KB Output is correct
40 Correct 196 ms 5144 KB Output is correct
41 Correct 196 ms 5144 KB Output is correct
42 Correct 203 ms 5144 KB Output is correct
43 Correct 179 ms 5144 KB Output is correct
44 Correct 223 ms 5144 KB Output is correct
45 Correct 203 ms 5144 KB Output is correct
46 Correct 163 ms 5144 KB Output is correct
47 Correct 186 ms 5144 KB Output is correct
48 Correct 159 ms 5144 KB Output is correct
49 Correct 176 ms 5144 KB Output is correct
50 Correct 103 ms 5144 KB Output is correct
51 Correct 116 ms 5144 KB Output is correct
52 Correct 149 ms 5144 KB Output is correct