oj.uz

답안 #938548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938548 2024-03-05T10:02:34 Z the_coding_pooh Group Photo (JOI21_ho_t3) C++14
100 / 100
 283 ms 840 KB 
#include <bits/stdc++.h>
#define uwu return 0;

using namespace std;

#define int _int
using _int = long long;

const int SIZE = 5e3 + 5, INF = 1e9 + 7;

int dp[SIZE];

struct BITree{
    int BIT[SIZE];

    void init(){
        for (int i = 0; i < SIZE;i++){
            BIT[i] = 0;
        }
        return;
    }

    void modify(int pos, int val){
        for (; pos < SIZE;pos += (pos & -pos)){
            BIT[pos] += val;
        }
        return;
    }

    int query(int pos){
        int ret = 0;
        for (; pos; pos -= (pos & -pos)){
            ret += BIT[pos];
        }
        return ret;
    }

}lss_amnt, grt_amnt;

int N;

int pos[SIZE];

signed main(){
    cin >> N;
    int in_i;
    for (int i = 1; i <= N;i++){
        cin >> in_i;
        pos[in_i] = i;
    }

    int shift;

    //dp[i] = with i ~ i inserted, the minimum numbers of switch needed

    for (int i = 1; i <= N;i++){
        shift = 0;
        dp[i] = INF;
        grt_amnt.init();
        lss_amnt.modify(pos[i], 1);
        //from j to i is the last decreasing
        for (int j = i; j >= 1;j--){
            shift += i - lss_amnt.query(pos[j]) - grt_amnt.query(pos[j]);
            dp[i] = min(dp[i], dp[j - 1] + shift);
            grt_amnt.modify(pos[j], 1);
        }
    }

    cout << dp[N] << '\n';
}

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 1 ms 344 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 440 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 348 KB Output is correct
10 Correct 0 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 1 ms 344 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 440 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 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 1 ms 344 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 440 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 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 1 ms 344 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 440 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 5 ms 348 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 5 ms 348 KB Output is correct
36 Correct 4 ms 348 KB Output is correct
37 Correct 5 ms 348 KB Output is correct
38 Correct 5 ms 436 KB Output is correct
39 Correct 5 ms 348 KB Output is correct
40 Correct 4 ms 508 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 1 ms 344 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 440 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 5 ms 348 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 5 ms 348 KB Output is correct
36 Correct 4 ms 348 KB Output is correct
37 Correct 5 ms 348 KB Output is correct
38 Correct 5 ms 436 KB Output is correct
39 Correct 5 ms 348 KB Output is correct
40 Correct 4 ms 508 KB Output is correct
41 Correct 271 ms 584 KB Output is correct
42 Correct 267 ms 592 KB Output is correct
43 Correct 262 ms 592 KB Output is correct
44 Correct 267 ms 588 KB Output is correct
45 Correct 258 ms 596 KB Output is correct
46 Correct 261 ms 592 KB Output is correct
47 Correct 273 ms 736 KB Output is correct
48 Correct 270 ms 840 KB Output is correct
49 Correct 283 ms 580 KB Output is correct
50 Correct 263 ms 584 KB Output is correct
51 Correct 260 ms 584 KB Output is correct
52 Correct 261 ms 580 KB Output is correct
53 Correct 258 ms 596 KB Output is correct
54 Correct 281 ms 592 KB Output is correct
55 Correct 259 ms 596 KB Output is correct