oj.uz

답안 #718041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718041 2023-04-03T08:29:25 Z vinnipuh01 Group Photo (JOI21_ho_t3) C++17
64 / 100
 5000 ms 99588 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 = 1000000000000000000;

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


/*
    ViHHiPuh

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


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

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

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

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

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;
		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 ];
}

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

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

main () {
	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 = 0;
			gett( 1, 1, n, 1, b[ j ] );
			d[ j ][ i ] += num;
			sum = 0;
			gett( 1, 1, n, b[ j ], n );
			d[ j ][ i ] += sum;
//			cout << j << " " << i << " - " << d[ j ][ i ] << "\n";
			upd1( 1, 1, n, b[ j ] );
		}
	}
	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:110:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  110 | main () {
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 308 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 6 ms 1204 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 7 ms 1204 KB Output is correct
24 Correct 7 ms 1364 KB Output is correct
25 Correct 6 ms 1212 KB Output is correct
26 Correct 10 ms 1200 KB Output is correct
27 Correct 6 ms 1236 KB Output is correct
28 Correct 9 ms 1236 KB Output is correct
29 Correct 6 ms 1204 KB Output is correct
30 Correct 6 ms 1200 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 6 ms 1204 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 7 ms 1204 KB Output is correct
24 Correct 7 ms 1364 KB Output is correct
25 Correct 6 ms 1212 KB Output is correct
26 Correct 10 ms 1200 KB Output is correct
27 Correct 6 ms 1236 KB Output is correct
28 Correct 9 ms 1236 KB Output is correct
29 Correct 6 ms 1204 KB Output is correct
30 Correct 6 ms 1200 KB Output is correct
31 Correct 102 ms 6092 KB Output is correct
32 Correct 104 ms 6064 KB Output is correct
33 Correct 113 ms 6012 KB Output is correct
34 Correct 117 ms 6048 KB Output is correct
35 Correct 114 ms 6092 KB Output is correct
36 Correct 105 ms 6108 KB Output is correct
37 Correct 125 ms 6060 KB Output is correct
38 Correct 124 ms 6092 KB Output is correct
39 Correct 134 ms 6112 KB Output is correct
40 Correct 105 ms 6012 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 6 ms 1204 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 7 ms 1204 KB Output is correct
24 Correct 7 ms 1364 KB Output is correct
25 Correct 6 ms 1212 KB Output is correct
26 Correct 10 ms 1200 KB Output is correct
27 Correct 6 ms 1236 KB Output is correct
28 Correct 9 ms 1236 KB Output is correct
29 Correct 6 ms 1204 KB Output is correct
30 Correct 6 ms 1200 KB Output is correct
31 Correct 102 ms 6092 KB Output is correct
32 Correct 104 ms 6064 KB Output is correct
33 Correct 113 ms 6012 KB Output is correct
34 Correct 117 ms 6048 KB Output is correct
35 Correct 114 ms 6092 KB Output is correct
36 Correct 105 ms 6108 KB Output is correct
37 Correct 125 ms 6060 KB Output is correct
38 Correct 124 ms 6092 KB Output is correct
39 Correct 134 ms 6112 KB Output is correct
40 Correct 105 ms 6012 KB Output is correct
41 Execution timed out 5040 ms 99588 KB Time limit exceeded
42 Halted 0 ms 0 KB -