답안 #499854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499854	2021-12-29T19:41:22 Z	Lobo	Group Photo (JOI21_ho_t3)	C++17	44 / 100	27 ms	432 KB

Main

#include<bits/stdc++.h>
using namespace std;
 
/*for ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
*/
 
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
#define maxn 220
 
ii n, a[maxn], pos[maxn], bit[maxn], dp[maxn], mark[maxn];
 
void att(ii id, ii val) {
    for(ii i = id; i <= n; i+= i&-i) {
        bit[i]+= val;
    }
}
 
ii qr(ii id) {
    ii val = 0;
    for(ii i = id; i > 0; i-= i&-i) {
        val+= bit[i];
    }
    return val;
}
 
ii sol(ii i) {
    if(mark[i]) return dp[i];
    mark[i] = 1;
    ii ans = INFii;
    if(i == n) return dp[i] = 0;
 
    for(ii k = i+1; k <= n; k++) {
        ii ans1 = 0;
 
        for(ii j = 1; j <= n; j++) {
            bit[j] = 0;
        }
 
        for(ii j = 1; j <= i; j++) {
            att(pos[j],1);
        }
 

        for(ii j = i+1, x = k; j <= k; j++,x--) {
            ans1+= j-1-qr(pos[x]);
            att(pos[x],+1);
        }
 
        ans = min(ans, ans1+sol(k));
    }
 
    return dp[i] = ans;
}
 
void solve() {
    cin >> n;
 
    for(ii i = 1; i <= n; i++) {
        cin >> a[i];
        pos[a[i]] = i;
    }
 
    cout << sol(0) << endl;
 
    
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
 
    ii tt = 1;
    // cin >> tt;
    while(tt--) solve();
 
}

Subtask #1
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	316 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct
9	Correct	204 KB	Output is correct
10	Correct	204 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	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	316 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	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	312 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	320 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	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	316 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	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	312 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	320 KB	Output is correct
21	Correct	21 ms	204 KB	Output is correct
22	Correct	22 ms	204 KB	Output is correct
23	Correct	22 ms	204 KB	Output is correct
24	Correct	24 ms	320 KB	Output is correct
25	Correct	27 ms	312 KB	Output is correct
26	Correct	22 ms	204 KB	Output is correct
27	Correct	24 ms	324 KB	Output is correct
28	Correct	25 ms	308 KB	Output is correct
29	Correct	22 ms	312 KB	Output is correct
30	Correct	22 ms	204 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	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	316 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	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	312 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	320 KB	Output is correct
21	Correct	21 ms	204 KB	Output is correct
22	Correct	22 ms	204 KB	Output is correct
23	Correct	22 ms	204 KB	Output is correct
24	Correct	24 ms	320 KB	Output is correct
25	Correct	27 ms	312 KB	Output is correct
26	Correct	22 ms	204 KB	Output is correct
27	Correct	24 ms	324 KB	Output is correct
28	Correct	25 ms	308 KB	Output is correct
29	Correct	22 ms	312 KB	Output is correct
30	Correct	22 ms	204 KB	Output is correct
31	Runtime error	1 ms	432 KB	Execution killed with signal 11
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 36.0

#	결과	실행 시간	메모리	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	316 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	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	312 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	320 KB	Output is correct
21	Correct	21 ms	204 KB	Output is correct
22	Correct	22 ms	204 KB	Output is correct
23	Correct	22 ms	204 KB	Output is correct
24	Correct	24 ms	320 KB	Output is correct
25	Correct	27 ms	312 KB	Output is correct
26	Correct	22 ms	204 KB	Output is correct
27	Correct	24 ms	324 KB	Output is correct
28	Correct	25 ms	308 KB	Output is correct
29	Correct	22 ms	312 KB	Output is correct
30	Correct	22 ms	204 KB	Output is correct
31	Runtime error	1 ms	432 KB	Execution killed with signal 11
32	Halted	0 ms	0 KB	-

답안 #499854

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