Submission #1151429

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151429		irmuun	Group Photo (JOI21_ho_t3)	C++20	44 / 100	5094 ms	2888 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    int p[n+5];
    for(int i=1;i<=n;i++){
        cin>>p[i];
    }
    int cnt[n+5][n+5];
    memset(cnt,0,sizeof cnt);
    for(int l=1;l<=n;l++){
        int left[n+5],len=0;
        for(int i=1;i<=n;i++){
            if(p[i]>=l){
                left[++len]=p[i];
            }
        }
        int cur=0;
        int a[n+5],pos[n+5];
        for(int r=l;r<=n;r++){
            for(int i=1;i<=len;i++){
                a[i]=left[i];
                pos[a[i]]=i;
            }
            int cur=0;
            for(int x=r;x>=l;x--){//r r-1 ... l
                int i=pos[x];
                for(int k=i-1;k>=r+1-x;k--){
                    cur++;
                    swap(pos[a[k]],pos[a[k+1]]);
                    swap(a[k],a[k+1]);
                }
            }
            cnt[l][r]=cur;
        }
    }
    int dp[n+5];
    fill(dp,dp+n+1,1e9);
    dp[0]=0;
    for(int l=1;l<=n;l++){
        for(int r=l;r<=n;r++){
            dp[r]=min(dp[r],dp[l-1]+cnt[l][r]);
        }
    }
    cout<<dp[n];
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 32 / 32
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36