Submission #589197

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
589197	2022-07-04T10:26:39 Z	maomao90	Boarding Passes (BOI22_passes)	C++17	60 / 100	2000 ms	600 KB

passes

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 100005;

int n, g;
string s;
ll dp[MAXN];

ll calc(int n) {
    return (ll) n * (n - 1) / 2;
}

int main() {
    #ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    cin >> s;
    n = SZ(s);
    REP (i, 0, n) {
        mxto(g, s[i] - 'A' + 1);
    }
    dp[0] = 0;
    REP (i, 1, 1 << g) {
        dp[i] = LINF;
        cerr << bitset<5>(i) << '\n';
        REP (j, 0, g) {
            if (i >> j & 1 ^ 1) {
                continue;
            }
            cerr << ' ' << j << '\n';
            int ni = i ^ (1 << j);
            int all = 0;
            REP (k, 0, n) {
                if (ni >> (s[k] - 'A') & 1) {
                    all++;
                }
            }
            int acnt = 0, ajc = 0;
            ll cur = 0;
            RREP (k, n - 1, 0) {
                if (s[k] - 'A' == j) {
                    cur += acnt * 2;
                    ajc++;
                } else if (ni >> (s[k] - 'A') & 1) {
                    acnt++;
                }
            }
            ll mn = cur + calc(ajc);
            int jc = 0, cnt = 0;
            ll prv = LINF;
            bool inc = 0;
            REP (k, 0, n) {
                if (s[k] - 'A' == j) {
                    cur += cnt * 2;
                    cur -= acnt * 2;
                    jc++;
                } else if (ni >> (s[k] - 'A') & 1) {
                    cnt++;
                    acnt--;
                }
                ll tmp = cur + calc(jc) + calc(ajc - jc);
                if (tmp > prv) {
                    inc = 1;
                } else if (tmp < prv) {
                    assert(!inc);
                }
                cerr << "   " << tmp << '\n';
                mnto(mn, tmp);
                prv = tmp;
            }
            mnto(dp[i], dp[ni] + mn);
        }
    }
    ll ans = dp[(1 << g) - 1];
    if (ans % 2 == 0) {
        ans /= 2;
        cout << ans << '\n';
    } else {
        ans /= 2;
        cout << ans << ".5\n";
    }
    return 0;
}

Compilation message

passes.cpp: In function 'int main()':
passes.cpp:60:24: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   60 |             if (i >> j & 1 ^ 1) {
      |                 ~~~~~~~^~~

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	2 ms	468 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	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	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	332 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	336 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	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	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	332 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	336 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	0 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	336 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	46 ms	336 KB	Output is correct
36	Correct	42 ms	340 KB	Output is correct
37	Correct	460 ms	352 KB	Output is correct
38	Correct	210 ms	348 KB	Output is correct
39	Correct	202 ms	340 KB	Output is correct
40	Correct	208 ms	460 KB	Output is correct
41	Correct	234 ms	340 KB	Output is correct
42	Correct	303 ms	340 KB	Output is correct
43	Correct	237 ms	348 KB	Output is correct
44	Correct	242 ms	344 KB	Output is correct
45	Correct	246 ms	352 KB	Output is correct
46	Correct	248 ms	340 KB	Output is correct

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	2 ms	468 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	468 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	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	332 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	336 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	0 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	336 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	46 ms	336 KB	Output is correct
45	Correct	42 ms	340 KB	Output is correct
46	Correct	460 ms	352 KB	Output is correct
47	Correct	210 ms	348 KB	Output is correct
48	Correct	202 ms	340 KB	Output is correct
49	Correct	208 ms	460 KB	Output is correct
50	Correct	234 ms	340 KB	Output is correct
51	Correct	303 ms	340 KB	Output is correct
52	Correct	237 ms	348 KB	Output is correct
53	Correct	242 ms	344 KB	Output is correct
54	Correct	246 ms	352 KB	Output is correct
55	Correct	248 ms	340 KB	Output is correct
56	Correct	17 ms	556 KB	Output is correct
57	Correct	51 ms	564 KB	Output is correct
58	Correct	0 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	1 ms	332 KB	Output is correct
63	Correct	1 ms	468 KB	Output is correct
64	Correct	1 ms	596 KB	Output is correct
65	Correct	1 ms	600 KB	Output is correct
66	Correct	1 ms	520 KB	Output is correct
67	Correct	1 ms	212 KB	Output is correct
68	Correct	1 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	0 ms	212 KB	Output is correct
73	Correct	1 ms	212 KB	Output is correct
74	Correct	0 ms	212 KB	Output is correct
75	Correct	1 ms	328 KB	Output is correct
76	Correct	1 ms	212 KB	Output is correct
77	Correct	1 ms	212 KB	Output is correct
78	Correct	0 ms	212 KB	Output is correct
79	Correct	0 ms	212 KB	Output is correct
80	Correct	0 ms	212 KB	Output is correct
81	Correct	1 ms	212 KB	Output is correct
82	Correct	1 ms	212 KB	Output is correct
83	Correct	1 ms	212 KB	Output is correct
84	Correct	46 ms	344 KB	Output is correct
85	Correct	52 ms	360 KB	Output is correct
86	Correct	493 ms	340 KB	Output is correct
87	Correct	215 ms	340 KB	Output is correct
88	Correct	221 ms	340 KB	Output is correct
89	Correct	233 ms	340 KB	Output is correct
90	Correct	233 ms	460 KB	Output is correct
91	Correct	244 ms	344 KB	Output is correct
92	Correct	250 ms	340 KB	Output is correct
93	Correct	241 ms	340 KB	Output is correct
94	Correct	232 ms	344 KB	Output is correct
95	Correct	230 ms	344 KB	Output is correct
96	Execution timed out	2082 ms	596 KB	Time limit exceeded
97	Halted	0 ms	0 KB	-