oj.uz

Submission #831344

# Submission time Handle Problem Language Result Execution time Memory
831344 2023-08-20T06:22:13 Z maomao90 Giraffes (JOI22_giraffes) C++17
32 / 100
 40 ms 2980 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 = 13;

int n;
int p[MAXN + 5];
int dp[MAXN + 5][MAXN + 5][1 << MAXN];

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]--;
    }
    dp[n + 1][n][0] = 0;
    RREP (l, n, 1) {
        dp[l][l - 1][0] = 0;
        REP (r, l, n + 1) {
            REP (msk, 0, 1 << n) {
                int pop = 0, mn = INF, mx = -INF;
                REP (i, 0, n) {
                    if (msk >> i & 1) {
                        mnto(mn, i);
                        mxto(mx, i);
                        pop++;
                    }
                }
                if (pop != r - l + 1) {
                    continue;
                }
                dp[l][r][msk] = min({
                        dp[l + 1][r][msk ^ (1 << mn)] + (p[l] != mn),
                        dp[l + 1][r][msk ^ (1 << mx)] + (p[l] != mx),
                        dp[l][r - 1][msk ^ (1 << mn)] + (p[r] != mn),
                        dp[l][r - 1][msk ^ (1 << mx)] + (p[r] != mx)});
            }
        }
    }
    cout << dp[1][n][(1 << n) - 1] << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 7 ms 1056 KB Output is correct
15 Correct 17 ms 1608 KB Output is correct
16 Correct 17 ms 1668 KB Output is correct
17 Correct 40 ms 2980 KB Output is correct
18 Correct 40 ms 2896 KB Output is correct
19 Correct 39 ms 2972 KB Output is correct
20 Correct 40 ms 2880 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 7 ms 1056 KB Output is correct
15 Correct 17 ms 1608 KB Output is correct
16 Correct 17 ms 1668 KB Output is correct
17 Correct 40 ms 2980 KB Output is correct
18 Correct 40 ms 2896 KB Output is correct
19 Correct 39 ms 2972 KB Output is correct
20 Correct 40 ms 2880 KB Output is correct
21 Runtime error 1 ms 468 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 7 ms 1056 KB Output is correct
15 Correct 17 ms 1608 KB Output is correct
16 Correct 17 ms 1668 KB Output is correct
17 Correct 40 ms 2980 KB Output is correct
18 Correct 40 ms 2896 KB Output is correct
19 Correct 39 ms 2972 KB Output is correct
20 Correct 40 ms 2880 KB Output is correct
21 Runtime error 1 ms 468 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -