oj.uz

Submission #598530

# Submission time Handle Problem Language Result Execution time Memory
598530 2022-07-18T13:10:14 Z SuffixAutomata Boarding Passes (BOI22_passes) C++17
100 / 100
 214 ms 10584 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair

using ll = long long;
using pii = pair<int, int>;
//#define int ll
const int MOD = 1000000007;

ll wt[15][1 << 15];
ll dp[1 << 15];
int id[100005];
int con[100005][15];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  int S = 0;
  for (int i = 0; i < n; i++)
    S = max(S, id[i] = s[i] - 'A');
  S++;
  for (int i = 0; i < S; i++) {
    // todo: optimize this
    vector<int> pos;
    for (int j = 0; j < n; j++)
      if (id[j] == i)
        pos.push_back(j);
    ll cnt = pos.size();
    for (int k = 0; k <= cnt; k++)
      for (int j = 0; j < S; j++)
        con[k][j] = 0;
    int x = 0;
    for (int j = 0; j < n; j++) {
      if (x != cnt && j == pos[x]) {
        x++;
        continue;
      }
      con[x][id[j]]++;
    }
    for (int j = 0; j < S; j++) {
      int ds = 0, L = 0, R = 0;
      for (int k = 0; k <= cnt; k++)
        ds += k * con[k][j], R += con[k][j];
      for (int k = 0; k <= cnt; k++) {
        R -= con[k][j], L += con[k][j];
        con[k][j] = ds * 2;
        ds += L - R;
      }
    }
    for (int m = 0; m < (1 << S); m++) {
      if (m & (1 << i))
        continue;
      ll ans = 1e18;
      auto qry = [&](ll j) {
        if (j > cnt)
          return 1ll << 60;
        ll tmp = (j * (j - 1) + (cnt - j) * (cnt - j - 1)) / 2;
        for (int k = 0; k < S; k++)
          if (m & (1 << k))
            tmp += con[j][k];
        ans = min(ans, tmp);
        return tmp;
      };
      ll lo = 0, hi = cnt;
      while (lo <= hi) {
        ll mi = (lo + hi) / 2;
        if (qry(mi) <= qry(mi + 1))
          hi = mi - 1;
        else
          lo = mi + 1;
      }
      wt[i][m] = ans;
    }
  }
  dp[0] = 0;
  for (int i = 1; i < (1 << S); i++) {
    dp[i] = 1e18;
    for (int j = 0; j < S; j++)
      if (i & (1 << j))
        dp[i] = min(dp[i], dp[i ^ (1 << j)] + wt[j][i ^ (1 << j)]);
  }
  cout << dp[(1 << S) - 1] / 2;
  if (dp[(1 << S) - 1] % 2)
    cout << ".5";
  cout << endl;
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 6000 KB Output is correct
7 Correct 4 ms 6928 KB Output is correct
8 Correct 5 ms 7440 KB Output is correct
9 Correct 4 ms 7456 KB Output is correct

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 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 2 ms 1108 KB Output is correct
36 Correct 2 ms 1108 KB Output is correct
37 Correct 5 ms 596 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 3 ms 1228 KB Output is correct
40 Correct 5 ms 596 KB Output is correct
41 Correct 5 ms 596 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 4 ms 596 KB Output is correct
46 Correct 4 ms 596 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 6000 KB Output is correct
7 Correct 4 ms 6928 KB Output is correct
8 Correct 5 ms 7440 KB Output is correct
9 Correct 4 ms 7456 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 352 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 2 ms 1108 KB Output is correct
45 Correct 2 ms 1108 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 3 ms 596 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 5 ms 596 KB Output is correct
50 Correct 5 ms 596 KB Output is correct
51 Correct 4 ms 596 KB Output is correct
52 Correct 4 ms 596 KB Output is correct
53 Correct 4 ms 596 KB Output is correct
54 Correct 4 ms 596 KB Output is correct
55 Correct 4 ms 596 KB Output is correct
56 Correct 34 ms 3792 KB Output is correct
57 Correct 56 ms 3808 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 4 ms 6028 KB Output is correct
64 Correct 4 ms 6928 KB Output is correct
65 Correct 5 ms 7420 KB Output is correct
66 Correct 5 ms 7440 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 2 ms 1108 KB Output is correct
85 Correct 3 ms 1112 KB Output is correct
86 Correct 5 ms 620 KB Output is correct
87 Correct 3 ms 596 KB Output is correct
88 Correct 2 ms 1236 KB Output is correct
89 Correct 4 ms 596 KB Output is correct
90 Correct 4 ms 596 KB Output is correct
91 Correct 4 ms 596 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 4 ms 616 KB Output is correct
94 Correct 4 ms 596 KB Output is correct
95 Correct 4 ms 596 KB Output is correct
96 Correct 214 ms 4956 KB Output is correct
97 Correct 29 ms 2056 KB Output is correct
98 Correct 193 ms 4896 KB Output is correct
99 Correct 70 ms 10584 KB Output is correct
100 Correct 48 ms 3828 KB Output is correct
101 Correct 192 ms 4972 KB Output is correct
102 Correct 198 ms 5068 KB Output is correct
103 Correct 190 ms 5188 KB Output is correct
104 Correct 189 ms 5260 KB Output is correct
105 Correct 204 ms 5172 KB Output is correct
106 Correct 191 ms 5084 KB Output is correct
107 Correct 203 ms 5296 KB Output is correct
108 Correct 111 ms 3408 KB Output is correct
109 Correct 199 ms 5096 KB Output is correct