oj.uz

Submission #889543

# Submission time Handle Problem Language Result Execution time Memory
889543 2023-12-20T01:33:16 Z thunopro Chorus (JOI23_chorus) C++14
61 / 100
 1280 ms 296332 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#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 , k ; 

int a [maxn] ; 
int b [maxn] ; 
int res = 0 ; 

void init_array () 
{
	int deg = 0 , cnt = 0 , num = 0 ; 
	for ( int i = 1 ; i <= n*2 ; i ++ ) 
	{
		if ( a [i] == 0 ) 
		{
			b [++num] = a [i] ; deg ++ ; res += cnt ; 
			if ( cnt > 0 && deg > 0 ) b [++num] = 1 , cnt -- , deg -- ; 
		}
		else 
		{
			if ( deg > 0 ) b [++num] = a [i] , deg -- ; 
			else cnt ++ ; 
		}
	}
	while ( cnt > 0 ) b[++num] = 1 , cnt -- ; 
}

int point [5009][5009] ; 
int sum [5009][5009] ; 
int dp [5009][5009] ; 

void build_cost () 
{
	int x = 0 , y = 0 ; 
	for ( int i = 1 ; i <= n*2 ; i ++ ) 
	{
		if ( b [i] ) y ++ ; 
		else 
		{
			for ( int r = 0 ; r <= y ; r ++ ) point [x][r] = 1 ;  
			x ++ ; 
		} 
	}
	for ( int i = 0 ; i <= n ; i ++ ) 
	{
		for ( int j = n ; j >= 0 ; j -- ) 
		{
			sum [i][j] = sum [i][j+1] + point [i][j] ; 
			if ( i > 0 ) sum [i][j] = sum [i][j] + sum [i-1][j] - sum [i-1][j+1] ; 
		}
	}
}

int get_cost ( int l , int r ) 
{
	if ( l == r ) return 0 ; 
	if ( l+1 == r ) return 0 ;
	return sum [r-1][l+1] ; 
}
void sub1 () 
{
	build_cost () ; 
	
	memset ( dp , 0x3f , sizeof dp ) ; 
	dp [0][0] = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		for ( int j = 0 ; j < i ; j ++ ) 
		{
			int cost = sum [i-1][j+1] ; 
			if ( i == j+1 ) cost = 0 ; 
			for ( int t = 1 ; t <= k ; t ++ ) chkmin (dp[i][t],dp[j][t-1]+cost) ; 
		}
	}
	int Min = INF ; 
	for ( int i = 0 ; i <= k ; i ++ ) chkmin (Min,dp[n][i]) ; 
	
	cout << res + Min ; 
}

void dnc ( int l , int r , int optl , int optr , int j ) 
{
	if ( l > r ) return ; 
	int mid = (l+r)/2 ; 
	int opt ; 
	for ( int i = optl ; i <= min (optr,mid) ; i ++ ) 
	{
		if ( dp [mid][j] > dp [i][j-1] + get_cost (i,mid) ) 
		{
			dp [mid][j] = dp [i][j-1] + get_cost (i,mid) ; 
			opt = i ; 
		}
	}
	dnc (l,mid-1,optl,opt,j) ; 
	dnc (mid+1,r,opt,optr,j) ;  
}
void sub2 () 
{
	build_cost () ;
	memset ( dp , 0x3f , sizeof dp ) ; 
	for ( int i = 1 ; i <= n ; i ++ ) dp [i][1] = get_cost (0,i) ;
	for ( int i = 2 ; i <= k ; i ++ ) dnc (1,n,1,n,i) ;
	int Min = INF ; 
	for ( int i = 0 ; i <= k ; i ++ ) chkmin (Min,dp[n][i]) ; 
	cout << res + Min ; 
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> k ; 
	for ( int i = 1 ; i <= n*2 ; i ++ ) 
	{
		char c ; cin >> c ;
		a [i] = c - 'A' ;
	}
	
	init_array () ; 
	
	sub2 () ; re
	if ( n <= 500 ) sub1 () ; 
	else sub2 () ; 
}

Compilation message

chorus.cpp: In function 'void rf()':
chorus.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) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
chorus.cpp: In function 'void dnc(int, int, int, int, int)':
chorus.cpp:137:6: warning: 'opt' may be used uninitialized in this function [-Wmaybe-uninitialized]
  137 |  dnc (l,mid-1,optl,opt,j) ;
      |  ~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 102736 KB Output is correct
2 Correct 13 ms 102900 KB Output is correct
3 Correct 12 ms 102748 KB Output is correct
4 Correct 12 ms 102664 KB Output is correct
5 Correct 14 ms 102744 KB Output is correct
6 Correct 13 ms 102748 KB Output is correct
7 Correct 12 ms 102748 KB Output is correct
8 Correct 12 ms 102748 KB Output is correct
9 Correct 12 ms 102748 KB Output is correct
10 Correct 12 ms 102744 KB Output is correct
11 Correct 12 ms 102748 KB Output is correct
12 Correct 13 ms 102748 KB Output is correct
13 Correct 12 ms 102744 KB Output is correct
14 Correct 12 ms 102748 KB Output is correct
15 Correct 13 ms 102744 KB Output is correct
16 Correct 13 ms 102748 KB Output is correct
17 Correct 14 ms 107612 KB Output is correct
18 Correct 17 ms 115804 KB Output is correct
19 Correct 21 ms 116388 KB Output is correct
20 Correct 16 ms 115800 KB Output is correct
21 Correct 15 ms 115804 KB Output is correct
22 Correct 21 ms 115804 KB Output is correct
23 Correct 20 ms 115928 KB Output is correct
24 Correct 16 ms 115804 KB Output is correct
25 Correct 21 ms 115804 KB Output is correct
26 Correct 19 ms 116020 KB Output is correct
27 Correct 17 ms 115800 KB Output is correct
28 Correct 18 ms 115804 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 102736 KB Output is correct
2 Correct 13 ms 102900 KB Output is correct
3 Correct 12 ms 102748 KB Output is correct
4 Correct 12 ms 102664 KB Output is correct
5 Correct 14 ms 102744 KB Output is correct
6 Correct 13 ms 102748 KB Output is correct
7 Correct 12 ms 102748 KB Output is correct
8 Correct 12 ms 102748 KB Output is correct
9 Correct 12 ms 102748 KB Output is correct
10 Correct 12 ms 102744 KB Output is correct
11 Correct 12 ms 102748 KB Output is correct
12 Correct 13 ms 102748 KB Output is correct
13 Correct 12 ms 102744 KB Output is correct
14 Correct 12 ms 102748 KB Output is correct
15 Correct 13 ms 102744 KB Output is correct
16 Correct 13 ms 102748 KB Output is correct
17 Correct 14 ms 107612 KB Output is correct
18 Correct 17 ms 115804 KB Output is correct
19 Correct 21 ms 116388 KB Output is correct
20 Correct 16 ms 115800 KB Output is correct
21 Correct 15 ms 115804 KB Output is correct
22 Correct 21 ms 115804 KB Output is correct
23 Correct 20 ms 115928 KB Output is correct
24 Correct 16 ms 115804 KB Output is correct
25 Correct 21 ms 115804 KB Output is correct
26 Correct 19 ms 116020 KB Output is correct
27 Correct 17 ms 115800 KB Output is correct
28 Correct 18 ms 115804 KB Output is correct
29 Correct 530 ms 295528 KB Output is correct
30 Correct 1280 ms 296268 KB Output is correct
31 Correct 419 ms 296024 KB Output is correct
32 Correct 139 ms 296048 KB Output is correct
33 Correct 143 ms 296272 KB Output is correct
34 Correct 1014 ms 296116 KB Output is correct
35 Correct 1006 ms 296112 KB Output is correct
36 Correct 144 ms 296112 KB Output is correct
37 Correct 414 ms 296124 KB Output is correct
38 Correct 846 ms 296332 KB Output is correct
39 Correct 688 ms 296000 KB Output is correct
40 Correct 433 ms 296016 KB Output is correct
41 Correct 441 ms 296276 KB Output is correct
42 Correct 511 ms 296112 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 102736 KB Output is correct
2 Correct 13 ms 102900 KB Output is correct
3 Correct 12 ms 102748 KB Output is correct
4 Correct 12 ms 102664 KB Output is correct
5 Correct 14 ms 102744 KB Output is correct
6 Correct 13 ms 102748 KB Output is correct
7 Correct 12 ms 102748 KB Output is correct
8 Correct 12 ms 102748 KB Output is correct
9 Correct 12 ms 102748 KB Output is correct
10 Correct 12 ms 102744 KB Output is correct
11 Correct 12 ms 102748 KB Output is correct
12 Correct 13 ms 102748 KB Output is correct
13 Correct 12 ms 102744 KB Output is correct
14 Correct 12 ms 102748 KB Output is correct
15 Correct 13 ms 102744 KB Output is correct
16 Correct 13 ms 102748 KB Output is correct
17 Correct 14 ms 107612 KB Output is correct
18 Correct 17 ms 115804 KB Output is correct
19 Correct 21 ms 116388 KB Output is correct
20 Correct 16 ms 115800 KB Output is correct
21 Correct 15 ms 115804 KB Output is correct
22 Correct 21 ms 115804 KB Output is correct
23 Correct 20 ms 115928 KB Output is correct
24 Correct 16 ms 115804 KB Output is correct
25 Correct 21 ms 115804 KB Output is correct
26 Correct 19 ms 116020 KB Output is correct
27 Correct 17 ms 115800 KB Output is correct
28 Correct 18 ms 115804 KB Output is correct
29 Correct 530 ms 295528 KB Output is correct
30 Correct 1280 ms 296268 KB Output is correct
31 Correct 419 ms 296024 KB Output is correct
32 Correct 139 ms 296048 KB Output is correct
33 Correct 143 ms 296272 KB Output is correct
34 Correct 1014 ms 296116 KB Output is correct
35 Correct 1006 ms 296112 KB Output is correct
36 Correct 144 ms 296112 KB Output is correct
37 Correct 414 ms 296124 KB Output is correct
38 Correct 846 ms 296332 KB Output is correct
39 Correct 688 ms 296000 KB Output is correct
40 Correct 433 ms 296016 KB Output is correct
41 Correct 441 ms 296276 KB Output is correct
42 Correct 511 ms 296112 KB Output is correct
43 Runtime error 98 ms 205448 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 102736 KB Output is correct
2 Correct 13 ms 102900 KB Output is correct
3 Correct 12 ms 102748 KB Output is correct
4 Correct 12 ms 102664 KB Output is correct
5 Correct 14 ms 102744 KB Output is correct
6 Correct 13 ms 102748 KB Output is correct
7 Correct 12 ms 102748 KB Output is correct
8 Correct 12 ms 102748 KB Output is correct
9 Correct 12 ms 102748 KB Output is correct
10 Correct 12 ms 102744 KB Output is correct
11 Correct 12 ms 102748 KB Output is correct
12 Correct 13 ms 102748 KB Output is correct
13 Correct 12 ms 102744 KB Output is correct
14 Correct 12 ms 102748 KB Output is correct
15 Correct 13 ms 102744 KB Output is correct
16 Correct 13 ms 102748 KB Output is correct
17 Correct 14 ms 107612 KB Output is correct
18 Correct 17 ms 115804 KB Output is correct
19 Correct 21 ms 116388 KB Output is correct
20 Correct 16 ms 115800 KB Output is correct
21 Correct 15 ms 115804 KB Output is correct
22 Correct 21 ms 115804 KB Output is correct
23 Correct 20 ms 115928 KB Output is correct
24 Correct 16 ms 115804 KB Output is correct
25 Correct 21 ms 115804 KB Output is correct
26 Correct 19 ms 116020 KB Output is correct
27 Correct 17 ms 115800 KB Output is correct
28 Correct 18 ms 115804 KB Output is correct
29 Correct 530 ms 295528 KB Output is correct
30 Correct 1280 ms 296268 KB Output is correct
31 Correct 419 ms 296024 KB Output is correct
32 Correct 139 ms 296048 KB Output is correct
33 Correct 143 ms 296272 KB Output is correct
34 Correct 1014 ms 296116 KB Output is correct
35 Correct 1006 ms 296112 KB Output is correct
36 Correct 144 ms 296112 KB Output is correct
37 Correct 414 ms 296124 KB Output is correct
38 Correct 846 ms 296332 KB Output is correct
39 Correct 688 ms 296000 KB Output is correct
40 Correct 433 ms 296016 KB Output is correct
41 Correct 441 ms 296276 KB Output is correct
42 Correct 511 ms 296112 KB Output is correct
43 Runtime error 98 ms 205448 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -