oj.uz

답안 #601315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601315 2022-07-21T16:46:57 Z patrikpavic2 Boarding Passes (BOI22_passes) C++17
55 / 100
 101 ms 16032 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

#define PB push_back

using namespace std;

typedef long long ll;

const ll INF = (ll)1e18;
const int N = 1e5 + 500;
const int ALP = 15;
const int MSK = (1 << ALP);

int P[N][ALP], sol[N][ALP], n, tmp[ALP];
ll cst[MSK][ALP], dp[MSK];
char s[N];

int f(int msk){
	if(msk == MSK - 1) return 0;
	if(dp[msk] != -1) return dp[msk];
	dp[msk] = INF;
	for(int a = 0;a < ALP;a++)
		if(!((1 << a) & msk))
			dp[msk] = min(dp[msk], f(msk | (1 << a)) + cst[msk][a]);
	return dp[msk];
}

int main(){
	memset(dp, -1, sizeof(dp));
	scanf("%s", s); n = strlen(s);
	for(int i = 0;i < n;i++){
		for(int j = 0;j < ALP;j++)
			P[i][j] = (i ? P[i - 1][j] : 0);
		P[i][s[i] - 'A']++;
	}
	for(int j = 0;j < ALP;j++){
		vector < int > pos;
		memset(tmp, 0, sizeof(tmp));
		for(int i = 0;i < n;i++){
			if(s[i] - 'A' != j) continue;
			pos.PB(i);
			for(int a = 0;a < ALP;a++){
				tmp[a] += P[i][a] - (a == j);
				sol[i][a] += tmp[a] * (1 + (a != j));
			}
		}
		memset(tmp, 0, sizeof(tmp));
		for(int i = n - 1;i >= 0;i--){
			if(s[i] - 'A' != j) continue;
			for(int a = 0;a < ALP;a++){
				sol[i][a] += tmp[a] * (1 + (a != j));
				tmp[a] += P[n - 1][a] - P[i][a];
			}
		}
		for(int msk = 0;msk < (1 << ALP);msk++){
			if(msk & (1 << j)) continue;
			int uk = 0;
			for(int a = 0;a < ALP;a++) 
				if(msk & (1 << a))
					uk += 2 * P[n - 1][a];
			uk += P[n - 1][j] - 1;
			int naj = -1;
			for(int k = 18;k >= 0;k--){
				if(naj + (1 << k) >= (int)pos.size()) continue;
				naj += (1 << k);
				int kol = 0;
				for(int b = 0;b < ALP;b++)
					if(msk & (1 << b)) kol += 2 * P[pos[naj]][b];
				kol += naj;
				if(kol > uk - kol)
					naj -= (1 << k);
			}
			for(int a = 0;a < ALP;a++)
				if((1 << a) & (msk + (1 << j)))
					cst[msk][j] += (naj > -1 ? sol[pos[naj]][a] : (tmp[a] * (1 + (a != j))));
		}
	}
	ll fin = f(0);
	printf("%lld", fin / 2);
	if(fin & 1) printf(".5");
	printf("\n");
	return 0;
}

Compilation message

passes.cpp: In function 'int main()':
passes.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  scanf("%s", s); n = strlen(s);
      |  ~~~~~^~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 4436 KB Output is correct
2 Correct 30 ms 4308 KB Output is correct
3 Correct 31 ms 4308 KB Output is correct
4 Correct 33 ms 4308 KB Output is correct
5 Correct 36 ms 4532 KB Output is correct
6 Correct 54 ms 14148 KB Output is correct
7 Incorrect 52 ms 16032 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 4308 KB Output is correct
2 Correct 43 ms 4412 KB Output is correct
3 Correct 51 ms 4408 KB Output is correct
4 Correct 53 ms 4404 KB Output is correct
5 Correct 48 ms 4408 KB Output is correct
6 Correct 39 ms 4396 KB Output is correct
7 Correct 59 ms 4308 KB Output is correct
8 Correct 49 ms 4308 KB Output is correct
9 Correct 48 ms 4396 KB Output is correct
10 Correct 45 ms 4308 KB Output is correct
11 Correct 44 ms 4308 KB Output is correct
12 Correct 45 ms 4404 KB Output is correct
13 Correct 55 ms 4396 KB Output is correct
14 Correct 46 ms 4396 KB Output is correct
15 Correct 48 ms 4308 KB Output is correct
16 Correct 49 ms 4308 KB Output is correct
17 Correct 47 ms 4404 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 4308 KB Output is correct
2 Correct 43 ms 4412 KB Output is correct
3 Correct 51 ms 4408 KB Output is correct
4 Correct 53 ms 4404 KB Output is correct
5 Correct 48 ms 4408 KB Output is correct
6 Correct 39 ms 4396 KB Output is correct
7 Correct 59 ms 4308 KB Output is correct
8 Correct 49 ms 4308 KB Output is correct
9 Correct 48 ms 4396 KB Output is correct
10 Correct 45 ms 4308 KB Output is correct
11 Correct 44 ms 4308 KB Output is correct
12 Correct 45 ms 4404 KB Output is correct
13 Correct 55 ms 4396 KB Output is correct
14 Correct 46 ms 4396 KB Output is correct
15 Correct 48 ms 4308 KB Output is correct
16 Correct 49 ms 4308 KB Output is correct
17 Correct 47 ms 4404 KB Output is correct
18 Correct 35 ms 4308 KB Output is correct
19 Correct 38 ms 4308 KB Output is correct
20 Correct 54 ms 4408 KB Output is correct
21 Correct 51 ms 4416 KB Output is correct
22 Correct 42 ms 4308 KB Output is correct
23 Correct 41 ms 4308 KB Output is correct
24 Correct 61 ms 4404 KB Output is correct
25 Correct 44 ms 4396 KB Output is correct
26 Correct 53 ms 4300 KB Output is correct
27 Correct 45 ms 4308 KB Output is correct
28 Correct 45 ms 4404 KB Output is correct
29 Correct 46 ms 4404 KB Output is correct
30 Correct 49 ms 4408 KB Output is correct
31 Correct 53 ms 4396 KB Output is correct
32 Correct 49 ms 4308 KB Output is correct
33 Correct 46 ms 4404 KB Output is correct
34 Correct 46 ms 4408 KB Output is correct
35 Correct 37 ms 5684 KB Output is correct
36 Correct 37 ms 5588 KB Output is correct
37 Correct 94 ms 5604 KB Output is correct
38 Correct 95 ms 5488 KB Output is correct
39 Correct 49 ms 5688 KB Output is correct
40 Correct 80 ms 5584 KB Output is correct
41 Correct 81 ms 5588 KB Output is correct
42 Correct 92 ms 5572 KB Output is correct
43 Correct 101 ms 5588 KB Output is correct
44 Correct 98 ms 5460 KB Output is correct
45 Correct 82 ms 5588 KB Output is correct
46 Correct 81 ms 5588 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 4436 KB Output is correct
2 Correct 30 ms 4308 KB Output is correct
3 Correct 31 ms 4308 KB Output is correct
4 Correct 33 ms 4308 KB Output is correct
5 Correct 36 ms 4532 KB Output is correct
6 Correct 54 ms 14148 KB Output is correct
7 Incorrect 52 ms 16032 KB Output isn't correct
8 Halted 0 ms 0 KB -