oj.uz

답안 #434528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434528 2021-06-21T11:40:13 Z Everule 전선 연결 (IOI17_wiring) C++17
100 / 100
 53 ms 9288 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#include "wiring.h"
const ll INF = 1e18;
long long min_total_length(std::vector<int> a, std::vector<int> b) {
    int n = a.size();
    int m = b.size();
    vector<vector<int>> ord;
    for(int i=0,j=0;i<n;i++){
        if(j < m && b[j] < a[i]){
            ord.push_back({});
            while(j < m && b[j] < a[i]){
                ord.back().push_back(b[j]);
                j++;
            }
            ord.push_back({});
        }
        if(ord.size() == 0) ord.push_back({});
        ord.back().push_back(a[i]);
        if(i == n - 1){
            if(j < m){
                ord.push_back({});
                while(j < m){
                    ord.back().push_back(b[j]);
                    j++;
                }
            }
        }
    }
    int r = ord.size();
    /*
    cout<<r<<"\n";
    for(auto &v : ord){
        for(auto &x : v){
            cout<<x<<" ";
        }
        cout<<"\n";
    }
    */
    vector<vector<ll>> dp(r);
    for(int i=0;i<r;i++){
        dp[i].assign(ord[i].size() + 1, INF);
    }
    [&](){
        int wl = ord[0].size();
        ll ans = 0;
        for(auto &x : ord[0]) ans -= x;
        dp[1][0] = INF;
        dp[1][1] = ans + ll(wl) * ord[1][0];
        for(int i=1;i<ord[1].size();i++){
            if(i < wl) dp[1][i+1] = dp[1][i] + (ord[1][i] - ord[1][0]);
            else dp[1][i+1] = dp[1][i] + (ord[1][i] - ord[0].back());
        }
    }();
    for(int i=2;i<r;i++){
        dp[i][0] = dp[i-1].back();
        for(ll j=dp[i-1].size()-1,sum = 0;j>=0;j--){
            dp[i-1][j] += sum;
            if(j != 0) sum += ord[i][0] - ord[i-1][j-1];
        }
        for(int j=1;j<dp[i-1].size();j++){
            dp[i-1][j] = min(dp[i-1][j-1], dp[i-1][j]);
        }
        ll bst = *min_element(dp[i-1].begin(), dp[i-1].end());
        ll def = 0;
        for(int j=0;j<ord[i].size();j++){
            def += ord[i][j] - ord[i-1].back();
            if(j+2 <= dp[i-1].size()){
                dp[i-1].end()[-(j+2)] -= ll(j + 1) * (ord[i][0] - ord[i-1].back());
                bst = min(bst, dp[i-1].end()[-(j+2)]);
            }
          
            dp[i][j+1] = bst + def;
        }        
    }
    /*
    for(auto &v : dp){
        for(auto &x : v){
            cout<<x<<" ";
        }
        cout<<"\n";
    }
    */
    return dp.back().back();
}

Compilation message

wiring.cpp: In lambda function:
wiring.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for(int i=1;i<ord[1].size();i++){
      |                     ~^~~~~~~~~~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(int j=1;j<dp[i-1].size();j++){
      |                     ~^~~~~~~~~~~~~~~
wiring.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int j=0;j<ord[i].size();j++){
      |                     ~^~~~~~~~~~~~~~
wiring.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             if(j+2 <= dp[i-1].size()){
      |                ~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 28 ms 3432 KB Output is correct
4 Correct 21 ms 3396 KB Output is correct
5 Correct 24 ms 3256 KB Output is correct
6 Correct 38 ms 4260 KB Output is correct
7 Correct 28 ms 4276 KB Output is correct
8 Correct 28 ms 4268 KB Output is correct
9 Correct 29 ms 4296 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 46 ms 9208 KB Output is correct
4 Correct 37 ms 7016 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 48 ms 9288 KB Output is correct
19 Correct 50 ms 9208 KB Output is correct
20 Correct 49 ms 7024 KB Output is correct
21 Correct 46 ms 9192 KB Output is correct
22 Correct 45 ms 8552 KB Output is correct
23 Correct 44 ms 8556 KB Output is correct
24 Correct 43 ms 8552 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 26 ms 4280 KB Output is correct
3 Correct 34 ms 6076 KB Output is correct
4 Correct 27 ms 4404 KB Output is correct
5 Correct 38 ms 5984 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 26 ms 4292 KB Output is correct
19 Correct 30 ms 4292 KB Output is correct
20 Correct 27 ms 4540 KB Output is correct
21 Correct 34 ms 4416 KB Output is correct
22 Correct 26 ms 4296 KB Output is correct
23 Correct 27 ms 4400 KB Output is correct
24 Correct 34 ms 4268 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 28 ms 3432 KB Output is correct
20 Correct 21 ms 3396 KB Output is correct
21 Correct 24 ms 3256 KB Output is correct
22 Correct 38 ms 4260 KB Output is correct
23 Correct 28 ms 4276 KB Output is correct
24 Correct 28 ms 4268 KB Output is correct
25 Correct 29 ms 4296 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 46 ms 9208 KB Output is correct
29 Correct 37 ms 7016 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 48 ms 9288 KB Output is correct
44 Correct 50 ms 9208 KB Output is correct
45 Correct 49 ms 7024 KB Output is correct
46 Correct 46 ms 9192 KB Output is correct
47 Correct 45 ms 8552 KB Output is correct
48 Correct 44 ms 8556 KB Output is correct
49 Correct 43 ms 8552 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 26 ms 4280 KB Output is correct
52 Correct 34 ms 6076 KB Output is correct
53 Correct 27 ms 4404 KB Output is correct
54 Correct 38 ms 5984 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 26 ms 4292 KB Output is correct
68 Correct 30 ms 4292 KB Output is correct
69 Correct 27 ms 4540 KB Output is correct
70 Correct 34 ms 4416 KB Output is correct
71 Correct 26 ms 4296 KB Output is correct
72 Correct 27 ms 4400 KB Output is correct
73 Correct 34 ms 4268 KB Output is correct
74 Correct 53 ms 4276 KB Output is correct
75 Correct 28 ms 4228 KB Output is correct
76 Correct 30 ms 4284 KB Output is correct
77 Correct 28 ms 4288 KB Output is correct
78 Correct 27 ms 4284 KB Output is correct
79 Correct 27 ms 4220 KB Output is correct
80 Correct 28 ms 4268 KB Output is correct
81 Correct 37 ms 4200 KB Output is correct
82 Correct 29 ms 4268 KB Output is correct
83 Correct 28 ms 4404 KB Output is correct
84 Correct 30 ms 4520 KB Output is correct
85 Correct 31 ms 4268 KB Output is correct
86 Correct 31 ms 4268 KB Output is correct
87 Correct 31 ms 4400 KB Output is correct
88 Correct 33 ms 4196 KB Output is correct
89 Correct 30 ms 4160 KB Output is correct
90 Correct 30 ms 4280 KB Output is correct
91 Correct 30 ms 4404 KB Output is correct
92 Correct 31 ms 4200 KB Output is correct
93 Correct 30 ms 4268 KB Output is correct
94 Correct 30 ms 4272 KB Output is correct
95 Correct 39 ms 4276 KB Output is correct
96 Correct 30 ms 4412 KB Output is correct
97 Correct 30 ms 4144 KB Output is correct
98 Correct 40 ms 4288 KB Output is correct
99 Correct 30 ms 4276 KB Output is correct
100 Correct 31 ms 4212 KB Output is correct
101 Correct 30 ms 4148 KB Output is correct
102 Correct 30 ms 4268 KB Output is correct