oj.uz

Submission #204032

# Submission time Handle Problem Language Result Execution time Memory
204032 2020-02-24T01:11:07 Z savacska Fire (JOI20_ho_t5) C++14
20 / 100
 1000 ms 21268 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;

struct My_queue
{
 	deque <pair <int, int> > qu;
 	void add(int x, int pos)
 	{
 	 	while (!qu.empty() && qu.back().x <= x) qu.pop_back();
 	 	qu.push_back(mp(x, pos));
 	 	return;
 	}
 	int get_max()
 	{
 	 	return qu[0].x;
 	}
 	void pop(int pos)
 	{
 	 	if (qu[0].y == pos) qu.pop_front();
 	 	return;
 	}
};

ll summa[200005], pref[200005], answer[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;

 	   	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++)
 	   	{
 	   	 	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)
 	   	 	 	{
 	   	 	 		My_queue S;
 	   	 	 		for (int k = max(lef - tim, 1); k < lef; k++) S.add(mas[k], k);
 	   	 	 		for (int k = lef; k <= j; k++)
 	   	 	 		{
 	   	 	 	 		S.add(mas[k], k);
 	   	 	 	 		ans += (ll) S.get_max();
 	   	 	 	 		S.pop(k - 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 7 ms 4856 KB Output is correct
2 Correct 9 ms 5112 KB Output is correct
3 Correct 9 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 8 ms 5112 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 9 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Correct 9 ms 5112 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
13 Correct 9 ms 4984 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 9 ms 5112 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5116 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5112 KB Output is correct
20 Correct 10 ms 5112 KB Output is correct
21 Correct 10 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 9 ms 5112 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 9 ms 5112 KB Output is correct
27 Correct 8 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 8 ms 5112 KB Output is correct
31 Correct 9 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 915 ms 20832 KB Output is correct
3 Correct 883 ms 20720 KB Output is correct
4 Correct 924 ms 20836 KB Output is correct
5 Correct 902 ms 20808 KB Output is correct
6 Correct 894 ms 20560 KB Output is correct
7 Correct 925 ms 21160 KB Output is correct
8 Correct 916 ms 20984 KB Output is correct
9 Correct 906 ms 20984 KB Output is correct
10 Correct 882 ms 20612 KB Output is correct
11 Correct 922 ms 21048 KB Output is correct
12 Correct 871 ms 20600 KB Output is correct
13 Correct 899 ms 20700 KB Output is correct
14 Correct 917 ms 20728 KB Output is correct
15 Correct 895 ms 20728 KB Output is correct
16 Correct 896 ms 20732 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 912 ms 20244 KB Output is correct
3 Correct 884 ms 20088 KB Output is correct
4 Correct 929 ms 20232 KB Output is correct
5 Correct 882 ms 19836 KB Output is correct
6 Correct 884 ms 20088 KB Output is correct
7 Correct 895 ms 20088 KB Output is correct
8 Correct 891 ms 20216 KB Output is correct
9 Correct 868 ms 20000 KB Output is correct
10 Correct 845 ms 19832 KB Output is correct
11 Correct 920 ms 20348 KB Output is correct
12 Correct 911 ms 19960 KB Output is correct
13 Correct 915 ms 20344 KB Output is correct
14 Correct 902 ms 19960 KB Output is correct
15 Correct 943 ms 20116 KB Output is correct
16 Correct 896 ms 19756 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 942 ms 18904 KB Output is correct
2 Correct 918 ms 18904 KB Output is correct
3 Correct 969 ms 19320 KB Output is correct
4 Correct 912 ms 19064 KB Output is correct
5 Correct 922 ms 19192 KB Output is correct
6 Correct 923 ms 18936 KB Output is correct
7 Correct 961 ms 19212 KB Output is correct
8 Correct 942 ms 19192 KB Output is correct
9 Correct 927 ms 19064 KB Output is correct
10 Correct 938 ms 19072 KB Output is correct
11 Correct 955 ms 19268 KB Output is correct
12 Correct 967 ms 19192 KB Output is correct
13 Correct 959 ms 19140 KB Output is correct
14 Correct 962 ms 19232 KB Output is correct

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4856 KB Output is correct
2 Correct 9 ms 5112 KB Output is correct
3 Correct 9 ms 5112 KB Output is correct
4 Correct 8 ms 5112 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 8 ms 5112 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 9 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Correct 9 ms 5112 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
13 Correct 9 ms 4984 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 9 ms 5112 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5116 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5112 KB Output is correct
20 Correct 10 ms 5112 KB Output is correct
21 Correct 10 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 9 ms 5112 KB Output is correct
25 Correct 8 ms 5112 KB Output is correct
26 Correct 9 ms 5112 KB Output is correct
27 Correct 8 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 8 ms 5112 KB Output is correct
31 Correct 9 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct
33 Correct 915 ms 20972 KB Output is correct
34 Correct 950 ms 21040 KB Output is correct
35 Correct 928 ms 20804 KB Output is correct
36 Correct 908 ms 20856 KB Output is correct
37 Correct 916 ms 20784 KB Output is correct
38 Correct 917 ms 20860 KB Output is correct
39 Correct 930 ms 20856 KB Output is correct
40 Correct 914 ms 20856 KB Output is correct
41 Correct 927 ms 20688 KB Output is correct
42 Correct 951 ms 20932 KB Output is correct
43 Correct 929 ms 20984 KB Output is correct
44 Correct 936 ms 20752 KB Output is correct
45 Correct 881 ms 20600 KB Output is correct
46 Correct 903 ms 20856 KB Output is correct
47 Correct 906 ms 20488 KB Output is correct
48 Correct 882 ms 20728 KB Output is correct
49 Correct 891 ms 20728 KB Output is correct
50 Correct 934 ms 21268 KB Output is correct
51 Correct 911 ms 20984 KB Output is correct
52 Correct 907 ms 20896 KB Output is correct
53 Correct 899 ms 20912 KB Output is correct
54 Correct 984 ms 20600 KB Output is correct
55 Execution timed out 1000 ms 20484 KB Time limit exceeded
56 Halted 0 ms 0 KB -