oj.uz

답안 #666739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666739 2022-11-29T13:33:30 Z Astrayt Group Photo (JOI21_ho_t3) C++17
100 / 100
 360 ms 628 KB 
//君の手を握ってしまったら
//孤独を知らないこの街には
//もう二度と帰ってくることはできないのでしょう
//君が手を差し伸べた 光で影が生まれる
//歌って聞かせて この話の続き
//連れて行って見たことない星まで
//さユリ - 花の塔
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define starburst ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define maxn 5005
#define mod 1000000007

struct FenwickTree{
    int val[maxn];
    void init(){
        for(auto &x:val) x = 0;
    }
    void modify(int p, int x){
        for(; p < maxn; p += (p & -p)) val[p] += x;
    }
    int query(int p){
        int ret = 0;
        for(; p; p -= (p & -p)) ret += val[p];
        return ret;
    }
}bit;

void solve(){
    int n; cin >> n;
    vector<int> v(n + 1, 0), pos(n + 1, 0), dp(n + 1, 1e18);
    for(int i = 1; i <= n; ++i){
        cin >> v[i];
        pos[v[i]] = i;  
    }
    dp[0] = 0;
    bit.init();
    for(int i = 1; i <= n; ++i){
        FenwickTree tmp;
        tmp.init();
        bit.modify(pos[i], 1);
        int cur = 0;
        for(int j = i; j >= 1; --j){
            cur = cur - tmp.query(pos[j]) + (i - bit.query(pos[j]));
            tmp.modify(pos[j], 1);
            dp[i] = min(dp[j - 1] + cur, dp[i]);
        }
    }
    cout << dp[n] << '\n';
}

signed main(){
    starburst
    int t = 1; //cin >> t;
    while(t--) solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

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

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 360 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 10 ms 340 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 11 ms 420 KB Output is correct
34 Correct 9 ms 416 KB Output is correct
35 Correct 9 ms 420 KB Output is correct
36 Correct 9 ms 416 KB Output is correct
37 Correct 10 ms 424 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 9 ms 340 KB Output is correct
40 Correct 9 ms 340 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 360 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 10 ms 340 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 11 ms 420 KB Output is correct
34 Correct 9 ms 416 KB Output is correct
35 Correct 9 ms 420 KB Output is correct
36 Correct 9 ms 416 KB Output is correct
37 Correct 10 ms 424 KB Output is correct
38 Correct 9 ms 340 KB Output is correct
39 Correct 9 ms 340 KB Output is correct
40 Correct 9 ms 340 KB Output is correct
41 Correct 351 ms 512 KB Output is correct
42 Correct 360 ms 516 KB Output is correct
43 Correct 359 ms 468 KB Output is correct
44 Correct 359 ms 468 KB Output is correct
45 Correct 340 ms 516 KB Output is correct
46 Correct 358 ms 516 KB Output is correct
47 Correct 350 ms 512 KB Output is correct
48 Correct 360 ms 516 KB Output is correct
49 Correct 343 ms 468 KB Output is correct
50 Correct 357 ms 520 KB Output is correct
51 Correct 354 ms 516 KB Output is correct
52 Correct 351 ms 520 KB Output is correct
53 Correct 340 ms 588 KB Output is correct
54 Correct 350 ms 520 KB Output is correct
55 Correct 344 ms 628 KB Output is correct