답안 #581177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581177	2022-06-22T10:28:17 Z	jasmin	Boarding Passes (BOI22_passes)	C++17	60 / 100	2000 ms	3644 KB

passes

#include<bits/stdc++.h>
using namespace std;
#define int long long

int inf=1e18;

int cost(int last, int mask, vector<int>& group, int n){
    vector<int> prefix(n+1);
    vector<int> suffix(n+1);
    for(int i=0; i<n; i++){
        prefix[i+1]=prefix[i];
        if(group[i]==last){
            prefix[i+1]+=1;
        }
        else if((mask>>group[i])%2==1){
            prefix[i+1]+=2;
        }
    }
    for(int i=n-1; i>=0; i--){
        suffix[i]=suffix[i+1];
        if(group[i]==last){
            suffix[i]+=1;
        }
        else if((mask>>group[i])%2==1){
            suffix[i]+=2;
        }
    }

    int ans=0;
    for(int i=0; i<n; i++){
        if(group[i]!=last) continue;
        ans+=min(prefix[i], suffix[i+1]);
        //cout << i << " " << prefix[i] << " " << suffix[i+1] << " " << ans << "\n";
    }
    //cout << ans << "\n";
    return ans;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    string s;
    cin >> s;
    set<int> b;
    int n=s.size();
    vector<int> group(n);
    for(int i=0; i<n; i++){
        b.insert(s[i]);
    }
    int g=b.size();
    int ind=0;
    map<int,int> num;
    for(auto e: b){
        num[e]=ind;
        ind++;
    }
    for(int i=0; i<n; i++){
        group[i]=num[s[i]];
    }

    vector<int> dp((1<<g), inf);
    dp[0]=0;
    //cout << n << " " << g << "<n";
    for(int i=1; i<(1<<g); i++){

        for(int last=0; last<g; last++){
            if((i>>last)%2==0) continue;
            //cout << dp[i] << " " << dp[i-(1<<last)] << " " << cost(last, i, group, n) << "\n";
            dp[i]=min(dp[i], dp[i-(1<<last)]+cost(last, i, group, n));
        }
    }

    double ans=(double)(dp[(1<<g)-1])/2;
    //cout << "hallo\n";
    //cout << dp[(1<<g)-1] << " " << dp[1] << " " << cost(0, 1, group, n) << "\n";
    cout.precision(100);
    cout << ans << "\n";
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	2260 KB	Output is correct
7	Correct	3 ms	2644 KB	Output is correct
8	Correct	3 ms	2900 KB	Output is correct
9	Correct	3 ms	2900 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct

Subtask #3

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	468 KB	Output is correct
36	Correct	1 ms	468 KB	Output is correct
37	Correct	736 ms	828 KB	Output is correct
38	Correct	414 ms	644 KB	Output is correct
39	Correct	372 ms	592 KB	Output is correct
40	Correct	393 ms	720 KB	Output is correct
41	Correct	422 ms	576 KB	Output is correct
42	Correct	431 ms	668 KB	Output is correct
43	Correct	471 ms	572 KB	Output is correct
44	Correct	401 ms	612 KB	Output is correct
45	Correct	433 ms	580 KB	Output is correct
46	Correct	417 ms	668 KB	Output is correct

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	2260 KB	Output is correct
7	Correct	3 ms	2644 KB	Output is correct
8	Correct	3 ms	2900 KB	Output is correct
9	Correct	3 ms	2900 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	212 KB	Output is correct
44	Correct	1 ms	468 KB	Output is correct
45	Correct	1 ms	468 KB	Output is correct
46	Correct	736 ms	828 KB	Output is correct
47	Correct	414 ms	644 KB	Output is correct
48	Correct	372 ms	592 KB	Output is correct
49	Correct	393 ms	720 KB	Output is correct
50	Correct	422 ms	576 KB	Output is correct
51	Correct	431 ms	668 KB	Output is correct
52	Correct	471 ms	572 KB	Output is correct
53	Correct	401 ms	612 KB	Output is correct
54	Correct	433 ms	580 KB	Output is correct
55	Correct	417 ms	668 KB	Output is correct
56	Correct	0 ms	212 KB	Output is correct
57	Correct	84 ms	468 KB	Output is correct
58	Correct	1 ms	212 KB	Output is correct
59	Correct	0 ms	212 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	0 ms	340 KB	Output is correct
63	Correct	2 ms	2260 KB	Output is correct
64	Correct	4 ms	2644 KB	Output is correct
65	Correct	4 ms	2900 KB	Output is correct
66	Correct	3 ms	2900 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	0 ms	212 KB	Output is correct
69	Correct	1 ms	212 KB	Output is correct
70	Correct	1 ms	212 KB	Output is correct
71	Correct	1 ms	212 KB	Output is correct
72	Correct	1 ms	212 KB	Output is correct
73	Correct	1 ms	212 KB	Output is correct
74	Correct	1 ms	212 KB	Output is correct
75	Correct	1 ms	212 KB	Output is correct
76	Correct	1 ms	212 KB	Output is correct
77	Correct	1 ms	212 KB	Output is correct
78	Correct	1 ms	212 KB	Output is correct
79	Correct	1 ms	212 KB	Output is correct
80	Correct	1 ms	212 KB	Output is correct
81	Correct	1 ms	212 KB	Output is correct
82	Correct	0 ms	212 KB	Output is correct
83	Correct	0 ms	212 KB	Output is correct
84	Correct	1 ms	468 KB	Output is correct
85	Correct	1 ms	468 KB	Output is correct
86	Correct	785 ms	784 KB	Output is correct
87	Correct	431 ms	740 KB	Output is correct
88	Correct	446 ms	704 KB	Output is correct
89	Correct	386 ms	652 KB	Output is correct
90	Correct	477 ms	700 KB	Output is correct
91	Correct	425 ms	580 KB	Output is correct
92	Correct	414 ms	676 KB	Output is correct
93	Correct	444 ms	564 KB	Output is correct
94	Correct	392 ms	708 KB	Output is correct
95	Correct	432 ms	660 KB	Output is correct
96	Execution timed out	2074 ms	3644 KB	Time limit exceeded
97	Halted	0 ms	0 KB	-