oj.uz

답안 #497875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497875 2021-12-24T02:37:36 Z kevin 전선 연결 (IOI17_wiring) C++17
100 / 100
 61 ms 9056 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
#define nl cout<<"\n"

const int MAXN = 5e5 + 5;

ll min_total_length(vector<int> a, vector<int> b){
    vector<pair<ll, int>> ar;
    for(int i:a) ar.push_back({(ll)i, 0});
    for(int i:b) ar.push_back({(ll)i, 1});
    sort(ar.begin(), ar.end());
    int p = 0;
    int pv = -1;
    vector<ll> val[2];
    while(p < (int)ar.size()){
        vector<ll> v;
        ll x = ar[p].f;
        v.push_back(x);
        while(p < (int)ar.size() - 1 && ar[p].s == ar[p+1].s) v.push_back(ar[++p].f);
        p++;
        ll iv = (p == (int)ar.size()?0:ar[p].f-ar[p-1].f);
        if(pv == -1){
            if(p == (int)ar.size()) return 0;
            val[0] = val[1] = vector<ll>(v.size() + 1, 1e18);
            ll sm = 0;
            for(ll i:v) sm += v.back() - i;
            val[0][v.size()] = val[1][v.size()] = sm;
        }
        else{
            vector<ll> nxt(v.size() + 1);
            ll lsm = 0;
            ll rsm = 0;
            for(int i=0; i<(int)v.size(); i++) rsm += v.back() - v[i];
            nxt[v.size()] = val[0][0] + rsm;
            for(int i=1; i<=(int)v.size(); i++){
                lsm += v[i-1] - v[0];
                rsm -= v.back() - v[i-1];
                int id = min(i, (int)val[0].size()-1);
                nxt[v.size()-i] = min(val[0][id] + (ll)(i) * (x-pv), (ll)(i<(int)val[1].size()?val[1][i]:1e18)) + lsm + rsm;
            }
            val[0] = nxt;
            nxt.clear();
        }
        val[1] = val[0];
        pv = ar[p-1].f;      
        for(int i=0; i<val[0].size(); i++) val[1][i] += i * iv;
        for(int i=1; i<(int)val[0].size(); i++){
            val[0][i] = min(val[0][i], val[0][i-1]);
            val[1][val[0].size()-1-i] = min(val[1][val[0].size()-i], val[1][val[0].size()-1-i]);
        }
        if(p == ar.size()) return val[0][0];
    }
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:52:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(int i=0; i<val[0].size(); i++) val[1][i] += i * iv;
      |                      ~^~~~~~~~~~~~~~
wiring.cpp:57:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if(p == ar.size()) return val[0][0];
      |            ~~^~~~~~~~~~~~
wiring.cpp:14:27: warning: control reaches end of non-void function [-Wreturn-type]
   14 |     vector<pair<ll, int>> ar;
      |                           ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 0 ms 204 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 23 ms 6376 KB Output is correct
4 Correct 33 ms 6368 KB Output is correct
5 Correct 24 ms 7992 KB Output is correct
6 Correct 31 ms 9056 KB Output is correct
7 Correct 30 ms 8368 KB Output is correct
8 Correct 30 ms 8336 KB Output is correct
9 Correct 30 ms 8304 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 48 ms 6052 KB Output is correct
4 Correct 45 ms 6056 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 45 ms 6052 KB Output is correct
19 Correct 61 ms 6052 KB Output is correct
20 Correct 46 ms 6056 KB Output is correct
21 Correct 45 ms 6088 KB Output is correct
22 Correct 48 ms 6080 KB Output is correct
23 Correct 48 ms 6052 KB Output is correct
24 Correct 46 ms 5996 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 34 ms 6064 KB Output is correct
3 Correct 53 ms 6056 KB Output is correct
4 Correct 43 ms 6056 KB Output is correct
5 Correct 43 ms 6060 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 38 ms 6544 KB Output is correct
19 Correct 36 ms 6076 KB Output is correct
20 Correct 34 ms 6076 KB Output is correct
21 Correct 38 ms 6056 KB Output is correct
22 Correct 37 ms 8708 KB Output is correct
23 Correct 40 ms 7684 KB Output is correct
24 Correct 30 ms 8624 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 23 ms 6376 KB Output is correct
20 Correct 33 ms 6368 KB Output is correct
21 Correct 24 ms 7992 KB Output is correct
22 Correct 31 ms 9056 KB Output is correct
23 Correct 30 ms 8368 KB Output is correct
24 Correct 30 ms 8336 KB Output is correct
25 Correct 30 ms 8304 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 48 ms 6052 KB Output is correct
29 Correct 45 ms 6056 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 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 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 45 ms 6052 KB Output is correct
44 Correct 61 ms 6052 KB Output is correct
45 Correct 46 ms 6056 KB Output is correct
46 Correct 45 ms 6088 KB Output is correct
47 Correct 48 ms 6080 KB Output is correct
48 Correct 48 ms 6052 KB Output is correct
49 Correct 46 ms 5996 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 34 ms 6064 KB Output is correct
52 Correct 53 ms 6056 KB Output is correct
53 Correct 43 ms 6056 KB Output is correct
54 Correct 43 ms 6060 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 38 ms 6544 KB Output is correct
68 Correct 36 ms 6076 KB Output is correct
69 Correct 34 ms 6076 KB Output is correct
70 Correct 38 ms 6056 KB Output is correct
71 Correct 37 ms 8708 KB Output is correct
72 Correct 40 ms 7684 KB Output is correct
73 Correct 30 ms 8624 KB Output is correct
74 Correct 30 ms 7936 KB Output is correct
75 Correct 42 ms 7072 KB Output is correct
76 Correct 42 ms 7292 KB Output is correct
77 Correct 36 ms 7732 KB Output is correct
78 Correct 36 ms 7968 KB Output is correct
79 Correct 43 ms 7196 KB Output is correct
80 Correct 44 ms 7472 KB Output is correct
81 Correct 45 ms 8064 KB Output is correct
82 Correct 28 ms 7480 KB Output is correct
83 Correct 39 ms 7604 KB Output is correct
84 Correct 30 ms 7456 KB Output is correct
85 Correct 39 ms 7088 KB Output is correct
86 Correct 45 ms 7836 KB Output is correct
87 Correct 35 ms 7588 KB Output is correct
88 Correct 35 ms 6668 KB Output is correct
89 Correct 33 ms 7332 KB Output is correct
90 Correct 41 ms 8104 KB Output is correct
91 Correct 34 ms 7620 KB Output is correct
92 Correct 36 ms 7728 KB Output is correct
93 Correct 36 ms 7060 KB Output is correct
94 Correct 35 ms 7840 KB Output is correct
95 Correct 38 ms 7204 KB Output is correct
96 Correct 34 ms 7456 KB Output is correct
97 Correct 33 ms 8832 KB Output is correct
98 Correct 35 ms 9020 KB Output is correct
99 Correct 35 ms 9008 KB Output is correct
100 Correct 39 ms 7676 KB Output is correct
101 Correct 33 ms 7952 KB Output is correct
102 Correct 43 ms 7560 KB Output is correct