oj.uz

답안 #831480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831480 2023-08-20T09:37:24 Z maomao90 Giraffes (JOI22_giraffes) C++17
32 / 100
 18 ms 368 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 8005;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

int n;
int p[MAXN];
//int dp[MAXN][MAXN][MAXN];
viii pdp, ndp, tdp;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> p[i];
        p[i]--;
    }
    /*
    iota(p + 1, p + n + 1, 0);
    shuffle(p + 1, p + n + 1, rnd);
    */
    pdp.pb({1, n, 0});
    REP (x, 0, n + 1) {
        ndp.clear();
        cerr << x << ": " << SZ(pdp) << '\n';
        REP (l, 1, n + 1) { // p[l] is min
            int r = -INF;
            for (auto [pl, pr, pmn] : pdp) {
                if (l < pl || l > pr) {
                    continue;
                }
                int pmx = pmn + pr - pl;
                if (p[l] < pmn || p[l] > pmx) {
                    continue;
                }
                int tr = pr - max(0, p[l] - pmn - (l - pl));
                mxto(r, tr);
            }
            if (r != -INF) {
                ndp.pb({l + 1, r, p[l] + 1});
            }
        }
        REP (l, 1, n + 1) { // p[l] is max
            int r = -INF;
            for (auto [pl, pr, pmn] : pdp) {
                if (l < pl || l > pr) {
                    continue;
                }
                int pmx = pmn + pr - pl;
                if (p[l] < pmn || p[l] > pmx) {
                    continue;
                }
                int tr = pr - max(0, pmx - p[l] - (l - pl));
                mxto(r, tr);
            }
            if (r != -INF) {
                ndp.pb({l + 1, r, p[l] - (r - l)});
            }
        }
        REP (r, 1, n + 1) { // p[r] is min
            int l = INF;
            for (auto [pl, pr, pmn] : pdp) {
                if (r < pl || r > pr) {
                    continue;
                }
                int pmx = pmn + pr - pl;
                if (p[r] < pmn || p[r] > pmx) {
                    continue;
                }
                int tl = pl + max(0, p[r] - pmn - (pr - r));
                mnto(l, tl);
            }
            if (l != INF) {
                ndp.pb({l, r - 1, p[r] + 1});
            }
        }
        REP (r, 1, n + 1) { // p[r] is max
            int l = INF;
            for (auto [pl, pr, pmn] : pdp) {
                if (r < pl || r > pr) {
                    continue;
                }
                int pmx = pmn + pr - pl;
                if (p[r] < pmn || p[r] > pmx) {
                    continue;
                }
                int tl = pl + max(0, pmx - p[r] - (pr - r));
                mnto(l, tl);
            }
            if (l != INF) {
                ndp.pb({l, r - 1, p[r] - (r - l)});
            }
        }
        if (ndp.empty()) {
            cout << n - x << '\n';
            return 0;
        }
        tdp.clear();
        sort(ALL(ndp));
        for (auto [l, r, mn] : ndp) {
            if (!tdp.empty() && get<1>(tdp.back()) > r) {
                continue;
            }
            tdp.pb({l, r, mn});
        }
        pdp = tdp;
    }
    /*
    RREP (l, n, 1) {
        REP (r, l, n + 1) {
            REP (mn, 0, n) {
                int mx = mn + (r - l);
                dp[l][r][mn] = max({
                        dp[l + 1][r][mn + 1] + (p[l] == mn),
                        dp[l + 1][r][mn] + (p[l] == mx),
                        dp[l][r - 1][mn + 1] + (p[r] == mn),
                        dp[l][r - 1][mn] + (p[r] == mx)});
            }
        }
    }
    cout << n - dp[1][n][0] << '\n';
    */
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 12 ms 340 KB Output is correct
25 Correct 16 ms 340 KB Output is correct
26 Incorrect 18 ms 368 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 12 ms 340 KB Output is correct
25 Correct 16 ms 340 KB Output is correct
26 Incorrect 18 ms 368 KB Output isn't correct
27 Halted 0 ms 0 KB -