oj.uz

Submission #33254

# Submission time Handle Problem Language Result Execution time Memory
33254 2017-10-23T07:29:30 Z YoLo Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 256 ms 5140 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define endl '\n'
#define pi acos(-1)
#define pque priority_queue
#define N 1000000
#define lmax LONG_LONG_MAX
typedef pair < int, int > ii;
typedef vector < int > vi;
typedef vector < vi > vii;
int mod = 1000000007;
int n, q, s, t, a[200009], f[200009], sums, sumt, l, r, x;
signed main()
{
	//ios_base::sync_with_stdio(0);
	cin >> n >> q >> s >> t;
	for(int i = 0; i <= n; i++)
		cin >> a[i];
	for(int i = 1; i <= n; i++)
	{
		f[i] = a[i] - a[i - 1];
		if(f[i] > 0)
			sums += f[i];
		else
			sumt -= f[i];
	}
	while(q--)
	{
		cin >> l >> r >> x;
		if(f[l] > 0)
			sums -= f[l];
		else
			sumt += f[l];
		if(r < n)
		{
			if(f[r + 1] > 0)
				sums -= f[r + 1];
			else
				sumt += f[r + 1];
		}
		f[l] += x;
		f[r + 1] -= x;
		if(f[l] > 0)
			sums += f[l];
		else
			sumt -= f[l];
		if(r < n)
		{
			if(f[r + 1] > 0)
				sums += f[r + 1];
			else
				sumt -= f[r + 1];
		}
		cout << sumt * t - sums * s << endl;
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 256 ms 5140 KB Execution timed out (wall clock limit exceeded)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5140 KB Output is correct
2 Correct 6 ms 5140 KB Output is correct
3 Correct 6 ms 5140 KB Output is correct
4 Correct 6 ms 5140 KB Output is correct
5 Correct 16 ms 5140 KB Output is correct
6 Correct 6 ms 5140 KB Output is correct
7 Correct 3 ms 5140 KB Output is correct
8 Correct 13 ms 5140 KB Output is correct
9 Correct 0 ms 5140 KB Output is correct
10 Correct 13 ms 5140 KB Output is correct
11 Correct 3 ms 5140 KB Output is correct
12 Correct 6 ms 5140 KB Output is correct
13 Correct 6 ms 5140 KB Output is correct
14 Correct 13 ms 5140 KB Output is correct
15 Correct 6 ms 5140 KB Output is correct
16 Correct 6 ms 5140 KB Output is correct
17 Correct 6 ms 5140 KB Output is correct
18 Correct 13 ms 5140 KB Output is correct
19 Correct 0 ms 5140 KB Output is correct
20 Correct 0 ms 5140 KB Output is correct
21 Correct 0 ms 5140 KB Output is correct
22 Runtime error 256 ms 5140 KB Execution timed out (wall clock limit exceeded)
23 Halted 0 ms 0 KB -