oj.uz

Submission #482498

# Submission time Handle Problem Language Result Execution time Memory
482498 2021-10-25T02:08:34 Z couplefire Wiring (IOI17_wiring) C++17
100 / 100
 54 ms 10388 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll ckmin(ll &a, ll b){return a<b?a:a=b;}

ll min_total_length(vector<int> a, vector<int> b){
    int n = a.size(), m = b.size();
    vector<vector<int>> groups;
    vector<array<int, 2>> arr;
    for(auto x : a) arr.push_back({x, 0});
    for(auto x : b) arr.push_back({x, 1});
    sort(arr.begin(), arr.end());
    for(int i = 0; i<n+m; ++i){
        groups.push_back({arr[i][0]});
        while(i<n+m-1 && arr[i][1]==arr[i+1][1]) ++i, groups.back().push_back(arr[i][0]);
    }
    vector<ll> dp(n+m, 1e18);
    for(int i = 0, cnt = 0; i<groups.size(); cnt += groups[i].size(), ++i){
        ll s1 = 0, s2 = 0;
        for(int j = 0; j<groups[i].size(); ++j){
            ll prv = (cnt==0 && j==0)?0ll:dp[cnt+j-1];
            s2 += groups[i][j]; if(cnt && (int)groups[i-1].size()>j) s1 += groups[i-1][(int)groups[i-1].size()-1-j];
            if(cnt) ckmin(dp[cnt+j], prv+groups[i][j]-groups[i-1].back());
            if(cnt+groups[i].size()<n+m) ckmin(dp[cnt+j], prv+groups[i+1].front()-groups[i][j]);
            ll bruh = (!cnt || (int)groups[i-1].size()<=j || (i==1 && (int)groups[i-1].size()==j+1))?0ll:dp[cnt-j-2];
            if(cnt && (int)groups[i-1].size()>j) ckmin(dp[cnt+j], bruh+s2-s1);
        }
    }
    return dp[n+m-1];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:19:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0, cnt = 0; i<groups.size(); cnt += groups[i].size(), ++i){
      |                             ~^~~~~~~~~~~~~~
wiring.cpp:21:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |         for(int j = 0; j<groups[i].size(); ++j){
      |                        ~^~~~~~~~~~~~~~~~~
wiring.cpp:25:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |             if(cnt+groups[i].size()<n+m) ckmin(dp[cnt+j], prv+groups[i+1].front()-groups[i][j]);
      |                ~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 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 1 ms 204 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 0 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 292 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 24 ms 4864 KB Output is correct
4 Correct 24 ms 4836 KB Output is correct
5 Correct 24 ms 4960 KB Output is correct
6 Correct 34 ms 8372 KB Output is correct
7 Correct 35 ms 8472 KB Output is correct
8 Correct 35 ms 8444 KB Output is correct
9 Correct 42 ms 8456 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 54 ms 10312 KB Output is correct
4 Correct 51 ms 9624 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 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 0 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 0 ms 204 KB Output is correct
14 Correct 0 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 52 ms 10268 KB Output is correct
19 Correct 52 ms 10388 KB Output is correct
20 Correct 54 ms 9992 KB Output is correct
21 Correct 51 ms 10344 KB Output is correct
22 Correct 52 ms 10004 KB Output is correct
23 Correct 53 ms 10036 KB Output is correct
24 Correct 52 ms 10004 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 38 ms 5924 KB Output is correct
3 Correct 50 ms 7040 KB Output is correct
4 Correct 44 ms 7332 KB Output is correct
5 Correct 47 ms 8244 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 1 ms 204 KB Output is correct
10 Correct 0 ms 288 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 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 39 ms 7240 KB Output is correct
19 Correct 42 ms 7060 KB Output is correct
20 Correct 40 ms 7260 KB Output is correct
21 Correct 36 ms 7192 KB Output is correct
22 Correct 39 ms 7372 KB Output is correct
23 Correct 31 ms 7504 KB Output is correct
24 Correct 33 ms 7360 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory 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 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 1 ms 204 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 0 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 292 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 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 224 KB Output is correct
19 Correct 24 ms 4864 KB Output is correct
20 Correct 24 ms 4836 KB Output is correct
21 Correct 24 ms 4960 KB Output is correct
22 Correct 34 ms 8372 KB Output is correct
23 Correct 35 ms 8472 KB Output is correct
24 Correct 35 ms 8444 KB Output is correct
25 Correct 42 ms 8456 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 54 ms 10312 KB Output is correct
29 Correct 51 ms 9624 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 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 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 52 ms 10268 KB Output is correct
44 Correct 52 ms 10388 KB Output is correct
45 Correct 54 ms 9992 KB Output is correct
46 Correct 51 ms 10344 KB Output is correct
47 Correct 52 ms 10004 KB Output is correct
48 Correct 53 ms 10036 KB Output is correct
49 Correct 52 ms 10004 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 38 ms 5924 KB Output is correct
52 Correct 50 ms 7040 KB Output is correct
53 Correct 44 ms 7332 KB Output is correct
54 Correct 47 ms 8244 KB Output is correct
55 Correct 0 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 288 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 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 39 ms 7240 KB Output is correct
68 Correct 42 ms 7060 KB Output is correct
69 Correct 40 ms 7260 KB Output is correct
70 Correct 36 ms 7192 KB Output is correct
71 Correct 39 ms 7372 KB Output is correct
72 Correct 31 ms 7504 KB Output is correct
73 Correct 33 ms 7360 KB Output is correct
74 Correct 33 ms 8216 KB Output is correct
75 Correct 41 ms 7576 KB Output is correct
76 Correct 47 ms 7964 KB Output is correct
77 Correct 45 ms 7312 KB Output is correct
78 Correct 45 ms 7732 KB Output is correct
79 Correct 41 ms 7476 KB Output is correct
80 Correct 34 ms 7468 KB Output is correct
81 Correct 37 ms 7840 KB Output is correct
82 Correct 31 ms 7452 KB Output is correct
83 Correct 33 ms 7732 KB Output is correct
84 Correct 34 ms 8216 KB Output is correct
85 Correct 42 ms 7828 KB Output is correct
86 Correct 39 ms 8216 KB Output is correct
87 Correct 36 ms 8092 KB Output is correct
88 Correct 38 ms 7860 KB Output is correct
89 Correct 40 ms 7832 KB Output is correct
90 Correct 46 ms 8044 KB Output is correct
91 Correct 35 ms 8092 KB Output is correct
92 Correct 41 ms 8092 KB Output is correct
93 Correct 38 ms 7860 KB Output is correct
94 Correct 37 ms 8092 KB Output is correct
95 Correct 41 ms 7860 KB Output is correct
96 Correct 35 ms 8116 KB Output is correct
97 Correct 34 ms 8352 KB Output is correct
98 Correct 36 ms 8116 KB Output is correct
99 Correct 39 ms 8092 KB Output is correct
100 Correct 45 ms 8048 KB Output is correct
101 Correct 37 ms 8208 KB Output is correct
102 Correct 42 ms 7916 KB Output is correct