oj.uz

Submission #941821

# Submission time Handle Problem Language Result Execution time Memory
941821 2024-03-09T13:49:01 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
20 / 100
 3000 ms 800 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll

#define endl '\n'
#define pb push_back
using pi = array<int, 2>;
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

/*
x = lungimea
y = aparitii

cost_nor = A * len * ap
cost_cut = A * len + B + C * ap

A * len * ap - A * len - B - C * ap > 0

A*x*y - A*x - C*y - B > 0
y*(A*x-C) > A * x + B
y > (A * x + B) / (A * x - C)x
*/

const int INF = 1e9, BASE = 29, MOD = 1e9 + 7, N = 205;
int binpow(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return res;
}
int modinv(int n) {
  return binpow(n, MOD - 2);
}

int p[N], minv[N];
void precalc() {
  p[0] = 1;
  for (int i = 1; i < N; ++i) {
    p[i] = p[i - 1] * BASE % MOD;
    minv[i] = modinv(p[i]);
  }
}

int n, A, B, C;
string s;

int dp[N][N];
int calc(int l, int r) {
  if (r < l) return 0;
  if (dp[l][r] != -1) return dp[l][r];
  
  int m = r - l + 1;
  dp[l][r] = A * m;
  for (int len = max(0LL, (ll)sqrt(m) - 5); len <= m; ++len) {
    map<int, vector<int>> ap{};
    
    int hash = 0;
    for (int i = 0; i < len; ++i) {
      hash = (hash + p[i] * s[l + i] % MOD) % MOD;
    }
    ap[hash].pb(l);
    
    for (int i = len; i < m; ++i) {
      int j = i - len;
      hash = (hash + MOD - s[l + j]) % MOD;
      hash = hash * minv[1] % MOD;
      hash = (hash + p[len - 1] * s[l + i] % MOD) % MOD;
      
      int st = l + i - len + 1;
      if (!ap[hash].size() || ap[hash].back() + len <= l + st) ap[hash].pb(st);
    }
    
    for (auto [h, idx] : ap) {
      int curr = calc(idx[0], idx[0] + len - 1) + B + idx.size() * C;
      
      curr += max(0LL, A * (idx[0] - l));
      for (int i = 1; i < (int)idx.size(); ++i) curr += max(0LL, A * (idx[i] - (idx[i - 1] + len)));
      curr += max(0LL, A * (r - (idx.back() + len) + 1));
            
      dp[l][r] = min(dp[l][r], curr);
    }
  }
  
  return dp[l][r];
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  
  precalc();
  
  cin >> n >> s >> A >> B >> C;
  
  bool all_a = true;
  for (int i = 0; i < n; ++i) all_a &= (s[i] == 'a');
  if (all_a) {
    vector<int> dp(n + 1, INF);
    dp[0] = 0;
    for (int i = 1; i <= n; ++i) {
      dp[i] = dp[i - 1] + A;
      for (int len = 1; len < i; ++len) {
        dp[i] = min(dp[i], dp[len] + B + C * (i / len) + A * (i % len));
      }
    }
    cout << dp[n];
    return 0;
  }
  
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) dp[i][j] = -1;
  }
  
  cout << calc(0, n - 1) << endl;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 11 ms 348 KB Output is correct
6 Correct 12 ms 348 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 14 ms 348 KB Output is correct
9 Correct 14 ms 496 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 688 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 800 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 7 ms 792 KB Output is correct
25 Correct 6 ms 792 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 3 ms 800 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 5 ms 604 KB Output is correct
31 Correct 5 ms 600 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 6 ms 604 KB Output is correct
34 Correct 1 ms 576 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 688 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 800 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 7 ms 792 KB Output is correct
25 Correct 6 ms 792 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 3 ms 800 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 5 ms 604 KB Output is correct
31 Correct 5 ms 600 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 6 ms 604 KB Output is correct
34 Correct 1 ms 576 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 300 ms 780 KB Output is correct
41 Correct 23 ms 604 KB Output is correct
42 Execution timed out 3052 ms 784 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 688 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 800 KB Output is correct
22 Correct 5 ms 604 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 7 ms 792 KB Output is correct
25 Correct 6 ms 792 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 3 ms 800 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 5 ms 604 KB Output is correct
31 Correct 5 ms 600 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 6 ms 604 KB Output is correct
34 Correct 1 ms 576 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 300 ms 780 KB Output is correct
41 Correct 23 ms 604 KB Output is correct
42 Execution timed out 3052 ms 784 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 9 ms 348 KB Output is correct
15 Correct 11 ms 348 KB Output is correct
16 Correct 12 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 14 ms 348 KB Output is correct
19 Correct 14 ms 496 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 688 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 1 ms 800 KB Output is correct
39 Correct 5 ms 604 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 7 ms 792 KB Output is correct
42 Correct 6 ms 792 KB Output is correct
43 Correct 6 ms 604 KB Output is correct
44 Correct 4 ms 604 KB Output is correct
45 Correct 3 ms 800 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 5 ms 600 KB Output is correct
49 Correct 5 ms 604 KB Output is correct
50 Correct 6 ms 604 KB Output is correct
51 Correct 1 ms 576 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 300 ms 780 KB Output is correct
58 Correct 23 ms 604 KB Output is correct
59 Execution timed out 3052 ms 784 KB Time limit exceeded
60 Halted 0 ms 0 KB -