oj.uz

Submission #1041710

# Submission time Handle Problem Language Result Execution time Memory
1041710 2024-08-02T07:19:25 Z abczz Chorus (JOI23_chorus) C++17
16 / 100
 93 ms 21016 KB 
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <array>
#define ll long long

using namespace std;

ll n, k, dp[5000][5000];
vector <ll> A, B, nxA, ps;
string S;

ll C(ll l, ll r) {
  if (nxA[l] > A[r]) return 0;
  ll nx = max(l, nxA[l]), cnt = r-nx+1, cnt2 = max(0LL, l-nxA[l]);
  return ps[r]-(nx ? ps[nx-1] : 0)-cnt*B[l]-cnt*(cnt-1)/2-(r-l+1)*cnt2;
}

int main() {
  cin >> n >> k >> S;
  for (int i=0; i<2*n; ++i) {
    if (S[i] == 'A') {
      ps.push_back((ps.empty() ? 0 : ps.back()) + i);
      A.push_back(i);
    }
    else {
      B.push_back(i);
      nxA.push_back(A.size());
    }
  }
  for (int i=0; i<n; ++i) dp[i][0] = C(0, i);
  for (int x=1; x<k; ++x) {
    for (int i=0; i<n; ++i) {
      dp[i][x] = 1e18;
      ll optid = -1;
      for (int j=0; j<i; ++j) {
        if (dp[i][x] > dp[j][x-1] + C(j+1, i)) {
          dp[i][x] = dp[j][x-1] + C(j+1, i);
          optid = j;
        }
      }
    }
  }
  /*for (int x=0; x<k; ++x) {
    for (int i=0; i<n; ++i) {
      cout << dp[i][x] << " ";
    }
    cout << endl;
  }*/
  cout << dp[n-1][k-1] << '\n';
}

Compilation message

chorus.cpp: In function 'int main()':
chorus.cpp:36:10: warning: variable 'optid' set but not used [-Wunused-but-set-variable]
   36 |       ll optid = -1;
      |          ^~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 32 ms 21016 KB Output is correct
19 Incorrect 93 ms 20824 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 32 ms 21016 KB Output is correct
19 Incorrect 93 ms 20824 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 32 ms 21016 KB Output is correct
19 Incorrect 93 ms 20824 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 4 ms 8536 KB Output is correct
18 Correct 32 ms 21016 KB Output is correct
19 Incorrect 93 ms 20824 KB Output isn't correct
20 Halted 0 ms 0 KB -