oj.uz

Submission #504077

# Submission time Handle Problem Language Result Execution time Memory
504077 2022-01-09T16:36:38 Z couplefire Group Photo (JOI21_ho_t3) C++17
100 / 100
 352 ms 444 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]--;
  }
 
  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++) {
      F.Modify(pos[i + j - 1], 1);
      sum_pos += pos[i + j - 1] - (j - 1);
      inversion += F.Query(pos[i + j - 1]) ;
      dp[i + j] = min(dp[i + j], dp[i] + sum_pos + inversion);
    }
  }
 
  cout << dp[N] << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 0 ms 204 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 8 ms 312 KB Output is correct
32 Correct 8 ms 332 KB Output is correct
33 Correct 9 ms 336 KB Output is correct
34 Correct 8 ms 332 KB Output is correct
35 Correct 9 ms 332 KB Output is correct
36 Correct 11 ms 340 KB Output is correct
37 Correct 9 ms 308 KB Output is correct
38 Correct 8 ms 332 KB Output is correct
39 Correct 9 ms 336 KB Output is correct
40 Correct 12 ms 332 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 8 ms 312 KB Output is correct
32 Correct 8 ms 332 KB Output is correct
33 Correct 9 ms 336 KB Output is correct
34 Correct 8 ms 332 KB Output is correct
35 Correct 9 ms 332 KB Output is correct
36 Correct 11 ms 340 KB Output is correct
37 Correct 9 ms 308 KB Output is correct
38 Correct 8 ms 332 KB Output is correct
39 Correct 9 ms 336 KB Output is correct
40 Correct 12 ms 332 KB Output is correct
41 Correct 341 ms 432 KB Output is correct
42 Correct 352 ms 432 KB Output is correct
43 Correct 333 ms 444 KB Output is correct
44 Correct 341 ms 436 KB Output is correct
45 Correct 336 ms 324 KB Output is correct
46 Correct 337 ms 332 KB Output is correct
47 Correct 342 ms 432 KB Output is correct
48 Correct 342 ms 440 KB Output is correct
49 Correct 342 ms 428 KB Output is correct
50 Correct 340 ms 436 KB Output is correct
51 Correct 331 ms 432 KB Output is correct
52 Correct 337 ms 428 KB Output is correct
53 Correct 334 ms 432 KB Output is correct
54 Correct 347 ms 432 KB Output is correct
55 Correct 337 ms 432 KB Output is correct