oj.uz

Submission #718055

# Submission time Handle Problem Language Result Execution time Memory
718055 2023-04-03T09:04:40 Z vinnipuh01 Group Photo (JOI21_ho_t3) C++17
100 / 100
 3241 ms 67720 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
//#define int long long
#define sqrt sqrtl

using namespace std;

const long long oo = 1e9;

long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;


    freopen ( "sum.in", "r", stdin )
*/

int n, a[ 5001 ], t[ 20001 ], tt[ 20001 ], b[ 5001 ];
int dp[ 5002 ], d[ 5002 ][ 5002 ];

void build( int v, int tl, int tr ) {
	if ( tl == tr ) {
		t[ v ] = 1;
		return;
	}
	int mid = ( tl + tr ) / 2;
	build( v + v, tl, mid );
	build( v + v + 1, mid + 1, tr );
	t[ v ] = t[ v + v ] + t[ v + v + 1 ];
}

void build1( int v, int tl, int tr ) {
	tt[ v ] = 0;
	if ( tl == tr ) {
		return;
	}
	int mid = ( tl + tr ) / 2;
	build1( v + v, tl, mid );
	build1( v + v + 1, mid + 1, tr );
}

void upd( int v, int tl, int tr, int pos ) {
	if ( tl > pos || tr < pos )
		return;
	if ( tl == tr ) {
		t[ v ] = 0;
		tt[ v ] = 1;
		return;
	}
	int mid = ( tl + tr ) / 2;
	upd( v + v, tl, mid, pos );
	upd( v + v + 1, mid + 1, tr, pos );
	t[ v ] = t[ v + v ] + t[ v + v + 1 ];
	tt[ v ] = tt[ v + v ] + tt[ v + v + 1 ];
}


void gett( int v, int tl, int tr, int pos ) {
	if ( tl > pos ) {
		sum += tt[ v ];
		return;
	}
	if ( tr < pos ) {
		num += t[ v ];
		return;
	}
	if ( tl == tr ) {
		return;
	}
	int mid = ( tl + tr ) / 2;
	gett( v + v, tl, mid, pos );
	gett( v + v + 1, mid + 1, tr, pos );
}

main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin >> n;
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ];
		b[ a[ i ] ] = i;
		dp[ i ] = oo;
	}
	build( 1, 1, n );
	for ( int i = 1; i <= n; i ++ ) {
		build1( 1, 1, n );
		for ( int j = i; j >= 1; j -- ) {
			d[ j ][ i ] = d[ j + 1 ][ i ];
			upd( 1, 1, n, b[ j ] );
			num = sum = 0;
			gett( 1, 1, n, b[ j ] );
			d[ j ][ i ] += num;
			d[ j ][ i ] += sum;
//			cout << j << " " << i << " - " << d[ j ][ i ] << "\n";
		}
	}
	for ( int i = 1; i <= n; i ++ ) {
		for ( int j = i - 1; j >= 0; j -- ) {
			dp[ i ] = min( dp[ i ], dp[ j ] + d[ j + 1 ][ i ] );
		}
	}
	cout << dp[ n ];
}

/*

h[ i ] + i * 2 < h[ i + 1 ] + i * 2 + 4

h[ i ] - h[ i + 1 ] < 4

3 5 2 4 1
5 9 8 14 13

*/

Compilation message

Main.cpp:102:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  102 | main () {
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 1236 KB Output is correct
22 Correct 4 ms 1236 KB Output is correct
23 Correct 3 ms 1236 KB Output is correct
24 Correct 3 ms 1236 KB Output is correct
25 Correct 3 ms 1172 KB Output is correct
26 Correct 3 ms 1236 KB Output is correct
27 Correct 5 ms 1236 KB Output is correct
28 Correct 3 ms 1236 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 3 ms 1236 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 1236 KB Output is correct
22 Correct 4 ms 1236 KB Output is correct
23 Correct 3 ms 1236 KB Output is correct
24 Correct 3 ms 1236 KB Output is correct
25 Correct 3 ms 1172 KB Output is correct
26 Correct 3 ms 1236 KB Output is correct
27 Correct 5 ms 1236 KB Output is correct
28 Correct 3 ms 1236 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 3 ms 1236 KB Output is correct
31 Correct 58 ms 4772 KB Output is correct
32 Correct 57 ms 4828 KB Output is correct
33 Correct 55 ms 4812 KB Output is correct
34 Correct 54 ms 4812 KB Output is correct
35 Correct 56 ms 4812 KB Output is correct
36 Correct 57 ms 4780 KB Output is correct
37 Correct 64 ms 4812 KB Output is correct
38 Correct 73 ms 4780 KB Output is correct
39 Correct 55 ms 4768 KB Output is correct
40 Correct 54 ms 4788 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 1236 KB Output is correct
22 Correct 4 ms 1236 KB Output is correct
23 Correct 3 ms 1236 KB Output is correct
24 Correct 3 ms 1236 KB Output is correct
25 Correct 3 ms 1172 KB Output is correct
26 Correct 3 ms 1236 KB Output is correct
27 Correct 5 ms 1236 KB Output is correct
28 Correct 3 ms 1236 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 3 ms 1236 KB Output is correct
31 Correct 58 ms 4772 KB Output is correct
32 Correct 57 ms 4828 KB Output is correct
33 Correct 55 ms 4812 KB Output is correct
34 Correct 54 ms 4812 KB Output is correct
35 Correct 56 ms 4812 KB Output is correct
36 Correct 57 ms 4780 KB Output is correct
37 Correct 64 ms 4812 KB Output is correct
38 Correct 73 ms 4780 KB Output is correct
39 Correct 55 ms 4768 KB Output is correct
40 Correct 54 ms 4788 KB Output is correct
41 Correct 3194 ms 67304 KB Output is correct
42 Correct 3241 ms 67440 KB Output is correct
43 Correct 3082 ms 67372 KB Output is correct
44 Correct 3085 ms 67344 KB Output is correct
45 Correct 3114 ms 67436 KB Output is correct
46 Correct 3159 ms 67484 KB Output is correct
47 Correct 3109 ms 67496 KB Output is correct
48 Correct 3232 ms 67480 KB Output is correct
49 Correct 3108 ms 67496 KB Output is correct
50 Correct 3067 ms 67380 KB Output is correct
51 Correct 3066 ms 67496 KB Output is correct
52 Correct 3115 ms 67452 KB Output is correct
53 Correct 3040 ms 67388 KB Output is correct
54 Correct 3117 ms 67720 KB Output is correct
55 Correct 3051 ms 67520 KB Output is correct