oj.uz

Submission #589255

# Submission time Handle Problem Language Result Execution time Memory
589255 2022-07-04T11:03:55 Z maomao90 Boarding Passes (BOI22_passes) C++17
25 / 100
 2000 ms 1164 KB 
// 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;
const int MAXG = 15;

int n, g;
string s;
ll pre[MAXG + 5][MAXG + 5][MAXN];
ll dp[(1 << MAXG) + 5];

inline 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);
    }
    REP (j, 0, g) {
        REP (i, 0, g) {
            REP (k, 0, n) {
                int all = 0;
                REP (k, 0, n) {
                    if (s[k] - 'A' == i) {
                        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 (s[k] - 'A' == i) {
                        acnt++;
                    }
                }
                int jc = 0, cnt = 0;
                REP (k, 0, n) {
                    if (s[k] - 'A' == j) {
                        cur += cnt * 2;
                        cur -= acnt * 2;
                        jc++;
                    } else if (s[k] - 'A' == i) {
                        cnt++;
                        acnt--;
                    }
                    pre[j][i][k] = cur;
                }
            }
        }
    }
    dp[0] = 0;
    REP (i, 1, 1 << g) {
        dp[i] = LINF;
        REP (j, 0, g) {
            if (i >> j & 1 ^ 1) {
                continue;
            }
            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;
            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 = calc(jc) + calc(ajc - jc);
                // REP (l, 0, g) {
                //     if (i >> l & 1 ^ 1) {
                //         continue;
                //     }
                //     tmp += pre[j][l][k];
                // }
                ll tmp = cur + calc(jc) + calc(ajc - jc);
                mnto(mn, 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:95:24: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   95 |             if (i >> j & 1 ^ 1) {
      |                 ~~~~~~~^~~
passes.cpp:117:18: warning: unused variable 'inc' [-Wunused-variable]
  117 |             bool inc = 0;
      |                  ^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 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 2 ms 344 KB Output is correct
6 Execution timed out 2059 ms 1108 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 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 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 596 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 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Execution timed out 2080 ms 1164 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 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 2 ms 344 KB Output is correct
6 Execution timed out 2059 ms 1108 KB Time limit exceeded
7 Halted 0 ms 0 KB -