oj.uz

답안 #998378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998378 2024-06-13T18:18:25 Z MarwenElarbi Group Photo (JOI21_ho_t3) C++17
100 / 100
 332 ms 196420 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int nax=1e5+5;
int main() {
    int n;
    cin>>n;
    int tab[n+1];
    int pos[n+1];
    for (int i = 1; i <= n; ++i)
    {
        cin>>tab[i];
        pos[tab[i]]=i;
    }
    int pre[n+1][n+1];
    int cost[n+1][n+1];
    memset(pre,0,sizeof pre);
    memset(cost,0,sizeof cost);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            pre[i][j]=pre[i][j-1]+(pos[j]>pos[i]);
        }
    }
    for (int i = 1; i <= n; ++i)
    {
        for (int j = i; j <= n; ++j)
        {
            cost[i][j]+=pre[j][i-1];
            if(j>i){
                cost[i][j]+=cost[i][j-1];
                cost[i][j]+=(j-i);
                cost[i][j]-=(pre[j][j-1]-pre[j][i-1]);
            }
            //cout <<i<<" "<<j<<" "<<cost[i][j]<<endl;
        }
    }
    ll dp[n+1];
    for (int i = 0; i <= n; ++i) dp[i]=1e18;
    dp[0]=0;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= i; ++j)
        {
            dp[i]=min(dp[i],dp[j-1]+cost[j][i]);
        }
    }
    cout <<dp[n]<<endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 600 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 7 ms 5300 KB Output is correct
32 Correct 6 ms 5468 KB Output is correct
33 Correct 6 ms 5212 KB Output is correct
34 Correct 6 ms 5464 KB Output is correct
35 Correct 7 ms 5468 KB Output is correct
36 Correct 8 ms 5464 KB Output is correct
37 Correct 8 ms 5468 KB Output is correct
38 Correct 7 ms 5468 KB Output is correct
39 Correct 7 ms 5256 KB Output is correct
40 Correct 8 ms 5464 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 7 ms 5300 KB Output is correct
32 Correct 6 ms 5468 KB Output is correct
33 Correct 6 ms 5212 KB Output is correct
34 Correct 6 ms 5464 KB Output is correct
35 Correct 7 ms 5468 KB Output is correct
36 Correct 8 ms 5464 KB Output is correct
37 Correct 8 ms 5468 KB Output is correct
38 Correct 7 ms 5468 KB Output is correct
39 Correct 7 ms 5256 KB Output is correct
40 Correct 8 ms 5464 KB Output is correct
41 Correct 331 ms 196044 KB Output is correct
42 Correct 323 ms 195972 KB Output is correct
43 Correct 332 ms 196176 KB Output is correct
44 Correct 277 ms 195992 KB Output is correct
45 Correct 286 ms 196392 KB Output is correct
46 Correct 297 ms 196180 KB Output is correct
47 Correct 331 ms 196176 KB Output is correct
48 Correct 295 ms 196184 KB Output is correct
49 Correct 298 ms 196244 KB Output is correct
50 Correct 303 ms 196128 KB Output is correct
51 Correct 307 ms 196252 KB Output is correct
52 Correct 317 ms 196180 KB Output is correct
53 Correct 299 ms 196180 KB Output is correct
54 Correct 313 ms 196280 KB Output is correct
55 Correct 309 ms 196420 KB Output is correct