oj.uz

Submission #892941

# Submission time Handle Problem Language Result Execution time Memory
892941 2023-12-26T08:17:00 Z thunopro Food Court (JOI21_foodcourt) C++14
35 / 100
 345 ms 230140 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 300009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow(a,n/2) ;
	if ( n % 2 ) return (1ll*res*res%mod*a%mod) ; 
	else return 1ll*res*res%mod ; 
}

int n , m , nq ; 

struct shape {
	int op , l , r , c , k ; 
	int pos ; 
	ll b ; 
} q [maxn] ;

deque <pll> deq [maxn] ; 
void sub1 () 
{
	for ( int run = 1 ; run <= nq ; run ++ ) 
	{
		int op = q [run].op ; 
		if ( op <= 2 ) 
		{
			int l = q [run].l , r = q [run].r , c = q [run].c , k = q [run].k ; 
			if ( op == 1 ) 
			{
				for ( int i = l ; i <= r ; i ++ ) 
				{
					if ( deq[i].empty() || deq[i].back().fi != c ) deq[i] . push_back ({c,k}) ; 
					else deq[i].back().se += k ; 
				}
			}
			else 
			{
				for ( int i = l ; i <= r ; i ++ ) 
				{
					int remain = k ; 
					while ( deq[i].size () ) 
					{
						if ( deq[i].front().se <= remain ) remain -= deq[i].front().se , deq[i].pop_front () ; 
						else 
						{
							deq[i].front().se -= remain ; 
							break ; 
						}
					}
				}
			}
		}
		else 
		{
			int pos = q[run].pos ; 
			ll b = q [run].b ; 
			deque <pll> New = deq [pos] ; 
			ll sum = 0 ; 
			
			int res = 0 ; 
			
			while ( !New.empty() ) 
			{
				if ( sum + New.front().se >= b )
				{
					res = New.front().fi ; 
					break ; 
				}
				sum += New.front().se ; 
				New.pop_front() ; 
			}
			
			cout << res << "\n" ; 
		}
	}
}

bool check_sub2 () 
{
	if ( max (n,nq) > 65000 ) return false ; 
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		if ( q[i].op == 1 ) 
		{
			if ( q[i].r - q [i].l > 10 ) return false ;
			if ( q[i].k != 1 ) return false ; 
		 } 
	}
	return true ; 
}

const int N = 2.5 * 1e5 ; 
ll T[maxn*4] , lazy [maxn*4] ; 

void down_leave_sub2 ( int id ) 
{
	ll &t = lazy [id] ; 
	T [left] += t , T [right] += t ; 
	lazy [left] += t , lazy [right] += t ; 
	t = 0 ; 
}
void update_leave_sub2 ( int id , int l , int r , int u , int v , int k ) 
{
	if ( l > v || r < u ) return ; 
	if ( u <= l && r <= v ) 
	{
		T [id] += k ; 
		lazy [id] += k ; 
		if ( k == - 1 ) 
		{
			T [id] = lazy [id] = 0 ; 
		}
		return ; 
	}
	int mid = (l+r)/2 ; 
	down_leave_sub2 (id) ; 
	update_leave_sub2 (left,l,mid,u,v,k) ; 
	update_leave_sub2 (right,mid+1,r,u,v,k) ; 
}
ll get_leave_sub2 ( int id , int l , int r , int pos ) 
{
	if ( l > pos || r < pos ) return 0 ; 
	if ( l == r ) return T [id] ; 
	down_leave_sub2 (id) ; 
	int mid = (l+r)/2 ; 
	return get_leave_sub2 (left,l,mid,pos) + get_leave_sub2 (right,mid+1,r,pos) ;
}

void leave_sub2 ( int pos ) 
{
	ll leave = get_leave_sub2 (1,1,N,pos) ; 
	update_leave_sub2 (1,1,N,pos,pos,-1) ; 
	while ( deq[pos].size () ) 
	{
		if ( deq[pos].front().se <= leave ) leave -= deq[pos].front().se , deq[pos].pop_front() ; 
		else
		{
			deq[pos].front().se -= leave ; 
			break ; 
		}
	}
}

void sub2 ()  
{
	for ( int run = 1 ; run <= nq ; run ++ ) 
	{
		if ( q [run].op <= 2 ) 
		{
			int l = q [run].l , r = q [run].r , c = q [run].c , k = q [run].k ; 
			if ( q[run].op == 1 ) 
			{
				for ( int i = l ; i <= r ; i ++ ) 
				{
					leave_sub2 (i) ; 
					if ( deq[i].empty() || deq[i].back().fi != c ) deq[i] . push_back ({c,k}) ; 
					else deq[i].back().se += k ; 
				}
			}
			else
			{
				int l = q[run].l , r = q[run].r , k = q [run].k ; 
				update_leave_sub2 (1,1,N,l,r,k) ; 
			} 
		}
		else 
		{
			int pos = q[run].pos ; ll b = q [run].b ; 
			leave_sub2 (pos) ; 
			deque <pll> New = deq [pos] ; 
			ll sum = 0 ; 
			
			int res = 0 ; 
			
			while ( !New.empty() ) 
			{
				if ( sum + New.front().se >= b )
				{
					res = New.front().fi ; 
					break ; 
				}
				sum += New.front().se ; 
				New.pop_front() ; 
			}
			
			cout << res << "\n" ; 
		}
	}
}


struct info 
{
	ll sum , minn ; 
	friend info operator + ( info x , info y ) 
	{
		info res ; 
		res . minn = min (x.minn,x.sum+y.minn) ; 
		res . sum = x.sum + y.sum ; 
		return res ; 
	}
}laz [maxn*4] ; 

void down_leave_sub3 ( int id ) 
{
	laz [left] = laz [left] + laz [id] ; 
	laz [right] = laz [right] + laz [id] ; 
	laz [id] = {0,0} ; 
}
void update_leave_sub3 ( int id , int l , int r , int u , int v , int k ) 
{
	if ( l > v || r < u ) return ; 
	if ( u <= l && r <= v ) 
	{
		info dat = {k,min(k,0)} ; 
		laz [id] = laz [id] + dat ; 
		return ; 
	}
	int mid = (l+r)/2 ; 
	down_leave_sub3 (id) ; 
	update_leave_sub3 (left,l,mid,u,v,k) ; 
	update_leave_sub3 (right,mid+1,r,u,v,k) ; 
	T [id] = min (T[left],T[right]) ; 
}
ll get_leave_sub3 ( int id , int l , int r , int pos ) 
{
	if ( l > pos || r < pos ) return 0 ; 
	if ( l == r ) return laz [id].sum - laz [id].minn ; 
	int mid = (l+r)/2 ; 
	down_leave_sub3 (id) ; 
	return get_leave_sub3 (left,l,mid,pos) + get_leave_sub3 (right,mid+1,r,pos) ; 
}
void sub3 () 
{
	for ( int run = 1 ; run <= nq ; run ++ ) 
	{
		int l = q [run].l , r = q [run].r , k = q [run].k ; 
		if ( q [run].op == 1 ) 
		{
			update_leave_sub3 (1,1,N,l,r,k) ; 
		}
		else if ( q [run].op == 2 ) 
		{
			update_leave_sub3 (1,1,N,l,r,-k) ;
		}
		else 
		{
			int pos = q [run].pos ; ll b = q [run].b ; 
			if ( get_leave_sub3 (1,1,N,pos) >= b ) cout << 1 << "\n" ; 
			else cout << 0 << "\n" ; 
		}
	}
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> m >> nq ; 
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		cin >> q[i].op ; 
		if ( q[i].op == 1 ) 
		{
			cin >> q[i].l >> q[i].r >> q[i].c >> q[i].k ; 
		}
		else if ( q[i].op == 2 ) 
		{
			cin >> q[i].l >> q[i].r >> q [i].k ; 
		}
		else cin >> q[i].pos >> q[i].b ; 
	}

	if ( n <= 2e3 && nq <= 2e3 ) sub1 () ; 
	else if ( check_sub2 () ) sub2 () ; 
	else if ( m == 1 ) sub3 () ; 
}

Compilation message

foodcourt.cpp: In function 'void rf()':
foodcourt.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 204032 KB Output is correct
2 Correct 146 ms 204380 KB Output is correct
3 Correct 129 ms 210768 KB Output is correct
4 Correct 135 ms 214540 KB Output is correct
5 Correct 105 ms 203348 KB Output is correct
6 Correct 100 ms 203352 KB Output is correct
7 Correct 132 ms 215964 KB Output is correct
8 Correct 132 ms 211476 KB Output is correct
9 Correct 123 ms 204336 KB Output is correct
10 Correct 127 ms 211028 KB Output is correct
11 Correct 136 ms 208216 KB Output is correct
12 Correct 132 ms 204276 KB Output is correct
13 Correct 126 ms 204340 KB Output is correct
14 Correct 132 ms 205632 KB Output is correct
15 Correct 130 ms 206536 KB Output is correct
16 Correct 130 ms 205616 KB Output is correct
17 Correct 118 ms 203908 KB Output is correct
18 Correct 131 ms 204116 KB Output is correct
19 Correct 101 ms 203372 KB Output is correct
20 Correct 102 ms 203348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 204032 KB Output is correct
2 Correct 146 ms 204380 KB Output is correct
3 Correct 129 ms 210768 KB Output is correct
4 Correct 135 ms 214540 KB Output is correct
5 Correct 105 ms 203348 KB Output is correct
6 Correct 100 ms 203352 KB Output is correct
7 Correct 132 ms 215964 KB Output is correct
8 Correct 132 ms 211476 KB Output is correct
9 Correct 123 ms 204336 KB Output is correct
10 Correct 127 ms 211028 KB Output is correct
11 Correct 136 ms 208216 KB Output is correct
12 Correct 132 ms 204276 KB Output is correct
13 Correct 126 ms 204340 KB Output is correct
14 Correct 132 ms 205632 KB Output is correct
15 Correct 130 ms 206536 KB Output is correct
16 Correct 130 ms 205616 KB Output is correct
17 Correct 118 ms 203908 KB Output is correct
18 Correct 131 ms 204116 KB Output is correct
19 Correct 101 ms 203372 KB Output is correct
20 Correct 102 ms 203348 KB Output is correct
21 Correct 131 ms 204172 KB Output is correct
22 Correct 141 ms 204540 KB Output is correct
23 Correct 126 ms 210876 KB Output is correct
24 Correct 152 ms 214676 KB Output is correct
25 Correct 103 ms 203348 KB Output is correct
26 Correct 106 ms 203344 KB Output is correct
27 Correct 131 ms 215548 KB Output is correct
28 Correct 129 ms 212304 KB Output is correct
29 Correct 128 ms 205960 KB Output is correct
30 Correct 131 ms 210748 KB Output is correct
31 Correct 125 ms 208208 KB Output is correct
32 Correct 124 ms 204112 KB Output is correct
33 Correct 128 ms 204372 KB Output is correct
34 Correct 134 ms 206660 KB Output is correct
35 Correct 127 ms 205140 KB Output is correct
36 Correct 132 ms 205392 KB Output is correct
37 Correct 101 ms 203348 KB Output is correct
38 Correct 99 ms 203352 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 213076 KB Output is correct
2 Correct 202 ms 213092 KB Output is correct
3 Correct 214 ms 213104 KB Output is correct
4 Correct 203 ms 213076 KB Output is correct
5 Correct 226 ms 213076 KB Output is correct
6 Correct 241 ms 213072 KB Output is correct
7 Correct 126 ms 212308 KB Output is correct
8 Correct 132 ms 212308 KB Output is correct
9 Correct 189 ms 213024 KB Output is correct
10 Correct 184 ms 213076 KB Output is correct
11 Correct 186 ms 213120 KB Output is correct
12 Correct 192 ms 213328 KB Output is correct
13 Correct 184 ms 212952 KB Output is correct
14 Correct 196 ms 213136 KB Output is correct
15 Correct 230 ms 212988 KB Output is correct
16 Correct 255 ms 213360 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 225964 KB Output is correct
2 Correct 225 ms 219288 KB Output is correct
3 Correct 282 ms 229428 KB Output is correct
4 Correct 245 ms 225772 KB Output is correct
5 Correct 236 ms 222036 KB Output is correct
6 Correct 288 ms 229476 KB Output is correct
7 Correct 193 ms 218084 KB Output is correct
8 Correct 187 ms 217932 KB Output is correct
9 Correct 284 ms 229740 KB Output is correct
10 Correct 288 ms 229468 KB Output is correct
11 Correct 278 ms 229484 KB Output is correct
12 Correct 280 ms 229496 KB Output is correct
13 Correct 290 ms 229460 KB Output is correct
14 Correct 310 ms 229624 KB Output is correct
15 Correct 288 ms 230140 KB Output is correct
16 Correct 345 ms 229368 KB Output is correct
17 Correct 280 ms 229396 KB Output is correct
18 Correct 279 ms 229556 KB Output is correct
19 Correct 304 ms 228180 KB Output is correct
20 Correct 279 ms 229292 KB Output is correct
21 Correct 294 ms 229300 KB Output is correct
22 Correct 280 ms 229228 KB Output is correct
23 Correct 288 ms 229468 KB Output is correct
24 Correct 296 ms 229376 KB Output is correct
25 Correct 253 ms 226128 KB Output is correct
26 Correct 252 ms 225900 KB Output is correct
27 Correct 247 ms 229204 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 204032 KB Output is correct
2 Correct 146 ms 204380 KB Output is correct
3 Correct 129 ms 210768 KB Output is correct
4 Correct 135 ms 214540 KB Output is correct
5 Correct 105 ms 203348 KB Output is correct
6 Correct 100 ms 203352 KB Output is correct
7 Correct 132 ms 215964 KB Output is correct
8 Correct 132 ms 211476 KB Output is correct
9 Correct 123 ms 204336 KB Output is correct
10 Correct 127 ms 211028 KB Output is correct
11 Correct 136 ms 208216 KB Output is correct
12 Correct 132 ms 204276 KB Output is correct
13 Correct 126 ms 204340 KB Output is correct
14 Correct 132 ms 205632 KB Output is correct
15 Correct 130 ms 206536 KB Output is correct
16 Correct 130 ms 205616 KB Output is correct
17 Correct 118 ms 203908 KB Output is correct
18 Correct 131 ms 204116 KB Output is correct
19 Correct 101 ms 203372 KB Output is correct
20 Correct 102 ms 203348 KB Output is correct
21 Correct 179 ms 213076 KB Output is correct
22 Correct 202 ms 213092 KB Output is correct
23 Correct 214 ms 213104 KB Output is correct
24 Correct 203 ms 213076 KB Output is correct
25 Correct 226 ms 213076 KB Output is correct
26 Correct 241 ms 213072 KB Output is correct
27 Correct 126 ms 212308 KB Output is correct
28 Correct 132 ms 212308 KB Output is correct
29 Correct 189 ms 213024 KB Output is correct
30 Correct 184 ms 213076 KB Output is correct
31 Correct 186 ms 213120 KB Output is correct
32 Correct 192 ms 213328 KB Output is correct
33 Correct 184 ms 212952 KB Output is correct
34 Correct 196 ms 213136 KB Output is correct
35 Correct 230 ms 212988 KB Output is correct
36 Correct 255 ms 213360 KB Output is correct
37 Incorrect 129 ms 206208 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 117 ms 206416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 204032 KB Output is correct
2 Correct 146 ms 204380 KB Output is correct
3 Correct 129 ms 210768 KB Output is correct
4 Correct 135 ms 214540 KB Output is correct
5 Correct 105 ms 203348 KB Output is correct
6 Correct 100 ms 203352 KB Output is correct
7 Correct 132 ms 215964 KB Output is correct
8 Correct 132 ms 211476 KB Output is correct
9 Correct 123 ms 204336 KB Output is correct
10 Correct 127 ms 211028 KB Output is correct
11 Correct 136 ms 208216 KB Output is correct
12 Correct 132 ms 204276 KB Output is correct
13 Correct 126 ms 204340 KB Output is correct
14 Correct 132 ms 205632 KB Output is correct
15 Correct 130 ms 206536 KB Output is correct
16 Correct 130 ms 205616 KB Output is correct
17 Correct 118 ms 203908 KB Output is correct
18 Correct 131 ms 204116 KB Output is correct
19 Correct 101 ms 203372 KB Output is correct
20 Correct 102 ms 203348 KB Output is correct
21 Correct 131 ms 204172 KB Output is correct
22 Correct 141 ms 204540 KB Output is correct
23 Correct 126 ms 210876 KB Output is correct
24 Correct 152 ms 214676 KB Output is correct
25 Correct 103 ms 203348 KB Output is correct
26 Correct 106 ms 203344 KB Output is correct
27 Correct 131 ms 215548 KB Output is correct
28 Correct 129 ms 212304 KB Output is correct
29 Correct 128 ms 205960 KB Output is correct
30 Correct 131 ms 210748 KB Output is correct
31 Correct 125 ms 208208 KB Output is correct
32 Correct 124 ms 204112 KB Output is correct
33 Correct 128 ms 204372 KB Output is correct
34 Correct 134 ms 206660 KB Output is correct
35 Correct 127 ms 205140 KB Output is correct
36 Correct 132 ms 205392 KB Output is correct
37 Correct 101 ms 203348 KB Output is correct
38 Correct 99 ms 203352 KB Output is correct
39 Correct 179 ms 213076 KB Output is correct
40 Correct 202 ms 213092 KB Output is correct
41 Correct 214 ms 213104 KB Output is correct
42 Correct 203 ms 213076 KB Output is correct
43 Correct 226 ms 213076 KB Output is correct
44 Correct 241 ms 213072 KB Output is correct
45 Correct 126 ms 212308 KB Output is correct
46 Correct 132 ms 212308 KB Output is correct
47 Correct 189 ms 213024 KB Output is correct
48 Correct 184 ms 213076 KB Output is correct
49 Correct 186 ms 213120 KB Output is correct
50 Correct 192 ms 213328 KB Output is correct
51 Correct 184 ms 212952 KB Output is correct
52 Correct 196 ms 213136 KB Output is correct
53 Correct 230 ms 212988 KB Output is correct
54 Correct 255 ms 213360 KB Output is correct
55 Incorrect 129 ms 206208 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 204032 KB Output is correct
2 Correct 146 ms 204380 KB Output is correct
3 Correct 129 ms 210768 KB Output is correct
4 Correct 135 ms 214540 KB Output is correct
5 Correct 105 ms 203348 KB Output is correct
6 Correct 100 ms 203352 KB Output is correct
7 Correct 132 ms 215964 KB Output is correct
8 Correct 132 ms 211476 KB Output is correct
9 Correct 123 ms 204336 KB Output is correct
10 Correct 127 ms 211028 KB Output is correct
11 Correct 136 ms 208216 KB Output is correct
12 Correct 132 ms 204276 KB Output is correct
13 Correct 126 ms 204340 KB Output is correct
14 Correct 132 ms 205632 KB Output is correct
15 Correct 130 ms 206536 KB Output is correct
16 Correct 130 ms 205616 KB Output is correct
17 Correct 118 ms 203908 KB Output is correct
18 Correct 131 ms 204116 KB Output is correct
19 Correct 101 ms 203372 KB Output is correct
20 Correct 102 ms 203348 KB Output is correct
21 Correct 131 ms 204172 KB Output is correct
22 Correct 141 ms 204540 KB Output is correct
23 Correct 126 ms 210876 KB Output is correct
24 Correct 152 ms 214676 KB Output is correct
25 Correct 103 ms 203348 KB Output is correct
26 Correct 106 ms 203344 KB Output is correct
27 Correct 131 ms 215548 KB Output is correct
28 Correct 129 ms 212304 KB Output is correct
29 Correct 128 ms 205960 KB Output is correct
30 Correct 131 ms 210748 KB Output is correct
31 Correct 125 ms 208208 KB Output is correct
32 Correct 124 ms 204112 KB Output is correct
33 Correct 128 ms 204372 KB Output is correct
34 Correct 134 ms 206660 KB Output is correct
35 Correct 127 ms 205140 KB Output is correct
36 Correct 132 ms 205392 KB Output is correct
37 Correct 101 ms 203348 KB Output is correct
38 Correct 99 ms 203352 KB Output is correct
39 Correct 179 ms 213076 KB Output is correct
40 Correct 202 ms 213092 KB Output is correct
41 Correct 214 ms 213104 KB Output is correct
42 Correct 203 ms 213076 KB Output is correct
43 Correct 226 ms 213076 KB Output is correct
44 Correct 241 ms 213072 KB Output is correct
45 Correct 126 ms 212308 KB Output is correct
46 Correct 132 ms 212308 KB Output is correct
47 Correct 189 ms 213024 KB Output is correct
48 Correct 184 ms 213076 KB Output is correct
49 Correct 186 ms 213120 KB Output is correct
50 Correct 192 ms 213328 KB Output is correct
51 Correct 184 ms 212952 KB Output is correct
52 Correct 196 ms 213136 KB Output is correct
53 Correct 230 ms 212988 KB Output is correct
54 Correct 255 ms 213360 KB Output is correct
55 Correct 271 ms 225964 KB Output is correct
56 Correct 225 ms 219288 KB Output is correct
57 Correct 282 ms 229428 KB Output is correct
58 Correct 245 ms 225772 KB Output is correct
59 Correct 236 ms 222036 KB Output is correct
60 Correct 288 ms 229476 KB Output is correct
61 Correct 193 ms 218084 KB Output is correct
62 Correct 187 ms 217932 KB Output is correct
63 Correct 284 ms 229740 KB Output is correct
64 Correct 288 ms 229468 KB Output is correct
65 Correct 278 ms 229484 KB Output is correct
66 Correct 280 ms 229496 KB Output is correct
67 Correct 290 ms 229460 KB Output is correct
68 Correct 310 ms 229624 KB Output is correct
69 Correct 288 ms 230140 KB Output is correct
70 Correct 345 ms 229368 KB Output is correct
71 Correct 280 ms 229396 KB Output is correct
72 Correct 279 ms 229556 KB Output is correct
73 Correct 304 ms 228180 KB Output is correct
74 Correct 279 ms 229292 KB Output is correct
75 Correct 294 ms 229300 KB Output is correct
76 Correct 280 ms 229228 KB Output is correct
77 Correct 288 ms 229468 KB Output is correct
78 Correct 296 ms 229376 KB Output is correct
79 Correct 253 ms 226128 KB Output is correct
80 Correct 252 ms 225900 KB Output is correct
81 Correct 247 ms 229204 KB Output is correct
82 Incorrect 129 ms 206208 KB Output isn't correct
83 Halted 0 ms 0 KB -