oj.uz

Submission #221801

# Submission time Handle Problem Language Result Execution time Memory
221801 2020-04-11T07:54:30 Z patrikpavic2 Wiring (IOI17_wiring) C++17
100 / 100
 212 ms 62184 KB 
/**
* user:  ppavic
* fname: Patrik
* lname: Pavić
* task:  wiring
* score: 100.0
* date:  2019-06-13 11:05:56.973728
*/
//#include "wiring.h"
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair < int, int > pii;
typedef vector < int > vi;
typedef vector < pii > vp;

const int N = 3e5 + 500;
const int LOG = 18;
const ll INF = 1e18;
const int OFF = (1 << LOG);

ll prf[N];
map < int , ll > dp[N];
int n, L[N], R[N], G[N], rv[N];
vp v;

inline ll dis(int x,int y){
    return v[y].X - v[x].X;
}

inline ll get(int x,int y){
    if(x > y) return 0;
    return prf[y] - (x ? prf[x - 1] : 0);
}

ll f(int i,int lst){
    //printf("stanje %d %d G %d L %d R %d, rv %d\n", i, lst, G[i], L[i], R[i], rv[i]);
    if(dp[i][lst] != 0)
        return dp[i][lst] - 1;
    if(i == n){
        if(lst > 0 && i > 1)
            return -1 + (dp[i][lst] = f(i, lst - 1) + dis(L[i - 1] - 1, L[i] - lst) + 1);
        return -1 + (dp[i][lst] = (lst != 0) * INF + 1);
    }
    ll ret = INF;
    if(lst > 0)
        ret = min(ret, f(i, lst - 1) + dis(L[i] - lst, L[i]));
    if(lst <= G[i])
        ret = min(ret, f(i + 1, G[i] - lst) + get(L[i], L[i] + lst - 1) - get(L[i] - lst, L[i] - 1));
    if(i > 1 && lst > 0)
        ret = min(ret, f(i, lst - 1) + dis(L[i - 1] - 1, L[i] - lst));
    return -1 + (dp[i][lst] = ret + 1);
}


ll min_total_length(vi r, vi b) {
    for(int i = 0;i < N;i++) dp[i].clear();
    ll S_r = 0, S_b = 0;
	for(int x : r) v.PB({x, 1});
	for(int x : b) v.PB({x, 0});
	sort(v.begin(), v.end());
	int l = 0, ll = 0, gr = 0;
	for(int i = 0;i < v.size();i++){
        prf[i] = (long long)(v[i].X) + (i ? prf[i - 1] : 0);
        if(v[i].Y != l && i != 0){
            if(gr)
                rv[gr] = G[gr - 1] + rv[gr - 1];
            G[gr] = i - ll;
            L[gr] = ll;
            R[gr++] = i - 1;
           // printf("grupa %d : %d %d S %d\n", gr - 1, L[gr - 1], R[gr - 1], G[gr - 1]);
            ll = i;
        }
        l = v[i].Y;
	}
	rv[gr] = G[gr - 1] + rv[gr - 1];
	G[gr] = v.size() - ll; L[gr] = ll; R[gr] = v.size() - 1;
	n = ++gr; L[n] = v.size();
	//printf("grupa %d : %d %d S %d\n", gr - 1, L[gr - 1], R[gr - 1], G[gr - 1]);
    return f(0, 0);
}

// ovo zakomentirati prilkom submita
/**

int main(){
    int n, m, xx; scanf("%d%d", &n, &m);
    vi v1, v2;
    for(;n--;) scanf("%d", &xx), v1.PB(xx);
    for(;m--;) scanf("%d", &xx), v2.PB(xx);
    printf("%lld\n", min_total_length(v1, v2));
}
**/

Compilation message

wiring.cpp: In function 'll min_total_length(vi, vi)':
wiring.cpp:74:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0;i < v.size();i++){
                ~~^~~~~~~~~~
wiring.cpp:69:8: warning: unused variable 'S_r' [-Wunused-variable]
     ll S_r = 0, S_b = 0;
        ^~~
wiring.cpp:69:17: warning: unused variable 'S_b' [-Wunused-variable]
     ll S_r = 0, S_b = 0;
                 ^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 116 ms 42860 KB Output is correct
4 Correct 117 ms 42920 KB Output is correct
5 Correct 118 ms 42856 KB Output is correct
6 Correct 164 ms 52432 KB Output is correct
7 Correct 163 ms 52328 KB Output is correct
8 Correct 166 ms 52456 KB Output is correct
9 Correct 170 ms 52584 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 121 ms 62184 KB Output is correct
4 Correct 118 ms 57832 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 14 ms 14464 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 14 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 15 ms 14592 KB Output is correct
15 Correct 14 ms 14464 KB Output is correct
16 Correct 14 ms 14464 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 124 ms 62184 KB Output is correct
19 Correct 122 ms 62184 KB Output is correct
20 Correct 127 ms 58216 KB Output is correct
21 Correct 123 ms 62184 KB Output is correct
22 Correct 130 ms 61092 KB Output is correct
23 Correct 121 ms 60904 KB Output is correct
24 Correct 126 ms 61032 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 175 ms 51688 KB Output is correct
3 Correct 122 ms 54888 KB Output is correct
4 Correct 148 ms 51816 KB Output is correct
5 Correct 128 ms 54760 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 15 ms 14464 KB Output is correct
10 Correct 15 ms 14464 KB Output is correct
11 Correct 15 ms 14464 KB Output is correct
12 Correct 14 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 14 ms 14464 KB Output is correct
16 Correct 14 ms 14464 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 201 ms 51676 KB Output is correct
19 Correct 145 ms 51816 KB Output is correct
20 Correct 156 ms 51688 KB Output is correct
21 Correct 181 ms 51688 KB Output is correct
22 Correct 193 ms 51944 KB Output is correct
23 Correct 170 ms 51816 KB Output is correct
24 Correct 184 ms 51688 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 17 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 15 ms 14484 KB Output is correct
7 Correct 14 ms 14592 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 14 ms 14464 KB Output is correct
10 Correct 14 ms 14592 KB Output is correct
11 Correct 14 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 14 ms 14592 KB Output is correct
16 Correct 16 ms 14592 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 14 ms 14464 KB Output is correct
19 Correct 116 ms 42860 KB Output is correct
20 Correct 117 ms 42920 KB Output is correct
21 Correct 118 ms 42856 KB Output is correct
22 Correct 164 ms 52432 KB Output is correct
23 Correct 163 ms 52328 KB Output is correct
24 Correct 166 ms 52456 KB Output is correct
25 Correct 170 ms 52584 KB Output is correct
26 Correct 14 ms 14464 KB Output is correct
27 Correct 14 ms 14464 KB Output is correct
28 Correct 121 ms 62184 KB Output is correct
29 Correct 118 ms 57832 KB Output is correct
30 Correct 14 ms 14464 KB Output is correct
31 Correct 14 ms 14464 KB Output is correct
32 Correct 14 ms 14464 KB Output is correct
33 Correct 14 ms 14464 KB Output is correct
34 Correct 14 ms 14464 KB Output is correct
35 Correct 14 ms 14464 KB Output is correct
36 Correct 14 ms 14464 KB Output is correct
37 Correct 15 ms 14464 KB Output is correct
38 Correct 14 ms 14464 KB Output is correct
39 Correct 15 ms 14592 KB Output is correct
40 Correct 14 ms 14464 KB Output is correct
41 Correct 14 ms 14464 KB Output is correct
42 Correct 14 ms 14464 KB Output is correct
43 Correct 124 ms 62184 KB Output is correct
44 Correct 122 ms 62184 KB Output is correct
45 Correct 127 ms 58216 KB Output is correct
46 Correct 123 ms 62184 KB Output is correct
47 Correct 130 ms 61092 KB Output is correct
48 Correct 121 ms 60904 KB Output is correct
49 Correct 126 ms 61032 KB Output is correct
50 Correct 14 ms 14464 KB Output is correct
51 Correct 175 ms 51688 KB Output is correct
52 Correct 122 ms 54888 KB Output is correct
53 Correct 148 ms 51816 KB Output is correct
54 Correct 128 ms 54760 KB Output is correct
55 Correct 14 ms 14464 KB Output is correct
56 Correct 14 ms 14464 KB Output is correct
57 Correct 14 ms 14464 KB Output is correct
58 Correct 15 ms 14464 KB Output is correct
59 Correct 15 ms 14464 KB Output is correct
60 Correct 15 ms 14464 KB Output is correct
61 Correct 14 ms 14464 KB Output is correct
62 Correct 14 ms 14464 KB Output is correct
63 Correct 14 ms 14464 KB Output is correct
64 Correct 14 ms 14464 KB Output is correct
65 Correct 14 ms 14464 KB Output is correct
66 Correct 14 ms 14464 KB Output is correct
67 Correct 201 ms 51676 KB Output is correct
68 Correct 145 ms 51816 KB Output is correct
69 Correct 156 ms 51688 KB Output is correct
70 Correct 181 ms 51688 KB Output is correct
71 Correct 193 ms 51944 KB Output is correct
72 Correct 170 ms 51816 KB Output is correct
73 Correct 184 ms 51688 KB Output is correct
74 Correct 180 ms 52456 KB Output is correct
75 Correct 181 ms 52072 KB Output is correct
76 Correct 177 ms 52456 KB Output is correct
77 Correct 198 ms 51816 KB Output is correct
78 Correct 196 ms 52008 KB Output is correct
79 Correct 193 ms 51816 KB Output is correct
80 Correct 178 ms 51876 KB Output is correct
81 Correct 167 ms 51944 KB Output is correct
82 Correct 163 ms 51944 KB Output is correct
83 Correct 159 ms 52072 KB Output is correct
84 Correct 160 ms 52456 KB Output is correct
85 Correct 198 ms 52568 KB Output is correct
86 Correct 189 ms 52460 KB Output is correct
87 Correct 182 ms 52460 KB Output is correct
88 Correct 185 ms 52456 KB Output is correct
89 Correct 183 ms 52456 KB Output is correct
90 Correct 211 ms 52456 KB Output is correct
91 Correct 179 ms 52456 KB Output is correct
92 Correct 186 ms 52456 KB Output is correct
93 Correct 185 ms 52456 KB Output is correct
94 Correct 196 ms 52584 KB Output is correct
95 Correct 212 ms 52456 KB Output is correct
96 Correct 187 ms 52456 KB Output is correct
97 Correct 188 ms 52584 KB Output is correct
98 Correct 196 ms 52456 KB Output is correct
99 Correct 192 ms 52456 KB Output is correct
100 Correct 202 ms 52456 KB Output is correct
101 Correct 185 ms 52328 KB Output is correct
102 Correct 187 ms 52332 KB Output is correct