oj.uz

답안 #996475

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996475 2024-06-10T16:57:05 Z amine_aroua Group Photo (JOI21_ho_t3) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define pb push_back
#define nl '\n'
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i, x, y) for(int i = x;i<=y;i++)
#define forn(i, y, x) for(int i = y; i >= x; i--)
const int INF = 1e18;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n ;
    cin>>n;
    vector<int> h(n + 1) , dp(n + 1 , INF) , pos(n + 1);
    forr(i , 1 , n)
    {
        cin>>h[i];
        pos[h[i]] = i;
    }
    dp[0] = 0;
    vector<vector<int>> prevInv(n + 1 , vector<int>(n + 1 , 0));
    vector<vector<int>> cost = prevInv;
    forr(i , 1 ,n)
    {
        forr(j , 1 , n)
        {
            prevInv[i][j] = prevInv[i][j - 1] + (pos[j] > pos[i]);
        }
    }
    forr(i , 1 , n)
    {
        forr(j , i , n)
        {
            cost[i][j]+=prevInv[i - 1][j];
            if(i < j)
            {
                cost[i][j]+= cost[i][j - 1];
                cost[i][j]+= (j - i);
                cost[i][j]-= (prevInv[j][j - 1] - prevInv[j][i - 1]);
            }
        }
    }
    forr(i , 1 , n)
        forr(j , 1 , i)
            dp[i] = min(dp[i] , dp[j - 1] + cost[j][i]);
    cout<<dp[n]<<nl;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -