답안 #770037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
770037	2023-06-30T17:24:54 Z	bachhoangxuan	Group Photo (JOI21_ho_t3)	C++17	100 / 100	231 ms	196456 KB

Main

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n;cin >> n;
    vector<int> h(n+1,0),dp(n+1,0),c(n+1,0),num(n+1,0);
    vector<vector<int>> cost(n+1,vector<int>(n+1,0));
    for(int i=1;i<=n;i++){int x;cin >> x;h[x]=i;}
    //for(int i=1;i<=n;i++) cout << h[i] << ' ';
    //cout << '\n';
    for(int i=1;i<=n;i++){
        c[i]=c[i-1];
        for(int j=1;j<i;j++) c[i]+=(h[i]>h[j]);
        //cout << c[i] << ' ';
    }
    //cout << '\n';
    for(int i=0;i<n;i++){
        for(int j=1;j<=h[i];j++) num[j]++;
        for(int j=i+1;j<=n;j++) cost[i][j]=cost[i][j-1]+num[h[j]];
        for(int j=i+1;j<=n;j++){
            cost[i][j]=c[j]-c[i]-(j-i)*i+2*cost[i][j];
            //cout << cost[i][j] << ' ';
        }
        //cout << '\n';
    }
    //cout << '\n';
    for(int i=1;i<=n;i++){
        dp[i]=inf;
        for(int j=0;j<i;j++) dp[i]=min(dp[i],dp[j]+cost[j][i]);
    }
    cout << dp[n] << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	320 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	328 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	320 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	328 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	576 KB	Output is correct
22	Correct	1 ms	596 KB	Output is correct
23	Correct	1 ms	580 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	1 ms	596 KB	Output is correct
27	Correct	1 ms	596 KB	Output is correct
28	Correct	1 ms	596 KB	Output is correct
29	Correct	1 ms	596 KB	Output is correct
30	Correct	1 ms	596 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	320 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	328 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	576 KB	Output is correct
22	Correct	1 ms	596 KB	Output is correct
23	Correct	1 ms	580 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	1 ms	596 KB	Output is correct
27	Correct	1 ms	596 KB	Output is correct
28	Correct	1 ms	596 KB	Output is correct
29	Correct	1 ms	596 KB	Output is correct
30	Correct	1 ms	596 KB	Output is correct
31	Correct	4 ms	5332 KB	Output is correct
32	Correct	4 ms	5332 KB	Output is correct
33	Correct	4 ms	5332 KB	Output is correct
34	Correct	4 ms	5280 KB	Output is correct
35	Correct	4 ms	5332 KB	Output is correct
36	Correct	4 ms	5332 KB	Output is correct
37	Correct	4 ms	5332 KB	Output is correct
38	Correct	4 ms	5316 KB	Output is correct
39	Correct	4 ms	5404 KB	Output is correct
40	Correct	4 ms	5332 KB	Output is correct

Subtask #5
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	320 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	328 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	576 KB	Output is correct
22	Correct	1 ms	596 KB	Output is correct
23	Correct	1 ms	580 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	1 ms	596 KB	Output is correct
27	Correct	1 ms	596 KB	Output is correct
28	Correct	1 ms	596 KB	Output is correct
29	Correct	1 ms	596 KB	Output is correct
30	Correct	1 ms	596 KB	Output is correct
31	Correct	4 ms	5332 KB	Output is correct
32	Correct	4 ms	5332 KB	Output is correct
33	Correct	4 ms	5332 KB	Output is correct
34	Correct	4 ms	5280 KB	Output is correct
35	Correct	4 ms	5332 KB	Output is correct
36	Correct	4 ms	5332 KB	Output is correct
37	Correct	4 ms	5332 KB	Output is correct
38	Correct	4 ms	5316 KB	Output is correct
39	Correct	4 ms	5404 KB	Output is correct
40	Correct	4 ms	5332 KB	Output is correct
41	Correct	220 ms	196260 KB	Output is correct
42	Correct	212 ms	196204 KB	Output is correct
43	Correct	214 ms	196408 KB	Output is correct
44	Correct	231 ms	196300 KB	Output is correct
45	Correct	216 ms	196344 KB	Output is correct
46	Correct	219 ms	196424 KB	Output is correct
47	Correct	227 ms	196452 KB	Output is correct
48	Correct	221 ms	196428 KB	Output is correct
49	Correct	215 ms	196452 KB	Output is correct
50	Correct	226 ms	196456 KB	Output is correct
51	Correct	220 ms	196368 KB	Output is correct
52	Correct	229 ms	196428 KB	Output is correct
53	Correct	214 ms	196380 KB	Output is correct
54	Correct	230 ms	196428 KB	Output is correct
55	Correct	220 ms	196448 KB	Output is correct

답안 #770037

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 36.0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
36.0 / 36.0