oj.uz

답안 #532921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532921 2022-03-04T08:36:17 Z vinnipuh01 밀림 점프 (APIO21_jumps) C++17
24 / 100
 1355 ms 102944 KB 
//#include "jump.h"
 
#include <bits/stdc++.h>
#include <vector>
 
using namespace std;
int n, par[ 200001 ][ 21 ], parr[ 200001 ][ 21 ], dist[ 200001 ][ 21 ], distt[ 200001 ][ 21 ];
int lg = 20;
int a[ 200001 ], l[ 200001 ], r[ 200001 ], sum = 0;
vector <int> v[ 200001 ], vv;
vector <pair<int, int> > v1;

bool ok;
 
void init(int N, vector<int> H) {
	n = N;
	for ( int i = 0 ; i < H.size(); i ++ ) {
		a[ i + 1 ] = H[ i ];
		v1.push_back( { a[ i + 1 ], i + 1 } );
	}
	sort( v1.begin(), v1.end() );
	for ( int i = 1; i <= n; i ++ ) {
		while ( vv.size() && a[ vv.back() ] < a[ i ] ) {
			vv.pop_back();
		}
		if ( vv.size() ) {
			v[ i ].push_back( vv.back() );
		}
		vv.push_back( i );
	}
	vv.clear();
	for ( int i = n; i >= 1; i -- ) {
		while ( vv.size() && a[ vv.back() ] < a[ i ] ) {
			vv.pop_back();
		}
		if ( vv.size() )
			v[ i ].push_back( vv.back() );
		vv.push_back( i );
	}
	for ( int i = 1; i <= n; i ++ ) {
		if ( v[ i ].size() == 1 ) {
			parr[ i ][ 0 ] = v[ i ].back();
			par[ i ][ 0 ] = i;
			dist[ i ][ 0 ] = 0;
			distt[ i ][ 0 ] = 1;
		}
		else if ( v[ i ].size() == 2 ) {
			if ( a[ v[ i ].back() ] > a[ v[ i ].front() ] ) {
				par[ i ][ 0 ] = v[ i ].back();
				parr[ i ][ 0 ] = v[ i ].front();
			}
			else {
				par[ i ][ 0 ] = v[ i ].front();
				parr[ i ][ 0 ] = v[ i ].back();
			}
			dist[  i][ 0 ] = distt[ i ][ 0 ] = 1;
		}
		else {
			par[ i ][ 0 ] = parr[ i ][ 0 ] = i;
			dist[ i ][ 0 ] = distt[ i ][ 0 ] = 0;
		}
	}
	for ( int i = v1.size() - 1; i >= 0; i -- ) {
		for ( int j = 1; j <= lg; j ++ ) {
			par[ v1[ i ].second ][ j ] = par[ par[ v1[ i ].second ][ j - 1 ]][ j - 1 ];
			dist[ v1[ i ].second ][ j ] = dist[ par[ v1[ i ].second ][ j - 1 ] ][ j - 1 ] + dist[ v1[ i ].second ][ j - 1 ];
			parr[ v1[ i ].second ][ j ] = parr[ parr[ v1[ i ].second ][ j - 1 ] ][ j - 1 ];
			distt[ v1[ i ].second ][ j ] = distt[ par[ v1[ i ].second ][ j - 1 ] ][ j - 1 ] + distt[ v1[ i ].second ][ j - 1 ];
		}
	}
	for ( int i = n; i > 1; i -- ) {
		if ( a[ i ] <= a[ i - 1 ] )
			ok = 1;
	}
}
 
const long long oo = 1e18;
long long mx, mn;
int c, f;
map <int, long long> d;
map <int, bool> used;
queue <int> q;
 
long long int bfs() {
	mx = oo;
	while ( q.size() ) {
		int g = q.front();
		q.pop();
		for ( auto to : v[ g ] ) {
			if ( !used[ to ] || d[ to ] > d[ g ] + 1 ) {
				d[ to ] = d[ g ] + 1;
				q.push( to );
				if ( to >= c && to <= f ) {
					mx = min( d[ g ] + 1, mx );
				}
				used[ to ] = 1;
			}
		}
	}
	while( q.size() )
		q.pop();
	return mx;
}

pair<int,int> lca( int aa, int b ) {
	int sum = 0;
	if ( aa == b )
		return { aa, 0 };
	for ( int i = lg; i >= 0; i -- ) {
		if ( a[ par[ aa ][ i ] ] <= a[ b ] ) {
			sum += dist[ aa ][ i ];
			aa = par[ aa ][ i ];
		}
	}
	return { aa, sum };
}

pair<int,int> lca1( int aa, int b ) {
	if ( aa == b )
		return { aa, 0 };
	int sum = 0;
	for ( int i = lg; i >= 0; i -- ) {
		if ( a[ parr[ aa ][ i ] ] < a[ b ] ) {
			sum += distt[ aa ][ i ];
			aa = parr[ aa ][ i ];
		}
	}
	return { parr[ aa ][ 0 ], sum + distt[ aa ][ 0 ] };
}

int minimum_jumps(int A, int B, int C, int D) {
	A ++;
	B ++;
	C ++;
	D ++;
	if ( !ok ) {
		if ( C > B )
			return C - B;
		else
			return A - D;
	}
	if ( A == B && C == D ) {
		pair<int, int> p;
		p = lca( A, C );
		sum = p.second;
		p = lca1( p.first, C );
		if ( p.first == C )
			return sum + p.second;
		return -1;
	}
	d.clear();
	used.clear();
	c = C;
	f = D;
	mn = oo;
	for ( int i = A; i <= B; i ++ ) {
		q.push( i );
		used[ i ] = 1;
	}
	mn = bfs(  );
	if ( mn == oo )
		return -1;
  return mn;
}


//int main () {
//	int n;
//	cin >> n;
//	int a;
//	vector <int> v;
//	v.clear();
//	for ( int i = 1; i <= n; i ++ )
//		cin >> a, v.push_back( a );
//	init( n, v );
//	int m, a, b, c, d;
//	cin >> m;
//	while ( m -- ) {
//		cin >> a >> b >> c >> d;
//		
//	}
//}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for ( int i = 0 ; i < H.size(); i ++ ) {
      |                    ~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 215 ms 66012 KB Output is correct
4 Correct 1355 ms 81640 KB Output is correct
5 Correct 859 ms 43644 KB Output is correct
6 Correct 1022 ms 81704 KB Output is correct
7 Correct 659 ms 57704 KB Output is correct
8 Correct 1070 ms 81660 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Correct 5 ms 5036 KB Output is correct
6 Correct 12 ms 5064 KB Output is correct
7 Correct 9 ms 5064 KB Output is correct
8 Correct 9 ms 5064 KB Output is correct
9 Correct 5 ms 5064 KB Output is correct
10 Correct 9 ms 5120 KB Output is correct
11 Correct 5 ms 5064 KB Output is correct
12 Correct 11 ms 5064 KB Output is correct
13 Correct 11 ms 5064 KB Output is correct
14 Correct 9 ms 5128 KB Output is correct
15 Correct 16 ms 5064 KB Output is correct
16 Correct 14 ms 5064 KB Output is correct
17 Correct 9 ms 5064 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 10 ms 5064 KB Output is correct
21 Correct 12 ms 5064 KB Output is correct
22 Correct 13 ms 5128 KB Output is correct
23 Correct 16 ms 5064 KB Output is correct
24 Correct 10 ms 5064 KB Output is correct
25 Correct 4 ms 4936 KB Output is correct
26 Correct 3 ms 4936 KB Output is correct
27 Correct 4 ms 4988 KB Output is correct
28 Correct 7 ms 5064 KB Output is correct
29 Correct 5 ms 5064 KB Output is correct
30 Correct 5 ms 5064 KB Output is correct
31 Correct 5 ms 5000 KB Output is correct
32 Correct 5 ms 5064 KB Output is correct
33 Correct 3 ms 4936 KB Output is correct
34 Correct 4 ms 5064 KB Output is correct
35 Correct 3 ms 5112 KB Output is correct
36 Correct 3 ms 5064 KB Output is correct
37 Correct 3 ms 5116 KB Output is correct
38 Correct 4 ms 5064 KB Output is correct
39 Correct 3 ms 5064 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Correct 5 ms 5036 KB Output is correct
6 Correct 12 ms 5064 KB Output is correct
7 Correct 9 ms 5064 KB Output is correct
8 Correct 9 ms 5064 KB Output is correct
9 Correct 5 ms 5064 KB Output is correct
10 Correct 9 ms 5120 KB Output is correct
11 Correct 5 ms 5064 KB Output is correct
12 Correct 11 ms 5064 KB Output is correct
13 Correct 11 ms 5064 KB Output is correct
14 Correct 9 ms 5128 KB Output is correct
15 Correct 16 ms 5064 KB Output is correct
16 Correct 14 ms 5064 KB Output is correct
17 Correct 9 ms 5064 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 10 ms 5064 KB Output is correct
21 Correct 12 ms 5064 KB Output is correct
22 Correct 13 ms 5128 KB Output is correct
23 Correct 16 ms 5064 KB Output is correct
24 Correct 10 ms 5064 KB Output is correct
25 Correct 4 ms 4936 KB Output is correct
26 Correct 3 ms 4936 KB Output is correct
27 Correct 4 ms 4988 KB Output is correct
28 Correct 7 ms 5064 KB Output is correct
29 Correct 5 ms 5064 KB Output is correct
30 Correct 5 ms 5064 KB Output is correct
31 Correct 5 ms 5000 KB Output is correct
32 Correct 5 ms 5064 KB Output is correct
33 Correct 3 ms 4936 KB Output is correct
34 Correct 4 ms 5064 KB Output is correct
35 Correct 3 ms 5112 KB Output is correct
36 Correct 3 ms 5064 KB Output is correct
37 Correct 3 ms 5116 KB Output is correct
38 Correct 4 ms 5064 KB Output is correct
39 Correct 3 ms 5064 KB Output is correct
40 Correct 3 ms 4936 KB Output is correct
41 Correct 3 ms 4936 KB Output is correct
42 Correct 3 ms 4936 KB Output is correct
43 Correct 3 ms 4936 KB Output is correct
44 Correct 5 ms 4936 KB Output is correct
45 Correct 9 ms 5064 KB Output is correct
46 Correct 7 ms 5064 KB Output is correct
47 Correct 10 ms 5072 KB Output is correct
48 Correct 4 ms 5064 KB Output is correct
49 Correct 11 ms 5064 KB Output is correct
50 Correct 6 ms 5064 KB Output is correct
51 Correct 10 ms 5116 KB Output is correct
52 Correct 10 ms 5064 KB Output is correct
53 Correct 9 ms 5064 KB Output is correct
54 Correct 15 ms 5112 KB Output is correct
55 Correct 14 ms 5064 KB Output is correct
56 Correct 11 ms 5064 KB Output is correct
57 Correct 3 ms 5064 KB Output is correct
58 Correct 309 ms 5832 KB Output is correct
59 Correct 513 ms 5996 KB Output is correct
60 Correct 68 ms 5412 KB Output is correct
61 Correct 466 ms 6100 KB Output is correct
62 Correct 50 ms 5064 KB Output is correct
63 Correct 470 ms 5980 KB Output is correct
64 Correct 24 ms 5704 KB Output is correct
65 Correct 752 ms 6020 KB Output is correct
66 Correct 807 ms 6012 KB Output is correct
67 Correct 448 ms 6104 KB Output is correct
68 Correct 1199 ms 6016 KB Output is correct
69 Correct 952 ms 6012 KB Output is correct
70 Correct 1107 ms 5960 KB Output is correct
71 Correct 4 ms 4940 KB Output is correct
72 Correct 3 ms 4936 KB Output is correct
73 Correct 9 ms 5116 KB Output is correct
74 Correct 10 ms 5064 KB Output is correct
75 Correct 8 ms 5064 KB Output is correct
76 Correct 15 ms 5064 KB Output is correct
77 Correct 10 ms 5064 KB Output is correct
78 Correct 3 ms 4936 KB Output is correct
79 Correct 3 ms 4936 KB Output is correct
80 Correct 4 ms 5064 KB Output is correct
81 Correct 6 ms 5064 KB Output is correct
82 Correct 5 ms 5112 KB Output is correct
83 Correct 5 ms 5064 KB Output is correct
84 Correct 6 ms 5064 KB Output is correct
85 Correct 4 ms 5064 KB Output is correct
86 Correct 3 ms 4936 KB Output is correct
87 Correct 3 ms 5064 KB Output is correct
88 Correct 3 ms 5064 KB Output is correct
89 Correct 3 ms 5112 KB Output is correct
90 Correct 3 ms 5064 KB Output is correct
91 Correct 3 ms 5064 KB Output is correct
92 Correct 4 ms 5064 KB Output is correct
93 Correct 3 ms 5064 KB Output is correct
94 Correct 18 ms 5064 KB Output is correct
95 Correct 457 ms 5960 KB Output is correct
96 Correct 602 ms 5960 KB Output is correct
97 Correct 445 ms 5968 KB Output is correct
98 Correct 1298 ms 6016 KB Output is correct
99 Correct 475 ms 6012 KB Output is correct
100 Correct 3 ms 5064 KB Output is correct
101 Correct 4 ms 5320 KB Output is correct
102 Correct 14 ms 5780 KB Output is correct
103 Correct 29 ms 5704 KB Output is correct
104 Incorrect 25 ms 5704 KB Output isn't correct
105 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Correct 242 ms 74228 KB Output is correct
6 Correct 312 ms 87840 KB Output is correct
7 Correct 122 ms 43896 KB Output is correct
8 Correct 384 ms 101004 KB Output is correct
9 Correct 45 ms 18236 KB Output is correct
10 Correct 268 ms 86416 KB Output is correct
11 Correct 168 ms 81836 KB Output is correct
12 Correct 701 ms 101300 KB Output is correct
13 Correct 381 ms 96892 KB Output is correct
14 Correct 285 ms 85696 KB Output is correct
15 Correct 641 ms 102428 KB Output is correct
16 Correct 492 ms 102884 KB Output is correct
17 Correct 677 ms 102944 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 3 ms 5064 KB Output is correct
20 Correct 3 ms 5064 KB Output is correct
21 Correct 3 ms 5064 KB Output is correct
22 Correct 3 ms 5064 KB Output is correct
23 Correct 4 ms 5064 KB Output is correct
24 Correct 3 ms 5064 KB Output is correct
25 Correct 3 ms 5064 KB Output is correct
26 Correct 5 ms 5388 KB Output is correct
27 Correct 7 ms 5840 KB Output is correct
28 Correct 7 ms 5960 KB Output is correct
29 Correct 7 ms 5788 KB Output is correct
30 Correct 9 ms 5924 KB Output is correct
31 Correct 8 ms 5912 KB Output is correct
32 Correct 3 ms 4936 KB Output is correct
33 Correct 228 ms 80928 KB Output is correct
34 Correct 314 ms 88532 KB Output is correct
35 Correct 388 ms 96336 KB Output is correct
36 Correct 240 ms 83600 KB Output is correct
37 Correct 395 ms 99604 KB Output is correct
38 Correct 321 ms 102860 KB Output is correct
39 Correct 3 ms 4936 KB Output is correct
40 Correct 141 ms 48908 KB Output is correct
41 Correct 219 ms 80876 KB Output is correct
42 Correct 140 ms 81584 KB Output is correct
43 Correct 231 ms 80892 KB Output is correct
44 Correct 189 ms 81288 KB Output is correct
45 Correct 161 ms 81672 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 336 ms 39748 KB Output is correct
5 Correct 1198 ms 80932 KB Output is correct
6 Correct 668 ms 17472 KB Output is correct
7 Correct 1164 ms 81020 KB Output is correct
8 Correct 638 ms 31160 KB Output is correct
9 Correct 973 ms 80868 KB Output is correct
10 Correct 1073 ms 81636 KB Output is correct
11 Correct 1167 ms 82076 KB Output is correct
12 Correct 1355 ms 81616 KB Output is correct
13 Correct 1249 ms 80944 KB Output is correct
14 Correct 1279 ms 81252 KB Output is correct
15 Correct 1086 ms 81720 KB Output is correct
16 Correct 1073 ms 81656 KB Output is correct
17 Correct 3 ms 4936 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 5 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 5 ms 5012 KB Output is correct
23 Correct 5 ms 5104 KB Output is correct
24 Correct 5 ms 5064 KB Output is correct
25 Correct 3 ms 5020 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 25 ms 5704 KB Output is correct
28 Correct 24 ms 5704 KB Output is correct
29 Incorrect 26 ms 5704 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 336 ms 39748 KB Output is correct
5 Correct 1198 ms 80932 KB Output is correct
6 Correct 668 ms 17472 KB Output is correct
7 Correct 1164 ms 81020 KB Output is correct
8 Correct 638 ms 31160 KB Output is correct
9 Correct 973 ms 80868 KB Output is correct
10 Correct 1073 ms 81636 KB Output is correct
11 Correct 1167 ms 82076 KB Output is correct
12 Correct 1355 ms 81616 KB Output is correct
13 Correct 1249 ms 80944 KB Output is correct
14 Correct 1279 ms 81252 KB Output is correct
15 Correct 1086 ms 81720 KB Output is correct
16 Correct 1073 ms 81656 KB Output is correct
17 Correct 3 ms 4936 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 4 ms 4936 KB Output is correct
20 Correct 5 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 5 ms 5012 KB Output is correct
23 Correct 5 ms 5104 KB Output is correct
24 Correct 5 ms 5064 KB Output is correct
25 Correct 3 ms 5020 KB Output is correct
26 Correct 4 ms 5320 KB Output is correct
27 Correct 25 ms 5704 KB Output is correct
28 Correct 24 ms 5704 KB Output is correct
29 Incorrect 26 ms 5704 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 215 ms 66012 KB Output is correct
4 Correct 1355 ms 81640 KB Output is correct
5 Correct 859 ms 43644 KB Output is correct
6 Correct 1022 ms 81704 KB Output is correct
7 Correct 659 ms 57704 KB Output is correct
8 Correct 1070 ms 81660 KB Output is correct
9 Correct 3 ms 4936 KB Output is correct
10 Correct 3 ms 4936 KB Output is correct
11 Correct 3 ms 4936 KB Output is correct
12 Correct 3 ms 4936 KB Output is correct
13 Correct 5 ms 5036 KB Output is correct
14 Correct 12 ms 5064 KB Output is correct
15 Correct 9 ms 5064 KB Output is correct
16 Correct 9 ms 5064 KB Output is correct
17 Correct 5 ms 5064 KB Output is correct
18 Correct 9 ms 5120 KB Output is correct
19 Correct 5 ms 5064 KB Output is correct
20 Correct 11 ms 5064 KB Output is correct
21 Correct 11 ms 5064 KB Output is correct
22 Correct 9 ms 5128 KB Output is correct
23 Correct 16 ms 5064 KB Output is correct
24 Correct 14 ms 5064 KB Output is correct
25 Correct 9 ms 5064 KB Output is correct
26 Correct 3 ms 4936 KB Output is correct
27 Correct 4 ms 4936 KB Output is correct
28 Correct 10 ms 5064 KB Output is correct
29 Correct 12 ms 5064 KB Output is correct
30 Correct 13 ms 5128 KB Output is correct
31 Correct 16 ms 5064 KB Output is correct
32 Correct 10 ms 5064 KB Output is correct
33 Correct 4 ms 4936 KB Output is correct
34 Correct 3 ms 4936 KB Output is correct
35 Correct 4 ms 4988 KB Output is correct
36 Correct 7 ms 5064 KB Output is correct
37 Correct 5 ms 5064 KB Output is correct
38 Correct 5 ms 5064 KB Output is correct
39 Correct 5 ms 5000 KB Output is correct
40 Correct 5 ms 5064 KB Output is correct
41 Correct 3 ms 4936 KB Output is correct
42 Correct 4 ms 5064 KB Output is correct
43 Correct 3 ms 5112 KB Output is correct
44 Correct 3 ms 5064 KB Output is correct
45 Correct 3 ms 5116 KB Output is correct
46 Correct 4 ms 5064 KB Output is correct
47 Correct 3 ms 5064 KB Output is correct
48 Correct 3 ms 4936 KB Output is correct
49 Correct 3 ms 4936 KB Output is correct
50 Correct 3 ms 4936 KB Output is correct
51 Correct 3 ms 4936 KB Output is correct
52 Correct 5 ms 4936 KB Output is correct
53 Correct 9 ms 5064 KB Output is correct
54 Correct 7 ms 5064 KB Output is correct
55 Correct 10 ms 5072 KB Output is correct
56 Correct 4 ms 5064 KB Output is correct
57 Correct 11 ms 5064 KB Output is correct
58 Correct 6 ms 5064 KB Output is correct
59 Correct 10 ms 5116 KB Output is correct
60 Correct 10 ms 5064 KB Output is correct
61 Correct 9 ms 5064 KB Output is correct
62 Correct 15 ms 5112 KB Output is correct
63 Correct 14 ms 5064 KB Output is correct
64 Correct 11 ms 5064 KB Output is correct
65 Correct 3 ms 5064 KB Output is correct
66 Correct 309 ms 5832 KB Output is correct
67 Correct 513 ms 5996 KB Output is correct
68 Correct 68 ms 5412 KB Output is correct
69 Correct 466 ms 6100 KB Output is correct
70 Correct 50 ms 5064 KB Output is correct
71 Correct 470 ms 5980 KB Output is correct
72 Correct 24 ms 5704 KB Output is correct
73 Correct 752 ms 6020 KB Output is correct
74 Correct 807 ms 6012 KB Output is correct
75 Correct 448 ms 6104 KB Output is correct
76 Correct 1199 ms 6016 KB Output is correct
77 Correct 952 ms 6012 KB Output is correct
78 Correct 1107 ms 5960 KB Output is correct
79 Correct 4 ms 4940 KB Output is correct
80 Correct 3 ms 4936 KB Output is correct
81 Correct 9 ms 5116 KB Output is correct
82 Correct 10 ms 5064 KB Output is correct
83 Correct 8 ms 5064 KB Output is correct
84 Correct 15 ms 5064 KB Output is correct
85 Correct 10 ms 5064 KB Output is correct
86 Correct 3 ms 4936 KB Output is correct
87 Correct 3 ms 4936 KB Output is correct
88 Correct 4 ms 5064 KB Output is correct
89 Correct 6 ms 5064 KB Output is correct
90 Correct 5 ms 5112 KB Output is correct
91 Correct 5 ms 5064 KB Output is correct
92 Correct 6 ms 5064 KB Output is correct
93 Correct 4 ms 5064 KB Output is correct
94 Correct 3 ms 4936 KB Output is correct
95 Correct 3 ms 5064 KB Output is correct
96 Correct 3 ms 5064 KB Output is correct
97 Correct 3 ms 5112 KB Output is correct
98 Correct 3 ms 5064 KB Output is correct
99 Correct 3 ms 5064 KB Output is correct
100 Correct 4 ms 5064 KB Output is correct
101 Correct 3 ms 5064 KB Output is correct
102 Correct 18 ms 5064 KB Output is correct
103 Correct 457 ms 5960 KB Output is correct
104 Correct 602 ms 5960 KB Output is correct
105 Correct 445 ms 5968 KB Output is correct
106 Correct 1298 ms 6016 KB Output is correct
107 Correct 475 ms 6012 KB Output is correct
108 Correct 3 ms 5064 KB Output is correct
109 Correct 4 ms 5320 KB Output is correct
110 Correct 14 ms 5780 KB Output is correct
111 Correct 29 ms 5704 KB Output is correct
112 Incorrect 25 ms 5704 KB Output isn't correct
113 Halted 0 ms 0 KB -