답안 #917360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917360	2024-01-28T02:22:09 Z	Cookie	Group Photo (JOI21_ho_t3)	C++14	44 / 100	5000 ms	468 KB

Main

#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7;
const int mxn = 1e6 + 69, mxq = 1e5 + 5, sq = 500, mxv = 1e6 + 5;
//const int base = (1 <<18);
const ll inf = 1e9 + 5, neg = -69420;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
//const int x[9] = {0, 1, 1, -1, -1, 2, -2, 2, -2};
//const inty[9] = {0, 2, -2, 2, -2, 1, 1, -1, -1};

int n;
int dp[5005], a[5005], toa[5005];
void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i]; toa[a[i]] = i;
    }
    for(int i = 1; i <= n; i++){
        dp[i] = inf;

        for(int j = i; j >= 1; j--){
            int cost = 0;
            for(int k = j; k <= i; k++){
                for(int l = 1; l <= j - 1; l++){
                    cost += (toa[l] > toa[k]);
                }
                for(int l = k; l <= i; l++){
                    cost += (toa[k] < toa[l]);
                }
            }
            dp[i] = min(dp[i], dp[j - 1] + cost);
        }
        //cout << dp[i] << " ";
    }
    cout << dp[n];
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("COLLEGE.INP", "r", stdin);
    //freopen("COLLEGE.OUT", "w", stdout);

    int tt; tt = 1;
    while(tt--){
        solve();

    }
    return(0);
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	348 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
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	456 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	460 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	456 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	460 KB	Output is correct
21	Correct	95 ms	344 KB	Output is correct
22	Correct	96 ms	344 KB	Output is correct
23	Correct	96 ms	348 KB	Output is correct
24	Correct	98 ms	348 KB	Output is correct
25	Correct	98 ms	348 KB	Output is correct
26	Correct	101 ms	448 KB	Output is correct
27	Correct	97 ms	444 KB	Output is correct
28	Correct	98 ms	448 KB	Output is correct
29	Correct	98 ms	444 KB	Output is correct
30	Correct	99 ms	348 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	456 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	460 KB	Output is correct
21	Correct	95 ms	344 KB	Output is correct
22	Correct	96 ms	344 KB	Output is correct
23	Correct	96 ms	348 KB	Output is correct
24	Correct	98 ms	348 KB	Output is correct
25	Correct	98 ms	348 KB	Output is correct
26	Correct	101 ms	448 KB	Output is correct
27	Correct	97 ms	444 KB	Output is correct
28	Correct	98 ms	448 KB	Output is correct
29	Correct	98 ms	444 KB	Output is correct
30	Correct	99 ms	348 KB	Output is correct
31	Execution timed out	5008 ms	344 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	456 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	460 KB	Output is correct
21	Correct	95 ms	344 KB	Output is correct
22	Correct	96 ms	344 KB	Output is correct
23	Correct	96 ms	348 KB	Output is correct
24	Correct	98 ms	348 KB	Output is correct
25	Correct	98 ms	348 KB	Output is correct
26	Correct	101 ms	448 KB	Output is correct
27	Correct	97 ms	444 KB	Output is correct
28	Correct	98 ms	448 KB	Output is correct
29	Correct	98 ms	444 KB	Output is correct
30	Correct	99 ms	348 KB	Output is correct
31	Execution timed out	5008 ms	344 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #917360

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 0 / 20.0

Subtask #5 0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
0 / 20.0

Subtask #5
0 / 36.0