답안 #375753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375753 2021-03-10T00:12:20 Z rama_pang Group Photo (JOI21_ho_t3) C++14
100 / 100
451 ms 640 KB
#include <bits/stdc++.h>
using namespace std;

template<typename T>
class Fenwick {
 public:
  int n;
  vector<T> tree;

  Fenwick(int n) : n(n), tree(n) {}

  void Modify(int p, T x) {
    for (int i = p; i < n; i |= i + 1) {
      tree[i] += x;
    }
  }

  T Query(int p) {
    T res = 0;
    for (int i = p; i > 0; i &= i - 1) {
      res += tree[i - 1];
    }
    return res;
  }
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int N;
  cin >> N;

  vector<int> H(N);
  for (int i = 0; i < N; i++) {
    cin >> H[i];
    H[i]--;
  }

  // "sorted" = split H[0...N-1] into K segments,
  // such that in each segment:
  // H[i] == H[i + 1] + 1
  // is satisfied.

  vector<int> dp(N + 1, INT_MAX);
  dp[0] = 0;

  for (int i = 0; i < N; i++) {
    vector<int> A;
    vector<int> pos(N, -1);
    for (int j = 0; j < N; j++) {
      if (H[j] >= i) {
        pos[H[j]] = A.size();
        A.emplace_back(H[j]);
      }
    }
    int sum_pos = 0;
    int inversion = 0;
    Fenwick<int> F(A.size());
    for (int j = 1; i + j <= N; j++) { // segment = [i, i + j - 1]
      F.Modify(pos[i + j - 1], 1);
      sum_pos += pos[i + j - 1] - (j - 1); // place [i, i + j - 1] in front in any order
      inversion += F.Query(pos[i + j - 1]) ; // sort [i, i + j - 1] in descending order
      dp[i + j] = min(dp[i + j], dp[i] + sum_pos + inversion);
    }
  }

  cout << dp[N] << '\n';
  return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 11 ms 364 KB Output is correct
32 Correct 11 ms 364 KB Output is correct
33 Correct 10 ms 364 KB Output is correct
34 Correct 12 ms 364 KB Output is correct
35 Correct 10 ms 364 KB Output is correct
36 Correct 10 ms 364 KB Output is correct
37 Correct 11 ms 364 KB Output is correct
38 Correct 10 ms 364 KB Output is correct
39 Correct 11 ms 364 KB Output is correct
40 Correct 11 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 11 ms 364 KB Output is correct
32 Correct 11 ms 364 KB Output is correct
33 Correct 10 ms 364 KB Output is correct
34 Correct 12 ms 364 KB Output is correct
35 Correct 10 ms 364 KB Output is correct
36 Correct 10 ms 364 KB Output is correct
37 Correct 11 ms 364 KB Output is correct
38 Correct 10 ms 364 KB Output is correct
39 Correct 11 ms 364 KB Output is correct
40 Correct 11 ms 364 KB Output is correct
41 Correct 420 ms 640 KB Output is correct
42 Correct 416 ms 620 KB Output is correct
43 Correct 427 ms 620 KB Output is correct
44 Correct 417 ms 620 KB Output is correct
45 Correct 422 ms 620 KB Output is correct
46 Correct 418 ms 620 KB Output is correct
47 Correct 416 ms 512 KB Output is correct
48 Correct 416 ms 512 KB Output is correct
49 Correct 432 ms 492 KB Output is correct
50 Correct 427 ms 620 KB Output is correct
51 Correct 413 ms 492 KB Output is correct
52 Correct 425 ms 620 KB Output is correct
53 Correct 422 ms 620 KB Output is correct
54 Correct 451 ms 620 KB Output is correct
55 Correct 415 ms 620 KB Output is correct