oj.uz

답안 #884338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884338 2023-12-07T07:27:22 Z Kevin_Zhang_TW Giraffes (JOI22_giraffes) C++17
59 / 100
 54 ms 56356 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
// My bug list :
// integer overflow
// 0based, 1based forgotten
// index out of bound
// n, m, i, j typo
// some cases are missing

const int MAX_N = 310;

int n, p[MAX_N];
int dp[MAX_N][MAX_N][MAX_N];

int32_t main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  if (n > 300) return 0;
  for (int i = 1;i <= n;++i)
    cin >> p[i];

  int res = 0;

  for (int l = 0;l <= n;++l)
    for (int r = n+1;r > l+1;--r) {
      int sz = l + n - r + 1;
      //DE(l, r, sz);
      for (int i = 0, lidx = 0, ridx = n - sz + 1;i <= sz;++i, ++lidx, ++ridx) {
        //DE(lidx, ridx);
        chmax(dp[l+1][r][i+1], dp[l][r][i] + (p[lidx+1] == l+1));
        chmax(dp[l+1][r][i], dp[l][r][i] + (p[ridx-1] == l+1));

        chmax(dp[l][r-1][i+1], dp[l][r][i] + (p[lidx+1] == r-1));
        chmax(dp[l][r-1][i], dp[l][r][i] + (p[ridx-1] == r-1));
      }
    }
      //DE(l, r, sz);
//      for (int i = 0;i <= sz;++i) {
//        int j = sz - i;
//        int mn = i + 1, mx = n - j;
//        chmax(dp[l+1][r][i+1], dp[l][r][i] + (p[l+1] == mn));
//        chmax(dp[l+1][r][i], dp[l][r][i] + (p[l+1] == mx));
//        chmax(dp[l][r-1][i+1], dp[l][r][i] + (p[r-1] == mn));
//        chmax(dp[l][r-1][i], dp[l][r][i] + (p[r-1] == mx));
//      }

  for (int i = 0;i <= n;++i)
    for (int j = 0;j <= n;++j)
      chmax(res, dp[i][i+1][j]);
  cout << n - res << '\n';


}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 4 ms 6412 KB Output is correct
23 Correct 17 ms 21860 KB Output is correct
24 Correct 33 ms 37200 KB Output is correct
25 Correct 50 ms 52552 KB Output is correct
26 Correct 52 ms 55040 KB Output is correct
27 Correct 53 ms 55520 KB Output is correct
28 Correct 53 ms 55888 KB Output is correct
29 Correct 52 ms 56076 KB Output is correct
30 Correct 54 ms 56356 KB Output is correct

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 4 ms 6412 KB Output is correct
23 Correct 17 ms 21860 KB Output is correct
24 Correct 33 ms 37200 KB Output is correct
25 Correct 50 ms 52552 KB Output is correct
26 Correct 52 ms 55040 KB Output is correct
27 Correct 53 ms 55520 KB Output is correct
28 Correct 53 ms 55888 KB Output is correct
29 Correct 52 ms 56076 KB Output is correct
30 Correct 54 ms 56356 KB Output is correct
31 Incorrect 1 ms 504 KB Output isn't correct
32 Halted 0 ms 0 KB -