oj.uz

Submission #895997

# Submission time Handle Problem Language Result Execution time Memory
895997 2023-12-31T11:49:07 Z Andrey Wiring (IOI17_wiring) C++14
100 / 100
 62 ms 13908 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    long long n = r.size(),m = b.size();
    vector<pair<long long,long long>> haha(n+m+1,{-1,-1});
    for(long long i = 0; i < r.size(); i++) {
        haha[i] = {r[i],0};
    }
    for(long long i = 0; i < m; i++) {
        haha[i+n] = {b[i],1};
    }
    sort(haha.begin(),haha.end());
    vector<long long> wow(n+m+1);
    vector<long long> wut(n+m+1);
    long long c = 0,sb = 0;
    for(long long i = 1; i <= n+m; i++) {
        if(i > 1 && haha[i].second != haha[i-1].second) {
            c = haha[i].first;
            sb = 0;
        }
        sb+=haha[i].first-c;
        wow[i] = sb;
    }
    c = haha[n+m].first,sb = 0;
    for(long long i = n+m; i >= 1; i--) {
        if(i < n+m && haha[i].second != haha[i+1].second) {
            c = haha[i].first;
            sb = 0;
        }
        sb+=c-haha[i].first;
        wut[i] = sb;
    }
    vector<long long> dp(n+m+1);
    long long l = 0,sm = LLONG_MAX/2;
    priority_queue<pair<long long,long long>> bruh;
    for(long long i = 1; i <= n+m; i++) {
        if(i != 1 && haha[i].second != haha[i-1].second) {
            while(!bruh.empty()) {
                bruh.pop();
            }
            sm = LLONG_MAX/2;
            for(long long j = l; j < i; j++) {
                bruh.push({-(dp[j]+wut[min(j+1,i-1)]+(i-j-1)*(haha[i].first-haha[i-1].first)),i-j-1});
            }
            l = i-1;
        }
        sm+=haha[l+1].first-haha[l].first;
        dp[i] = LLONG_MAX/2;
        while(!bruh.empty() && bruh.top().second < i-l) {
            sm = min(sm,-bruh.top().first+(i-l-bruh.top().second)*(haha[l+1].first-haha[l].first));
            bruh.pop();
        }
        dp[i] = min(sm,dp[i]);
        if(!bruh.empty()) {
            dp[i] = min(dp[i],-bruh.top().first);
        }
        dp[i]+=wow[i];
    }
	return dp[n+m];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:8:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(long long i = 0; i < r.size(); i++) {
      |                          ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 30 ms 9460 KB Output is correct
4 Correct 30 ms 10960 KB Output is correct
5 Correct 31 ms 9880 KB Output is correct
6 Correct 45 ms 13740 KB Output is correct
7 Correct 38 ms 13760 KB Output is correct
8 Correct 42 ms 13768 KB Output is correct
9 Correct 37 ms 13764 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 41 ms 9828 KB Output is correct
4 Correct 39 ms 9808 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 40 ms 9808 KB Output is correct
19 Correct 40 ms 9808 KB Output is correct
20 Correct 40 ms 9820 KB Output is correct
21 Correct 40 ms 9792 KB Output is correct
22 Correct 41 ms 9736 KB Output is correct
23 Correct 39 ms 9816 KB Output is correct
24 Correct 40 ms 9740 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 41 ms 10184 KB Output is correct
3 Correct 40 ms 10992 KB Output is correct
4 Correct 50 ms 11004 KB Output is correct
5 Correct 49 ms 11100 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 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 50 ms 12076 KB Output is correct
19 Correct 47 ms 11100 KB Output is correct
20 Correct 42 ms 10932 KB Output is correct
21 Correct 54 ms 11640 KB Output is correct
22 Correct 50 ms 13132 KB Output is correct
23 Correct 44 ms 13256 KB Output is correct
24 Correct 42 ms 13228 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 30 ms 9460 KB Output is correct
20 Correct 30 ms 10960 KB Output is correct
21 Correct 31 ms 9880 KB Output is correct
22 Correct 45 ms 13740 KB Output is correct
23 Correct 38 ms 13760 KB Output is correct
24 Correct 42 ms 13768 KB Output is correct
25 Correct 37 ms 13764 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 41 ms 9828 KB Output is correct
29 Correct 39 ms 9808 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 40 ms 9808 KB Output is correct
44 Correct 40 ms 9808 KB Output is correct
45 Correct 40 ms 9820 KB Output is correct
46 Correct 40 ms 9792 KB Output is correct
47 Correct 41 ms 9736 KB Output is correct
48 Correct 39 ms 9816 KB Output is correct
49 Correct 40 ms 9740 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 41 ms 10184 KB Output is correct
52 Correct 40 ms 10992 KB Output is correct
53 Correct 50 ms 11004 KB Output is correct
54 Correct 49 ms 11100 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 50 ms 12076 KB Output is correct
68 Correct 47 ms 11100 KB Output is correct
69 Correct 42 ms 10932 KB Output is correct
70 Correct 54 ms 11640 KB Output is correct
71 Correct 50 ms 13132 KB Output is correct
72 Correct 44 ms 13256 KB Output is correct
73 Correct 42 ms 13228 KB Output is correct
74 Correct 55 ms 13764 KB Output is correct
75 Correct 55 ms 12628 KB Output is correct
76 Correct 58 ms 13844 KB Output is correct
77 Correct 52 ms 12236 KB Output is correct
78 Correct 47 ms 13252 KB Output is correct
79 Correct 43 ms 12244 KB Output is correct
80 Correct 52 ms 13356 KB Output is correct
81 Correct 51 ms 13272 KB Output is correct
82 Correct 50 ms 13344 KB Output is correct
83 Correct 46 ms 13520 KB Output is correct
84 Correct 49 ms 13876 KB Output is correct
85 Correct 45 ms 12744 KB Output is correct
86 Correct 53 ms 13840 KB Output is correct
87 Correct 45 ms 13768 KB Output is correct
88 Correct 62 ms 12828 KB Output is correct
89 Correct 53 ms 12748 KB Output is correct
90 Correct 54 ms 12744 KB Output is correct
91 Correct 49 ms 13764 KB Output is correct
92 Correct 54 ms 13768 KB Output is correct
93 Correct 54 ms 13720 KB Output is correct
94 Correct 50 ms 13908 KB Output is correct
95 Correct 55 ms 12748 KB Output is correct
96 Correct 56 ms 13832 KB Output is correct
97 Correct 46 ms 13768 KB Output is correct
98 Correct 45 ms 13768 KB Output is correct
99 Correct 45 ms 13836 KB Output is correct
100 Correct 49 ms 13760 KB Output is correct
101 Correct 54 ms 13840 KB Output is correct
102 Correct 54 ms 13740 KB Output is correct