oj.uz

답안 #638503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638503 2022-09-06T09:56:03 Z qwerasdfzxcl 전선 연결 (IOI17_wiring) C++17
100 / 100
 37 ms 12920 KB 
///https://cologne.tistory.com/28
#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr ll INF = 1e18;

long long min_total_length(std::vector<int> R, std::vector<int> B) {
    int n = R.size() + B.size();
	vector<pair<int, int>> a = {{0, -1}};
	vector<ll> S(n+1, 0), dp(n+1, INF), B2, prf(n+2, INF), suf(n+2, INF);
    vector<int> Blen;

    ///merge
    int pt = 0;
    R.push_back(1e9+100);
    for (int i=0;i<(int)R.size();i++){
        while(pt<(int)B.size() && B[pt]<R[i]){
            a.emplace_back(B[pt], 1);
            ++pt;
        }

        a.emplace_back(R[i], 0);
    }
    a.pop_back();
    assert((int)a.size()==n+1);

    for (int i=1;i<=n;i++) S[i] = S[i-1] + a[i].first;


    ///dp
    int r;
    dp[0] = 0;
    for (int i=1;i<=n;i=r+1){
        r = i;
        while(r<n && a[r+1].second==a[i].second) ++r;

        ///dp calc
        if (Blen.size() >= 2 && Blen.back()==1) for (int j=i;j<=r;j++) { /// SSS...SS / T / SSS...SS
            dp[j] = min(dp[j], *(++B2.rbegin()) + (S[j] - S[i-1]) - (ll)a[i-1].first * (j-i+1));
        }

        if (Blen.size() >= 1) for (int j=i;j<=r;j++) { /// SSS...SS / TTT...TT
            int cnt = j-i+1;
            dp[j] = min(dp[j], prf[min(cnt, Blen.back())] + (S[j] - S[i-1]) - (ll)a[i-1].first * cnt); /// S count <= T count
            dp[j] = min(dp[j], suf[min(cnt, Blen.back()+1)] + (S[j] - S[i-1]) - (ll)a[i].first * cnt); /// S count >= T count
        }

        //for (int j=i;j<=r;j++) printf("%lld ", dp[j]);
        if (r==n) break;

        ///Blen, B2, prf, suf calc
        Blen.push_back(r-i+1);
        B2.push_back(INF);
        for (int j=i;j<=r;j++) B2.back() = min(B2.back(), dp[j-1] + (ll)a[r+1].first * (r-j+1) - (S[r] - S[j-1]));

        prf[0] = suf[r-i+2] = INF;
        for (int j=i;j<=r;j++){
            int cnt = r-j+1;
            prf[cnt] = dp[j-1] - (S[r] - S[j-1]) + (ll)a[r].first * (cnt);
            suf[cnt] = dp[j-1] - (S[r] - S[j-1]) + (ll)a[r+1].first * (cnt);
        }

        for (int j=1;j<=r-i+1;j++) prf[j] = min(prf[j-1], prf[j]);
        for (int j=r-i+1;j;j--) suf[j] = min(suf[j+1], suf[j]);
    }
    //printf("\n");
    return dp[n];
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 296 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 22 ms 10176 KB Output is correct
4 Correct 23 ms 10212 KB Output is correct
5 Correct 24 ms 9884 KB Output is correct
6 Correct 34 ms 12576 KB Output is correct
7 Correct 28 ms 12580 KB Output is correct
8 Correct 27 ms 12576 KB Output is correct
9 Correct 27 ms 12568 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 37 ms 12920 KB Output is correct
4 Correct 29 ms 12196 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 30 ms 12776 KB Output is correct
19 Correct 30 ms 12824 KB Output is correct
20 Correct 29 ms 12580 KB Output is correct
21 Correct 29 ms 12828 KB Output is correct
22 Correct 30 ms 12832 KB Output is correct
23 Correct 29 ms 12816 KB Output is correct
24 Correct 30 ms 12816 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 11896 KB Output is correct
3 Correct 26 ms 11952 KB Output is correct
4 Correct 25 ms 11936 KB Output is correct
5 Correct 27 ms 11936 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 24 ms 11840 KB Output is correct
19 Correct 25 ms 11936 KB Output is correct
20 Correct 26 ms 11940 KB Output is correct
21 Correct 24 ms 11932 KB Output is correct
22 Correct 25 ms 11976 KB Output is correct
23 Correct 24 ms 11940 KB Output is correct
24 Correct 23 ms 11976 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 22 ms 10176 KB Output is correct
20 Correct 23 ms 10212 KB Output is correct
21 Correct 24 ms 9884 KB Output is correct
22 Correct 34 ms 12576 KB Output is correct
23 Correct 28 ms 12580 KB Output is correct
24 Correct 27 ms 12576 KB Output is correct
25 Correct 27 ms 12568 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 37 ms 12920 KB Output is correct
29 Correct 29 ms 12196 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 296 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 296 KB Output is correct
43 Correct 30 ms 12776 KB Output is correct
44 Correct 30 ms 12824 KB Output is correct
45 Correct 29 ms 12580 KB Output is correct
46 Correct 29 ms 12828 KB Output is correct
47 Correct 30 ms 12832 KB Output is correct
48 Correct 29 ms 12816 KB Output is correct
49 Correct 30 ms 12816 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 26 ms 11896 KB Output is correct
52 Correct 26 ms 11952 KB Output is correct
53 Correct 25 ms 11936 KB Output is correct
54 Correct 27 ms 11936 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 300 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 304 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 24 ms 11840 KB Output is correct
68 Correct 25 ms 11936 KB Output is correct
69 Correct 26 ms 11940 KB Output is correct
70 Correct 24 ms 11932 KB Output is correct
71 Correct 25 ms 11976 KB Output is correct
72 Correct 24 ms 11940 KB Output is correct
73 Correct 23 ms 11976 KB Output is correct
74 Correct 28 ms 12608 KB Output is correct
75 Correct 26 ms 12192 KB Output is correct
76 Correct 28 ms 12608 KB Output is correct
77 Correct 29 ms 12064 KB Output is correct
78 Correct 24 ms 12024 KB Output is correct
79 Correct 25 ms 11932 KB Output is correct
80 Correct 24 ms 11936 KB Output is correct
81 Correct 27 ms 12068 KB Output is correct
82 Correct 28 ms 12104 KB Output is correct
83 Correct 26 ms 12224 KB Output is correct
84 Correct 27 ms 12560 KB Output is correct
85 Correct 28 ms 12616 KB Output is correct
86 Correct 28 ms 12592 KB Output is correct
87 Correct 28 ms 12572 KB Output is correct
88 Correct 32 ms 12572 KB Output is correct
89 Correct 28 ms 12588 KB Output is correct
90 Correct 27 ms 12576 KB Output is correct
91 Correct 29 ms 12580 KB Output is correct
92 Correct 28 ms 12712 KB Output is correct
93 Correct 27 ms 12560 KB Output is correct
94 Correct 28 ms 12564 KB Output is correct
95 Correct 27 ms 12584 KB Output is correct
96 Correct 27 ms 12608 KB Output is correct
97 Correct 30 ms 12572 KB Output is correct
98 Correct 28 ms 12560 KB Output is correct
99 Correct 28 ms 12616 KB Output is correct
100 Correct 28 ms 12616 KB Output is correct
101 Correct 30 ms 12580 KB Output is correct
102 Correct 28 ms 12572 KB Output is correct