oj.uz

Submission #574515

# Submission time Handle Problem Language Result Execution time Memory
574515 2022-06-08T17:25:23 Z 2fat2code Wiring (IOI17_wiring) C++17
100 / 100
 58 ms 12508 KB 
#include "wiring.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
using namespace std;

const int nmax = 200005;

long long n, m, sum;
long long dp[nmax], calc[nmax];
vector<pair<long long, long long>>Q, vecc;
vector<long long>last, now;

void check(int urmator){
    Q.clear();
    for(int i=0;i<last.size();i++){
        calc[i+1] = calc[i] + vecc[last[i]].fr;
    }
    for(int i=0;i<last.size();i++){
        long long heh = dp[last[i]] - (calc[last.size()] - calc[i]) + (last.size() - i) * urmator;
        if(Q.size()){
            auto it = Q.back().fr;
            if(it > heh) Q.push_back({heh, last[i]});
        }
        else{
            Q.push_back({heh, last[i]});
        }
    }
}

long long min_total_length(vector<int> r, vector<int> b) {
	n = (int)r.size();
	m = (int)b.size();
	for(auto it : r) vecc.push_back({it, 0});
	for(auto it : b) vecc.push_back({it, 1});
	sort(all(vecc));
    now.push_back(0);
	long long curr = 0;
	while(vecc[curr].sc == vecc[curr + 1].sc){
        ++curr;
        now.push_back(curr);
	}
	dp[0] = 0;
	for(int i=1;i<=now.size();i++) dp[i] = 1e16;
	long long lmao = 1e16;
	while(curr < n + m){
        ++curr;
        if(curr == n + m) break;
        else if(vecc[curr].sc != vecc[curr - 1].sc){
            sum = 0;
            dp[now[0]] = min(dp[now[0]], dp[now[0]+1]);
            last = now;
            now.clear();
            check(vecc[curr].fr);
            lmao = 1e16;
        }
        now.push_back(curr);
        sum += vecc[curr].fr;
        if(Q.size()){
            if(last.back() - Q.back().sc + 1 <= curr - now[0] + 1){
                Q.pop_back();
            }
        }
        lmao = lmao + vecc[curr].fr - vecc[last.back()].fr;
        if(last[0] <= last.back() - (curr - (last.back() + 1))){
            lmao = min(lmao, sum - calc[last.size()] + calc[last.size()-(curr-(last.back()+1))-1] + dp[last.back()-(curr-(last.back()+1))]);
        }
        dp[curr+1] = lmao;
        if(Q.size()) dp[curr+1] = min(dp[curr+1], Q.back().fr+sum-(curr-now[0]+1)*vecc[now[0]].fr);

	}
	return dp[n + m];
}

Compilation message

wiring.cpp: In function 'void check(int)':
wiring.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0;i<last.size();i++){
      |                 ~^~~~~~~~~~~~
wiring.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<last.size();i++){
      |                 ~^~~~~~~~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i=1;i<=now.size();i++) dp[i] = 1e16;
      |              ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 27 ms 9004 KB Output is correct
4 Correct 24 ms 9008 KB Output is correct
5 Correct 23 ms 8676 KB Output is correct
6 Correct 34 ms 11064 KB Output is correct
7 Correct 40 ms 11048 KB Output is correct
8 Correct 33 ms 11044 KB Output is correct
9 Correct 35 ms 11056 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 44 ms 8344 KB Output is correct
4 Correct 45 ms 8228 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 43 ms 8532 KB Output is correct
19 Correct 43 ms 8616 KB Output is correct
20 Correct 52 ms 8612 KB Output is correct
21 Correct 58 ms 8596 KB Output is correct
22 Correct 43 ms 8604 KB Output is correct
23 Correct 43 ms 8600 KB Output is correct
24 Correct 42 ms 8604 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 39 ms 8224 KB Output is correct
3 Correct 43 ms 7964 KB Output is correct
4 Correct 41 ms 7936 KB Output is correct
5 Correct 39 ms 7844 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 40 ms 9568 KB Output is correct
19 Correct 38 ms 7852 KB Output is correct
20 Correct 36 ms 7940 KB Output is correct
21 Correct 35 ms 8612 KB Output is correct
22 Correct 36 ms 11392 KB Output is correct
23 Correct 46 ms 10912 KB Output is correct
24 Correct 48 ms 11048 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 27 ms 9004 KB Output is correct
20 Correct 24 ms 9008 KB Output is correct
21 Correct 23 ms 8676 KB Output is correct
22 Correct 34 ms 11064 KB Output is correct
23 Correct 40 ms 11048 KB Output is correct
24 Correct 33 ms 11044 KB Output is correct
25 Correct 35 ms 11056 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 44 ms 8344 KB Output is correct
29 Correct 45 ms 8228 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 312 KB Output is correct
43 Correct 43 ms 8532 KB Output is correct
44 Correct 43 ms 8616 KB Output is correct
45 Correct 52 ms 8612 KB Output is correct
46 Correct 58 ms 8596 KB Output is correct
47 Correct 43 ms 8604 KB Output is correct
48 Correct 43 ms 8600 KB Output is correct
49 Correct 42 ms 8604 KB Output is correct
50 Correct 0 ms 224 KB Output is correct
51 Correct 39 ms 8224 KB Output is correct
52 Correct 43 ms 7964 KB Output is correct
53 Correct 41 ms 7936 KB Output is correct
54 Correct 39 ms 7844 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 316 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 308 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 312 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 316 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 308 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 40 ms 9568 KB Output is correct
68 Correct 38 ms 7852 KB Output is correct
69 Correct 36 ms 7940 KB Output is correct
70 Correct 35 ms 8612 KB Output is correct
71 Correct 36 ms 11392 KB Output is correct
72 Correct 46 ms 10912 KB Output is correct
73 Correct 48 ms 11048 KB Output is correct
74 Correct 33 ms 12196 KB Output is correct
75 Correct 38 ms 10664 KB Output is correct
76 Correct 38 ms 11032 KB Output is correct
77 Correct 40 ms 10776 KB Output is correct
78 Correct 37 ms 11580 KB Output is correct
79 Correct 40 ms 10520 KB Output is correct
80 Correct 34 ms 10684 KB Output is correct
81 Correct 36 ms 11948 KB Output is correct
82 Correct 32 ms 11836 KB Output is correct
83 Correct 32 ms 10936 KB Output is correct
84 Correct 32 ms 11704 KB Output is correct
85 Correct 48 ms 10528 KB Output is correct
86 Correct 50 ms 11672 KB Output is correct
87 Correct 39 ms 11940 KB Output is correct
88 Correct 36 ms 10656 KB Output is correct
89 Correct 41 ms 10912 KB Output is correct
90 Correct 44 ms 10788 KB Output is correct
91 Correct 49 ms 11552 KB Output is correct
92 Correct 39 ms 12020 KB Output is correct
93 Correct 34 ms 11444 KB Output is correct
94 Correct 38 ms 12316 KB Output is correct
95 Correct 42 ms 10644 KB Output is correct
96 Correct 42 ms 11544 KB Output is correct
97 Correct 34 ms 12508 KB Output is correct
98 Correct 48 ms 12252 KB Output is correct
99 Correct 37 ms 12268 KB Output is correct
100 Correct 41 ms 12324 KB Output is correct
101 Correct 43 ms 12196 KB Output is correct
102 Correct 54 ms 11172 KB Output is correct