oj.uz

답안 #204033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204033 2020-02-24T01:16:08 Z savacska Fire (JOI20_ho_t5) C++14
20 / 100
 1000 ms 21112 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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 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 9 ms 5112 KB Output is correct
10 Correct 8 ms 5032 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 9 ms 5112 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 9 ms 5112 KB Output is correct
20 Correct 9 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 9 ms 5112 KB Output is correct
24 Correct 8 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 9 ms 5112 KB Output is correct
28 Correct 9 ms 5112 KB Output is correct
29 Correct 9 ms 5112 KB Output is correct
30 Correct 9 ms 5240 KB Output is correct
31 Correct 8 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 921 ms 20880 KB Output is correct
3 Correct 920 ms 20856 KB Output is correct
4 Correct 898 ms 21000 KB Output is correct
5 Correct 906 ms 20728 KB Output is correct
6 Correct 890 ms 20728 KB Output is correct
7 Correct 916 ms 21060 KB Output is correct
8 Correct 921 ms 21048 KB Output is correct
9 Correct 904 ms 21060 KB Output is correct
10 Correct 890 ms 20728 KB Output is correct
11 Correct 925 ms 21112 KB Output is correct
12 Correct 880 ms 20728 KB Output is correct
13 Correct 917 ms 20912 KB Output is correct
14 Correct 906 ms 20564 KB Output is correct
15 Correct 895 ms 20728 KB Output is correct
16 Correct 893 ms 20856 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 897 ms 20380 KB Output is correct
3 Correct 860 ms 19920 KB Output is correct
4 Correct 917 ms 20344 KB Output is correct
5 Correct 873 ms 19704 KB Output is correct
6 Correct 885 ms 20088 KB Output is correct
7 Correct 886 ms 19956 KB Output is correct
8 Correct 917 ms 20124 KB Output is correct
9 Correct 893 ms 19960 KB Output is correct
10 Correct 890 ms 19820 KB Output is correct
11 Correct 914 ms 20328 KB Output is correct
12 Correct 889 ms 20088 KB Output is correct
13 Correct 885 ms 20344 KB Output is correct
14 Correct 889 ms 20112 KB Output is correct
15 Correct 913 ms 20216 KB Output is correct
16 Correct 895 ms 20116 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 912 ms 18808 KB Output is correct
2 Correct 937 ms 18880 KB Output is correct
3 Correct 965 ms 19320 KB Output is correct
4 Correct 927 ms 19300 KB Output is correct
5 Correct 931 ms 19320 KB Output is correct
6 Correct 975 ms 18912 KB Output is correct
7 Correct 952 ms 19156 KB Output is correct
8 Correct 936 ms 19064 KB Output is correct
9 Correct 933 ms 19064 KB Output is correct
10 Correct 956 ms 18904 KB Output is correct
11 Correct 938 ms 19328 KB Output is correct
12 Correct 938 ms 19320 KB Output is correct
13 Correct 950 ms 19108 KB Output is correct
14 Correct 939 ms 19192 KB Output is correct

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 8 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 9 ms 5112 KB Output is correct
10 Correct 8 ms 5032 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 9 ms 5112 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 9 ms 5112 KB Output is correct
20 Correct 9 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 9 ms 5112 KB Output is correct
24 Correct 8 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 9 ms 5112 KB Output is correct
28 Correct 9 ms 5112 KB Output is correct
29 Correct 9 ms 5112 KB Output is correct
30 Correct 9 ms 5240 KB Output is correct
31 Correct 8 ms 5112 KB Output is correct
32 Correct 8 ms 5112 KB Output is correct
33 Correct 945 ms 20728 KB Output is correct
34 Correct 955 ms 21044 KB Output is correct
35 Correct 932 ms 20668 KB Output is correct
36 Correct 902 ms 20856 KB Output is correct
37 Correct 907 ms 20748 KB Output is correct
38 Correct 928 ms 20728 KB Output is correct
39 Correct 919 ms 20728 KB Output is correct
40 Correct 917 ms 20728 KB Output is correct
41 Correct 931 ms 20776 KB Output is correct
42 Correct 937 ms 20728 KB Output is correct
43 Correct 935 ms 20908 KB Output is correct
44 Correct 934 ms 20848 KB Output is correct
45 Correct 920 ms 20556 KB Output is correct
46 Correct 942 ms 20884 KB Output is correct
47 Correct 885 ms 20600 KB Output is correct
48 Correct 869 ms 20600 KB Output is correct
49 Correct 896 ms 20508 KB Output is correct
50 Correct 922 ms 21088 KB Output is correct
51 Correct 919 ms 21088 KB Output is correct
52 Correct 885 ms 20728 KB Output is correct
53 Correct 908 ms 20856 KB Output is correct
54 Execution timed out 1004 ms 20600 KB Time limit exceeded
55 Halted 0 ms 0 KB -