oj.uz

Submission #95556

# Submission time Handle Problem Language Result Execution time Memory
95556 2019-02-02T05:08:46 Z oolimry Wiring (IOI17_wiring) C++14
100 / 100
 130 ms 11240 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
    vector<ii> arr;
    for(int i = 0;i < r.size();i++)
        arr.push_back(ii(r[i],0));
    for(int i = 0;i < b.size();i++)
        arr.push_back(ii(b[i],1));
    int n = arr.size();
    sort(arr.begin(),arr.end());
    long long dp[n+1];
    dp[0] = 0;
    fill(dp,dp+n+1,0);
    int color = arr[0].second;
    vector<vector<ii> > groups;
    vector<ii> v;
    for(int i =0;i < n;i++){
        if(color != arr[i].second){
            groups.push_back(v);
            v.clear();
            color = arr[i].second;
        }
        v.push_back(ii(arr[i].first,i));
    }
    groups.push_back(v);
    for(int gno = 0; gno < groups.size();gno++){
        if(gno == 0)
            for(int i = 0;i < groups[gno].size();i++){
                int index = groups[gno][i].second;
                dp[index+1] = 10234567890123456;
            }
        else{
            long long acc = 0;
            long long passed = 1023456789012345678;
            int m = groups[gno-1].size();
            long long dpp[m];
            long long premin[m];
            fill(dpp,dpp+m,0);
            long long cursmol = 0;
                long long prebig = -1;
            for(int i = 0;i < groups[gno].size();i++){
                if(i == 0){
                    for(int j = m-1;j>=0;j--){
                        dpp[j] = groups[gno][i].first - groups[gno-1][j].first;
                        if(j != m-1) dpp[j] += dpp[j+1];
                    }
                    long long minval = 1023456789012345678;
                    for(int j = 0;j < m;j++){
                        dpp[j] += dp[groups[gno-1][j].second];
                        //printf("%lld ",dpp[j]);
                        prebig = max(prebig,(long long)groups[gno-1][j].first);
                        minval = min(minval,dpp[j]);
                    }
                    premin[0] = dpp[0];
                    for(int j = 1;j < m;j++){
                        premin[j] = min(dpp[j],premin[j-1]);
                    }
                    minval = min(groups[gno][i].first - prebig + dp[groups[gno][i].second],minval);
                    dp[groups[gno][i].second+1] = minval;
                    cursmol = groups[gno][i].first;
                }
                else{
                    passed += (cursmol - prebig);
                    acc += groups[gno][i].first - cursmol;
                    long long minval = groups[gno][i].first - prebig;
                    minval += dp[groups[gno][i].second];
                    if(m-i-1>=0)
                        minval = min(minval,premin[m-i-1] + acc);
                    if(m-i>=0)
                        passed = min(passed,dpp[m-i] + (cursmol - prebig));
                    minval = min(minval, passed + acc);
                    dp[groups[gno][i].second+1] = minval;
                }
            }
        }
    }
	return dp[n];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:7:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < r.size();i++)
                   ~~^~~~~~~~~~
wiring.cpp:9:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < b.size();i++)
                   ~~^~~~~~~~~~
wiring.cpp:28:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int gno = 0; gno < groups.size();gno++){
                      ~~~~^~~~~~~~~~~~~~~
wiring.cpp:30:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0;i < groups[gno].size();i++){
                           ~~^~~~~~~~~~~~~~~~~~~~
wiring.cpp:43:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0;i < groups[gno].size();i++){
                           ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 35 ms 9064 KB Output is correct
4 Correct 35 ms 9064 KB Output is correct
5 Correct 34 ms 8684 KB Output is correct
6 Correct 45 ms 11148 KB Output is correct
7 Correct 45 ms 11104 KB Output is correct
8 Correct 47 ms 11240 KB Output is correct
9 Correct 46 ms 11112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 60 ms 10600 KB Output is correct
4 Correct 58 ms 10216 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 58 ms 10732 KB Output is correct
19 Correct 58 ms 10600 KB Output is correct
20 Correct 130 ms 10572 KB Output is correct
21 Correct 59 ms 10600 KB Output is correct
22 Correct 58 ms 10344 KB Output is correct
23 Correct 60 ms 10344 KB Output is correct
24 Correct 61 ms 10292 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 45 ms 8032 KB Output is correct
3 Correct 52 ms 8736 KB Output is correct
4 Correct 48 ms 7912 KB Output is correct
5 Correct 62 ms 8812 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 128 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 47 ms 8812 KB Output is correct
19 Correct 46 ms 7912 KB Output is correct
20 Correct 44 ms 7912 KB Output is correct
21 Correct 44 ms 8296 KB Output is correct
22 Correct 46 ms 9832 KB Output is correct
23 Correct 42 ms 10216 KB Output is correct
24 Correct 44 ms 9576 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 35 ms 9064 KB Output is correct
20 Correct 35 ms 9064 KB Output is correct
21 Correct 34 ms 8684 KB Output is correct
22 Correct 45 ms 11148 KB Output is correct
23 Correct 45 ms 11104 KB Output is correct
24 Correct 47 ms 11240 KB Output is correct
25 Correct 46 ms 11112 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 60 ms 10600 KB Output is correct
29 Correct 58 ms 10216 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 58 ms 10732 KB Output is correct
44 Correct 58 ms 10600 KB Output is correct
45 Correct 130 ms 10572 KB Output is correct
46 Correct 59 ms 10600 KB Output is correct
47 Correct 58 ms 10344 KB Output is correct
48 Correct 60 ms 10344 KB Output is correct
49 Correct 61 ms 10292 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 45 ms 8032 KB Output is correct
52 Correct 52 ms 8736 KB Output is correct
53 Correct 48 ms 7912 KB Output is correct
54 Correct 62 ms 8812 KB Output is correct
55 Correct 2 ms 256 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 128 KB Output is correct
58 Correct 2 ms 256 KB Output is correct
59 Correct 2 ms 256 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 256 KB Output is correct
63 Correct 2 ms 256 KB Output is correct
64 Correct 2 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 504 KB Output is correct
67 Correct 47 ms 8812 KB Output is correct
68 Correct 46 ms 7912 KB Output is correct
69 Correct 44 ms 7912 KB Output is correct
70 Correct 44 ms 8296 KB Output is correct
71 Correct 46 ms 9832 KB Output is correct
72 Correct 42 ms 10216 KB Output is correct
73 Correct 44 ms 9576 KB Output is correct
74 Correct 51 ms 10600 KB Output is correct
75 Correct 53 ms 9492 KB Output is correct
76 Correct 60 ms 10064 KB Output is correct
77 Correct 49 ms 9576 KB Output is correct
78 Correct 51 ms 9704 KB Output is correct
79 Correct 51 ms 9576 KB Output is correct
80 Correct 43 ms 9576 KB Output is correct
81 Correct 46 ms 10216 KB Output is correct
82 Correct 42 ms 10216 KB Output is correct
83 Correct 41 ms 10316 KB Output is correct
84 Correct 45 ms 10984 KB Output is correct
85 Correct 57 ms 9568 KB Output is correct
86 Correct 49 ms 10216 KB Output is correct
87 Correct 49 ms 10212 KB Output is correct
88 Correct 51 ms 9832 KB Output is correct
89 Correct 48 ms 9960 KB Output is correct
90 Correct 57 ms 10088 KB Output is correct
91 Correct 49 ms 10856 KB Output is correct
92 Correct 47 ms 10088 KB Output is correct
93 Correct 48 ms 10216 KB Output is correct
94 Correct 60 ms 10472 KB Output is correct
95 Correct 53 ms 9932 KB Output is correct
96 Correct 46 ms 10600 KB Output is correct
97 Correct 48 ms 10976 KB Output is correct
98 Correct 50 ms 10728 KB Output is correct
99 Correct 49 ms 10728 KB Output is correct
100 Correct 55 ms 10216 KB Output is correct
101 Correct 50 ms 10628 KB Output is correct
102 Correct 55 ms 10216 KB Output is correct