oj.uz

Submission #582068

# Submission time Handle Problem Language Result Execution time Memory
582068 2022-06-23T10:53:59 Z amunduzbaev Boarding Passes (BOI22_passes) C++17
25 / 100
 71 ms 488 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
#define int ll

const int N = 1e4 + 5;
const int G = 10;
int dp[1 << G], pref[N], suff[N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	string s; cin>>s;
	int n = s.size(), g = 0;
	for(int i=0;i<n;i++){
		g = max(g, (ll)s[i] - 'A' + 1);
	}
	
	//~ cout<<s<<endl;
	
	memset(dp, 63, sizeof dp);
	dp[0] = 0;
	for(int mask=0;mask < (1 << g);mask++){
		//~ for(int i=0;i<g;i++) cout<<(mask >> i & 1);
		//~ cout<<"\n";
		//~ cout<<dp[mask]<<"\n";
		for(int j=0;j<g;j++){
			if(mask >> j & 1) continue;
			memset(pref, 0, sizeof pref);
			memset(suff, 0, sizeof suff);
			int cnt = 0;
			for(int k=0;k<n;k++){
				if(k) pref[k] += pref[k-1];
				if(s[k] - 'A' == j){
					pref[k] += cnt;
					cnt++;
				}
				if(mask >> (s[k] - 'A') & 1) cnt += 2;
			}
			
			cnt = 0;
			for(int i=n-1;~i;i--){
				if(i + 1 < n) suff[i] += suff[i + 1];
				if(s[i] - 'A' == j){
					suff[i] += cnt;
					cnt++;
				}
				if(mask >> (s[i] - 'A') & 1) cnt += 2;
			}
			
			int res = min(pref[n-1], suff[0]);
			for(int i=1;i<n;i++){
				res = min(res, pref[i-1] + suff[i]);
			}
			
			dp[mask | (1 << j)] = min(dp[mask | (1 << j)], dp[mask] + res);
		}
	}
	
	double res = dp[(1 << g) - 1] / 2.;
	cout<<res<<"\n";
}

Subtask #1
0 / 5.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 484 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 488 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 484 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 488 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Incorrect 71 ms 468 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

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