oj.uz

답안 #996476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996476 2024-06-10T16:59:33 Z amine_aroua Group Photo (JOI21_ho_t3) C++17
100 / 100
 364 ms 392528 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
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[j][i - 1];
            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
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 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 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 0 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 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 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 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 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 7 ms 10332 KB Output is correct
32 Correct 8 ms 10332 KB Output is correct
33 Correct 8 ms 10332 KB Output is correct
34 Correct 6 ms 10332 KB Output is correct
35 Correct 6 ms 10328 KB Output is correct
36 Correct 7 ms 10328 KB Output is correct
37 Correct 6 ms 10332 KB Output is correct
38 Correct 7 ms 10332 KB Output is correct
39 Correct 7 ms 10332 KB Output is correct
40 Correct 6 ms 10448 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 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 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 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 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 7 ms 10332 KB Output is correct
32 Correct 8 ms 10332 KB Output is correct
33 Correct 8 ms 10332 KB Output is correct
34 Correct 6 ms 10332 KB Output is correct
35 Correct 6 ms 10328 KB Output is correct
36 Correct 7 ms 10328 KB Output is correct
37 Correct 6 ms 10332 KB Output is correct
38 Correct 7 ms 10332 KB Output is correct
39 Correct 7 ms 10332 KB Output is correct
40 Correct 6 ms 10448 KB Output is correct
41 Correct 323 ms 391872 KB Output is correct
42 Correct 326 ms 392116 KB Output is correct
43 Correct 343 ms 392104 KB Output is correct
44 Correct 351 ms 392164 KB Output is correct
45 Correct 340 ms 392272 KB Output is correct
46 Correct 350 ms 392316 KB Output is correct
47 Correct 348 ms 392288 KB Output is correct
48 Correct 344 ms 392272 KB Output is correct
49 Correct 344 ms 392220 KB Output is correct
50 Correct 347 ms 392276 KB Output is correct
51 Correct 362 ms 392528 KB Output is correct
52 Correct 348 ms 392272 KB Output is correct
53 Correct 353 ms 392272 KB Output is correct
54 Correct 353 ms 392356 KB Output is correct
55 Correct 364 ms 392340 KB Output is correct