oj.uz

Submission #204041

# Submission time Handle Problem Language Result Execution time Memory
204041 2020-02-24T01:38:36 Z savacska Fire (JOI20_ho_t5) C++14
8 / 100
 1000 ms 21132 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;

const int CS = 600;

ll summa[200005], pref[200005], answer[200005], smallsum[200005];
int mas[200005], maxim[200005];
vector <pair <int, int> > zapr[200005];

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);

 	int n, quer;
 	cin >> n >> quer;
 	for (int i = 1; i <= n; i++) cin >> mas[i];
 	for (int i = 1; i <= quer; i++)
 	{
 	 	int tim, lef, rig;
 	 	cin >> tim >> lef >> rig;
 	 	zapr[rig].pb(mp(tim, i));
 	 	zapr[lef - 1].pb(mp(tim, -i));
 	}

 	for (int i = 1; i <= (n - 1) / CS + 1; i++)
 	{
 	 	int lef = (i - 1) * CS + 1, rig = min(n, i * CS);
 	 	for (int j = 0; j <= n; j++) summa[j] = 0;
 	 	for (int j = 0; j <= CS; j++) smallsum[j] = 0;

 	   	int uk = lef, tekmax = mas[lef], cur = mas[lef - 1];
 	   	for (int j = lef - 1; j >= 1; j--)
 	   	{
 	   		cur = max(cur, mas[j]);
 	   		maxim[j] = cur;
 	   		while (uk <= rig && tekmax < cur)
 	   		{
 	   			uk++;
 	   			tekmax = max(tekmax, mas[uk]);
 	   		}
 	   		summa[lef - j] += (ll) cur, summa[uk - j] -= (ll) cur;
 	   	}
 	   	for (int j = 0; j >= lef - n; j--)
 	   	{
 	   	 	summa[lef - j] += (ll) cur;
 	   	 	summa[min(uk - j, n + 1)] -= (ll) cur;
 	   	}

 	   	uk = lef - 1, tekmax = mas[lef - 1], cur = mas[lef];
 	   	for (int j = lef; j <= rig; j++)
 	   	{
 	   	 	cur = max(cur, mas[j]);
 	   	 	maxim[j] = cur;
 	   	 	while (uk > 0 && tekmax <= cur)
 	   	 	{
 	   	 		uk--;
 	   	 		tekmax = max(tekmax, mas[uk]); 	
 	   	 	}
 	   	 	if (uk == 0) summa[j - uk] += (ll) cur, summa[n + 1] -= (ll) cur;
 	   	 	summa[j - lef + 1] += (ll) cur, summa[j - uk] -= (ll) cur;
 	   	}
 	   	for (int j = 1; j <= n; j++) summa[j] += summa[j - 1];
 	   	
 	   	for (int j = lef; j <= rig; j++)
 	   	{
 	   		int mx = mas[j];
 	   		for (int z = j; z <= rig; z++)
 	   		{
 	   		 	mx = max(mx, mas[z]);
 	   		 	summa[z - j] += (ll) mx;
 	   		}
 	   	}

 	   	for (int j = lef; j <= rig; j++)
 	   	{
 	   	 	int mx = mas[j];
 	   	 	for (int z = j; z >= lef; z--)
 	   	 	{
 	   	 	 	mx = max(mx, mas[z]);
 	   	 	 	smallsum[j - z] += (ll) mx;
 	   	 	}
 	   	 	for (int z = 0; z < (int) zapr[j].size(); z++)
 	   	 	{
 	   	 	 	int tim = zapr[j][z].x, num = zapr[j][z].y;
 	   	 	 	if (num > 0) answer[num] += pref[tim];
 	   	 	 	else answer[-num] -= pref[tim];

 	   	 	 	ll ans = 0;
 	   	 	 	if (tim <= CS)
 	   	 	 	{
 	   	 	 		for (int k = lef; k <= min (j, lef + tim - 1); k++) ans += (ll) max(maxim[k], maxim[max(k - tim, 1)]);
 	   	 	 		if (j - tim >= lef) ans += smallsum[tim];
 	   	 	 	}
 	   	 	 	else
 	   	 	 	{
 	   	 	 	 	for (int k = lef; k <= j; k++) ans += (ll) max(maxim[k], maxim[max(k - tim, 1)]);
 	   	 	 	}
 	   	 	 	if (num > 0) answer[num] += ans;
 	   	 	 	else answer[-num] -= ans;
 	   	 	}
 	   	}

 	   	for (int j = 0; j <= n; j++) pref[j] += summa[j];
 	}

 	for (int i = 1; i <= quer; i++) cout << answer[i] << '\n';
 	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5116 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 5112 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 8 ms 5112 KB Output is correct
16 Correct 8 ms 5116 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5112 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 8 ms 5112 KB Output is correct
24 Correct 8 ms 5112 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 7 ms 5112 KB Output is correct
28 Correct 8 ms 5112 KB Output is correct
29 Correct 8 ms 5112 KB Output is correct
30 Correct 9 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 969 ms 20960 KB Output is correct
3 Correct 980 ms 20832 KB Output is correct
4 Correct 989 ms 21112 KB Output is correct
5 Correct 970 ms 20728 KB Output is correct
6 Correct 974 ms 20568 KB Output is correct
7 Correct 991 ms 21132 KB Output is correct
8 Execution timed out 1002 ms 21040 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 941 ms 20336 KB Output is correct
3 Correct 928 ms 19964 KB Output is correct
4 Correct 986 ms 20388 KB Output is correct
5 Correct 949 ms 20092 KB Output is correct
6 Correct 954 ms 19960 KB Output is correct
7 Correct 952 ms 20088 KB Output is correct
8 Correct 944 ms 20216 KB Output is correct
9 Correct 931 ms 19960 KB Output is correct
10 Correct 915 ms 19860 KB Output is correct
11 Correct 983 ms 20340 KB Output is correct
12 Correct 957 ms 19992 KB Output is correct
13 Correct 967 ms 20344 KB Output is correct
14 Correct 943 ms 19880 KB Output is correct
15 Correct 957 ms 20196 KB Output is correct
16 Correct 955 ms 19964 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1004 ms 19104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5116 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 5112 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 8 ms 5112 KB Output is correct
16 Correct 8 ms 5116 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5112 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 8 ms 5112 KB Output is correct
24 Correct 8 ms 5112 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 7 ms 5112 KB Output is correct
28 Correct 8 ms 5112 KB Output is correct
29 Correct 8 ms 5112 KB Output is correct
30 Correct 9 ms 5112 KB Output is correct
31 Correct 7 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct
33 Correct 961 ms 20728 KB Output is correct
34 Correct 989 ms 21112 KB Output is correct
35 Correct 979 ms 20868 KB Output is correct
36 Correct 970 ms 21000 KB Output is correct
37 Correct 948 ms 20676 KB Output is correct
38 Execution timed out 1041 ms 20856 KB Time limit exceeded
39 Halted 0 ms 0 KB -