oj.uz

답안 #851333

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851333 2023-09-19T15:33:59 Z ntkphong 전선 연결 (IOI17_wiring) C++14
100 / 100
 44 ms 12496 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
const int mxN = 2e5 + 10;
long long dp[mxN][2];

long long min_total_length(vector<int> r, vector<int> b) {
    
    int n = r.size() + b.size();
    vector<pair<long long, int>> arr(n + 5);
    vector<long long> prefix(n + 1, 0);
    vector<int> L, R;
    
    for(int i = 0; i < r.size(); i ++) arr[i + 1] = {r[i], 0};
    for(int i = 0; i < b.size(); i ++) arr[r.size() + i + 1] = {b[i], 1};
    
    sort(arr.begin() + 1, arr.begin() + n + 1);
    
    for(int i = 1; i <= n; i ++) 
        prefix[i] = prefix[i - 1] + arr[i].first;
    
    auto get = [&](int l, int r) {
        return prefix[r] - prefix[l - 1];
    };
    
    for(int i = 1, j = 1; i <= n; i = j + 1) {
        for(j = i; j + 1 <= n && arr[j + 1].second == arr[i].second; ) j ++ ;
        
        L.push_back(i);
        R.push_back(j);
    }
    
    arr[0] = {- INF, 0};
    arr[n + 1] = {INF, 0};
    
    for(int i = 1; i <= n; i ++) {
        dp[i][0] = dp[i][1] = INF;
    }
    
    for(int i = 0; i < L.size(); i ++) {

        for(int j = L[i]; j <= R[i]; j ++) {
            
            if(j == L[i]) {
                dp[j][0] = min({dp[j][0], 
                                dp[j - 1][0] + arr[j].first - arr[L[i] - 1].first,
                                dp[j - 1][1] + arr[j].first - arr[L[i] - 1].first});
            } else 
                dp[j][0] = min(dp[j][0], dp[j - 1][0] + arr[j].first - arr[L[i] - 1].first);
            
            dp[j][1] = min({dp[j][1], 
                            dp[j - 1][0] + arr[R[i] + 1].first - arr[j].first,
                            dp[j - 1][1] + arr[R[i] + 1].first - arr[j].first});
        }
        
        if(i + 1 < L.size()) {
            for(int j = L[i]; j <= R[i]; j ++) {
                int k = R[i] - j + 1;
                
                if(R[i + 1] - L[i + 1] + 1 < k) continue ;
                dp[R[i] + k][0] = min({dp[R[i] + k][0], 
                                       dp[j - 1][0] + get(R[i] + 1, R[i] + k) - get(j, R[i]),
                                       dp[j - 1][1] + get(R[i] + 1, R[i] + k) - get(j, R[i])});
            }
        }
    }
    
    return dp[n][0];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i = 0; i < r.size(); i ++) arr[i + 1] = {r[i], 0};
      |                    ~~^~~~~~~~~~
wiring.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i = 0; i < b.size(); i ++) arr[r.size() + i + 1] = {b[i], 1};
      |                    ~~^~~~~~~~~~
wiring.cpp:42:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i = 0; i < L.size(); i ++) {
      |                    ~~^~~~~~~~~~
wiring.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         if(i + 1 < L.size()) {
      |            ~~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 20 ms 9040 KB Output is correct
4 Correct 19 ms 8796 KB Output is correct
5 Correct 19 ms 9040 KB Output is correct
6 Correct 26 ms 11600 KB Output is correct
7 Correct 29 ms 11600 KB Output is correct
8 Correct 26 ms 11764 KB Output is correct
9 Correct 26 ms 11604 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 39 ms 11704 KB Output is correct
4 Correct 37 ms 11724 KB Output is correct
5 Correct 1 ms 344 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 344 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 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 38 ms 12328 KB Output is correct
19 Correct 38 ms 12320 KB Output is correct
20 Correct 41 ms 12232 KB Output is correct
21 Correct 36 ms 12236 KB Output is correct
22 Correct 38 ms 12248 KB Output is correct
23 Correct 44 ms 12240 KB Output is correct
24 Correct 42 ms 12496 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 31 ms 10832 KB Output is correct
3 Correct 39 ms 11600 KB Output is correct
4 Correct 36 ms 11088 KB Output is correct
5 Correct 34 ms 11344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 31 ms 10832 KB Output is correct
19 Correct 32 ms 11088 KB Output is correct
20 Correct 31 ms 10832 KB Output is correct
21 Correct 30 ms 11100 KB Output is correct
22 Correct 31 ms 10832 KB Output is correct
23 Correct 27 ms 11056 KB Output is correct
24 Correct 29 ms 10832 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 756 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 20 ms 9040 KB Output is correct
20 Correct 19 ms 8796 KB Output is correct
21 Correct 19 ms 9040 KB Output is correct
22 Correct 26 ms 11600 KB Output is correct
23 Correct 29 ms 11600 KB Output is correct
24 Correct 26 ms 11764 KB Output is correct
25 Correct 26 ms 11604 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 39 ms 11704 KB Output is correct
29 Correct 37 ms 11724 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 38 ms 12328 KB Output is correct
44 Correct 38 ms 12320 KB Output is correct
45 Correct 41 ms 12232 KB Output is correct
46 Correct 36 ms 12236 KB Output is correct
47 Correct 38 ms 12248 KB Output is correct
48 Correct 44 ms 12240 KB Output is correct
49 Correct 42 ms 12496 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 31 ms 10832 KB Output is correct
52 Correct 39 ms 11600 KB Output is correct
53 Correct 36 ms 11088 KB Output is correct
54 Correct 34 ms 11344 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 31 ms 10832 KB Output is correct
68 Correct 32 ms 11088 KB Output is correct
69 Correct 31 ms 10832 KB Output is correct
70 Correct 30 ms 11100 KB Output is correct
71 Correct 31 ms 10832 KB Output is correct
72 Correct 27 ms 11056 KB Output is correct
73 Correct 29 ms 10832 KB Output is correct
74 Correct 26 ms 11824 KB Output is correct
75 Correct 34 ms 11344 KB Output is correct
76 Correct 32 ms 11580 KB Output is correct
77 Correct 31 ms 11088 KB Output is correct
78 Correct 31 ms 11088 KB Output is correct
79 Correct 31 ms 11120 KB Output is correct
80 Correct 26 ms 11088 KB Output is correct
81 Correct 33 ms 11096 KB Output is correct
82 Correct 26 ms 11088 KB Output is correct
83 Correct 25 ms 11344 KB Output is correct
84 Correct 25 ms 11600 KB Output is correct
85 Correct 33 ms 11600 KB Output is correct
86 Correct 29 ms 11600 KB Output is correct
87 Correct 29 ms 11820 KB Output is correct
88 Correct 30 ms 11600 KB Output is correct
89 Correct 29 ms 11600 KB Output is correct
90 Correct 35 ms 11720 KB Output is correct
91 Correct 28 ms 11600 KB Output is correct
92 Correct 30 ms 11600 KB Output is correct
93 Correct 28 ms 11600 KB Output is correct
94 Correct 30 ms 11584 KB Output is correct
95 Correct 31 ms 11604 KB Output is correct
96 Correct 27 ms 11608 KB Output is correct
97 Correct 28 ms 11696 KB Output is correct
98 Correct 29 ms 11608 KB Output is correct
99 Correct 30 ms 11688 KB Output is correct
100 Correct 32 ms 11608 KB Output is correct
101 Correct 28 ms 11648 KB Output is correct
102 Correct 33 ms 11612 KB Output is correct