oj.uz

Submission #243718

# Submission time Handle Problem Language Result Execution time Memory
243718 2020-07-01T16:05:32 Z arnold518 Two Dishes (JOI19_dishes) C++14
100 / 100
 4086 ms 106904 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, M;
ll A[MAXN+10], S[MAXN+10], P[MAXN+10];
ll B[MAXN+10], T[MAXN+10], Q[MAXN+10];
ll ans;

struct Point
{
	int x, y; ll w;
};
vector<Point> V;

ll tree[MAXN*4+10];
bool lazy[MAXN*4+10];

void busy(int node, int tl, int tr)
{
	if(!lazy[node]) return;
	tree[node]=0;
	if(tl!=tr) lazy[node*2]=true, lazy[node*2+1]=true;
	lazy[node]=false;
}

ll query(int node, int tl, int tr, int l, int r)
{
	busy(node, tl, tr);
	if(r<tl || tr<l) return 0;
	if(l<=tl && tr<=r) return tree[node];
	int mid=tl+tr>>1;
	ll t=query(node*2, tl, mid, l, r)+query(node*2+1, mid+1, tr, l, r);
	return t;
}

int query2(int node, int tl, int tr, ll v)
{
	busy(node, tl, tr);
	if(tl==tr) return tl;
	ll t=0;
	if(!lazy[node*2]) t=tree[node*2];
	int mid=tl+tr>>1;
	if(t>v) return query2(node*2, tl, mid, v);
	else return query2(node*2+1, mid+1, tr, v-t);
}

void update1(int node, int tl, int tr, int p, ll v)
{
	busy(node, tl, tr);
	if(tr<p) return;
	if(tl==tr)
	{
		tree[node]+=v;
		return;
	}
	int mid=tl+tr>>1;
	if(p<=mid) update1(node*2, tl, mid, p, v);
	else update1(node*2+1, mid+1, tr, p, v);
	tree[node]=0;
	if(!lazy[node*2]) tree[node]+=tree[node*2];
	if(!lazy[node*2+1]) tree[node]+=tree[node*2+1];
}

void update2(int node, int tl, int tr, int l, int r)
{
	busy(node, tl, tr);
	if(r<l) return;
	if(l<=tl && tr<=r)
	{
		lazy[node]=true;
		busy(node, tl, tr);
		return;
	}
	if(r<tl || tr<l) return;
	int mid=tl+tr>>1;
	update2(node*2, tl, mid, l, r);
	update2(node*2+1, mid+1, tr, l, r);
	tree[node]=tree[node*2]+tree[node*2+1];
}

int main()
{
	int i, j;

	scanf("%d%d", &N, &M);
	for(i=1; i<=N; i++) scanf("%lld%lld%lld", &A[i], &S[i], &P[i]), A[i]+=A[i-1];
	for(i=1; i<=M; i++) scanf("%lld%lld%lld", &B[i], &T[i], &Q[i]), B[i]+=B[i-1];

	for(i=1; i<=N; i++)
	{
		if(A[i]>S[i]) continue;
		int x=i, y=upper_bound(B+1, B+M+1, S[i]-A[i])-B-1;
		
		ans+=P[i];

		if(y!=M)
		{
			x--; y++;
			if(x!=N && y!=0) V.push_back({x, y, -P[i]});
		}
	}
	for(i=1; i<=M; i++)
	{
		if(B[i]>T[i]) continue;
		int y=i, x=upper_bound(A+1, A+N+1, T[i]-B[i])-A-1;
		
		if(x!=N && y!=0) V.push_back({x, y, Q[i]});
		else ans+=Q[i];
	}
	//printf("ANS %lld\n", ans);

	sort(V.begin(), V.end(), [&](const Point &p, const Point &q)
	{
		if(p.x!=q.x) return p.x<q.x;
		if(p.y!=q.y) return p.y>q.y;
		return p.w>q.w;
	});

	//for(i=0; i<V.size(); i++) printf("%d %d %lld\n", V[i].x, V[i].y, V[i].w);

	for(i=0; i<V.size(); i++)
	{	
		//printf("!%d %d %lld\n", V[i].x, V[i].y, V[i].w);
		int y=V[i].y; ll w=V[i].w;

		if(w>=0)
		{
			update1(1, 0, M, y, w);
		}
		else
		{
			ll t=query(1, 0, M, 0, y-1)-w;
			int pt=M+1;
			if(query(1, 0, M, 0, M)>t) pt=query2(1, 0, M, t);

			//printf("U2 %d %d\n", y, lo);
			ll p=query(1, 0, M, 0, pt), q=query(1, 0, M, pt, pt);
			update2(1, 0, M, y, pt-1);
			update1(1, 0, M, pt, -q+p-t);
		}
		//for(j=0; j<=M; j++) query(1, 0, M, 0, j);
		//for(j=0; j<=M; j++) printf("%lld ", query(1, 0, M, 0, j));
		//printf("\n");
	}
	//for(j=0; j<=M; j++) query(1, 0, M, 0, j);
	ans+=query(1, 0, M, 0, M);
	printf("%lld\n", ans);
}

Compilation message

dishes.cpp: In function 'll query(int, int, int, int, int)':
dishes.cpp:37:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'int query2(int, int, int, ll)':
dishes.cpp:48:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'void update1(int, int, int, int, ll)':
dishes.cpp:62:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'void update2(int, int, int, int, int)':
dishes.cpp:81:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
dishes.cpp: In function 'int main()':
dishes.cpp:127:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i<V.size(); i++)
           ~^~~~~~~~~
dishes.cpp:89:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
dishes.cpp:91:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
dishes.cpp:92:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%lld%lld%lld", &A[i], &S[i], &P[i]), A[i]+=A[i-1];
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
dishes.cpp:93:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=M; i++) scanf("%lld%lld%lld", &B[i], &T[i], &Q[i]), B[i]+=B[i-1];
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 19664 KB Output is correct
2 Correct 380 ms 33144 KB Output is correct
3 Correct 224 ms 23032 KB Output is correct
4 Correct 346 ms 30112 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 398 ms 31072 KB Output is correct
7 Correct 118 ms 11896 KB Output is correct
8 Correct 108 ms 12024 KB Output is correct
9 Correct 225 ms 24056 KB Output is correct
10 Correct 396 ms 28240 KB Output is correct
11 Correct 164 ms 17528 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 7 ms 616 KB Output is correct
19 Correct 9 ms 768 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 9 ms 640 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 278 ms 22120 KB Output is correct
25 Correct 248 ms 27740 KB Output is correct
26 Correct 291 ms 28380 KB Output is correct
27 Correct 261 ms 27736 KB Output is correct
28 Correct 333 ms 27028 KB Output is correct
29 Correct 188 ms 20984 KB Output is correct
30 Correct 640 ms 31300 KB Output is correct
31 Correct 128 ms 16104 KB Output is correct
32 Correct 113 ms 12524 KB Output is correct
33 Correct 419 ms 27868 KB Output is correct
34 Correct 484 ms 29648 KB Output is correct
35 Correct 576 ms 24912 KB Output is correct
36 Correct 574 ms 24784 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 7 ms 616 KB Output is correct
19 Correct 9 ms 768 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 9 ms 640 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 278 ms 22120 KB Output is correct
25 Correct 248 ms 27740 KB Output is correct
26 Correct 291 ms 28380 KB Output is correct
27 Correct 261 ms 27736 KB Output is correct
28 Correct 333 ms 27028 KB Output is correct
29 Correct 188 ms 20984 KB Output is correct
30 Correct 640 ms 31300 KB Output is correct
31 Correct 128 ms 16104 KB Output is correct
32 Correct 113 ms 12524 KB Output is correct
33 Correct 419 ms 27868 KB Output is correct
34 Correct 484 ms 29648 KB Output is correct
35 Correct 576 ms 24912 KB Output is correct
36 Correct 574 ms 24784 KB Output is correct
37 Correct 340 ms 30808 KB Output is correct
38 Correct 291 ms 30172 KB Output is correct
39 Correct 419 ms 31564 KB Output is correct
40 Correct 466 ms 31952 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 657 ms 33744 KB Output is correct
43 Correct 453 ms 30684 KB Output is correct
44 Correct 483 ms 32208 KB Output is correct
45 Correct 596 ms 28088 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 7 ms 616 KB Output is correct
19 Correct 9 ms 768 KB Output is correct
20 Correct 8 ms 640 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 9 ms 640 KB Output is correct
23 Correct 8 ms 640 KB Output is correct
24 Correct 278 ms 22120 KB Output is correct
25 Correct 248 ms 27740 KB Output is correct
26 Correct 291 ms 28380 KB Output is correct
27 Correct 261 ms 27736 KB Output is correct
28 Correct 333 ms 27028 KB Output is correct
29 Correct 188 ms 20984 KB Output is correct
30 Correct 640 ms 31300 KB Output is correct
31 Correct 128 ms 16104 KB Output is correct
32 Correct 113 ms 12524 KB Output is correct
33 Correct 419 ms 27868 KB Output is correct
34 Correct 484 ms 29648 KB Output is correct
35 Correct 576 ms 24912 KB Output is correct
36 Correct 574 ms 24784 KB Output is correct
37 Correct 340 ms 30808 KB Output is correct
38 Correct 291 ms 30172 KB Output is correct
39 Correct 419 ms 31564 KB Output is correct
40 Correct 466 ms 31952 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 657 ms 33744 KB Output is correct
43 Correct 453 ms 30684 KB Output is correct
44 Correct 483 ms 32208 KB Output is correct
45 Correct 596 ms 28088 KB Output is correct
46 Correct 1669 ms 83644 KB Output is correct
47 Correct 1427 ms 81596 KB Output is correct
48 Correct 2223 ms 98416 KB Output is correct
49 Correct 2469 ms 98884 KB Output is correct
50 Correct 4043 ms 98612 KB Output is correct
51 Correct 2497 ms 80832 KB Output is correct
52 Correct 2529 ms 85680 KB Output is correct
53 Correct 3537 ms 106904 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 19664 KB Output is correct
2 Correct 380 ms 33144 KB Output is correct
3 Correct 224 ms 23032 KB Output is correct
4 Correct 346 ms 30112 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 398 ms 31072 KB Output is correct
7 Correct 118 ms 11896 KB Output is correct
8 Correct 108 ms 12024 KB Output is correct
9 Correct 225 ms 24056 KB Output is correct
10 Correct 396 ms 28240 KB Output is correct
11 Correct 164 ms 17528 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 7 ms 640 KB Output is correct
29 Correct 7 ms 616 KB Output is correct
30 Correct 9 ms 768 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 9 ms 640 KB Output is correct
34 Correct 8 ms 640 KB Output is correct
35 Correct 278 ms 22120 KB Output is correct
36 Correct 248 ms 27740 KB Output is correct
37 Correct 291 ms 28380 KB Output is correct
38 Correct 261 ms 27736 KB Output is correct
39 Correct 333 ms 27028 KB Output is correct
40 Correct 188 ms 20984 KB Output is correct
41 Correct 640 ms 31300 KB Output is correct
42 Correct 128 ms 16104 KB Output is correct
43 Correct 113 ms 12524 KB Output is correct
44 Correct 419 ms 27868 KB Output is correct
45 Correct 484 ms 29648 KB Output is correct
46 Correct 576 ms 24912 KB Output is correct
47 Correct 574 ms 24784 KB Output is correct
48 Correct 340 ms 30808 KB Output is correct
49 Correct 291 ms 30172 KB Output is correct
50 Correct 419 ms 31564 KB Output is correct
51 Correct 466 ms 31952 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 657 ms 33744 KB Output is correct
54 Correct 453 ms 30684 KB Output is correct
55 Correct 483 ms 32208 KB Output is correct
56 Correct 596 ms 28088 KB Output is correct
57 Correct 304 ms 29916 KB Output is correct
58 Correct 336 ms 30456 KB Output is correct
59 Correct 606 ms 32724 KB Output is correct
60 Correct 344 ms 32336 KB Output is correct
61 Correct 399 ms 31164 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 669 ms 33232 KB Output is correct
64 Correct 476 ms 30424 KB Output is correct
65 Correct 550 ms 32080 KB Output is correct
66 Correct 584 ms 27984 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 19664 KB Output is correct
2 Correct 380 ms 33144 KB Output is correct
3 Correct 224 ms 23032 KB Output is correct
4 Correct 346 ms 30112 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 398 ms 31072 KB Output is correct
7 Correct 118 ms 11896 KB Output is correct
8 Correct 108 ms 12024 KB Output is correct
9 Correct 225 ms 24056 KB Output is correct
10 Correct 396 ms 28240 KB Output is correct
11 Correct 164 ms 17528 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 7 ms 640 KB Output is correct
29 Correct 7 ms 616 KB Output is correct
30 Correct 9 ms 768 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 9 ms 640 KB Output is correct
34 Correct 8 ms 640 KB Output is correct
35 Correct 278 ms 22120 KB Output is correct
36 Correct 248 ms 27740 KB Output is correct
37 Correct 291 ms 28380 KB Output is correct
38 Correct 261 ms 27736 KB Output is correct
39 Correct 333 ms 27028 KB Output is correct
40 Correct 188 ms 20984 KB Output is correct
41 Correct 640 ms 31300 KB Output is correct
42 Correct 128 ms 16104 KB Output is correct
43 Correct 113 ms 12524 KB Output is correct
44 Correct 419 ms 27868 KB Output is correct
45 Correct 484 ms 29648 KB Output is correct
46 Correct 576 ms 24912 KB Output is correct
47 Correct 574 ms 24784 KB Output is correct
48 Correct 340 ms 30808 KB Output is correct
49 Correct 291 ms 30172 KB Output is correct
50 Correct 419 ms 31564 KB Output is correct
51 Correct 466 ms 31952 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 657 ms 33744 KB Output is correct
54 Correct 453 ms 30684 KB Output is correct
55 Correct 483 ms 32208 KB Output is correct
56 Correct 596 ms 28088 KB Output is correct
57 Correct 1669 ms 83644 KB Output is correct
58 Correct 1427 ms 81596 KB Output is correct
59 Correct 2223 ms 98416 KB Output is correct
60 Correct 2469 ms 98884 KB Output is correct
61 Correct 4043 ms 98612 KB Output is correct
62 Correct 2497 ms 80832 KB Output is correct
63 Correct 2529 ms 85680 KB Output is correct
64 Correct 3537 ms 106904 KB Output is correct
65 Correct 304 ms 29916 KB Output is correct
66 Correct 336 ms 30456 KB Output is correct
67 Correct 606 ms 32724 KB Output is correct
68 Correct 344 ms 32336 KB Output is correct
69 Correct 399 ms 31164 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 669 ms 33232 KB Output is correct
72 Correct 476 ms 30424 KB Output is correct
73 Correct 550 ms 32080 KB Output is correct
74 Correct 584 ms 27984 KB Output is correct
75 Correct 1452 ms 81212 KB Output is correct
76 Correct 1712 ms 83440 KB Output is correct
77 Correct 3252 ms 98968 KB Output is correct
78 Correct 1750 ms 104264 KB Output is correct
79 Correct 4086 ms 98460 KB Output is correct
80 Correct 2444 ms 88204 KB Output is correct
81 Correct 2899 ms 94872 KB Output is correct
82 Correct 3632 ms 103436 KB Output is correct
83 Correct 3704 ms 103064 KB Output is correct