oj.uz

Submission #38938

# Submission time Handle Problem Language Result Execution time Memory
38938 2018-01-08T07:39:54 Z moonrabbit2 Wiring (IOI17_wiring) C++14
100 / 100
 66 ms 12180 KB 
// 자꾸 범위 초과해서 테스트.
// 출처: http://blog.myungwoo.kr/117 [PS 이야기]


#include "wiring.h"
 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long lld;
 
#define MAXN 100005
#define sz(v) ((int)(v).size())
 
int N, M, K;
int A[MAXN], B[MAXN];
int near[MAXN*2], sp[MAXN*2]; lld S[MAXN*2]; int last[MAXN*4];
lld D[MAXN*2];
 
struct Z{
    int x; bool t;
} C[MAXN*2];
 
lld min_total_length(vector<int> r, vector<int> b) {
    N = sz(r); M = sz(b); K = N+M;
    for (int i=1;i<=N;i++) A[i] = r[i-1];
    for (int i=1;i<=M;i++) B[i] = b[i-1];
     
    /* Merge */
    for (int i=1,j=1,k=1;k<=K;k++){
        if (j > M || i <= N && A[i] < B[j])
            C[k] = {A[i++], 0};
        else
            C[k] = {B[j++], 1};
    }
 
    /* Get nearest point */
    for (int i=1;i<=K;i++) near[i] = 2e9;
    {
        int rec[2] = {0,};
        for (int i=1;i<=K;i++){
            if (rec[!C[i].t]) near[i] = min(near[i], C[i].x-C[rec[!C[i].t]].x);
            rec[C[i].t] = i;
        }
    }
    {
        int rec[2] = {0,};
        for (int i=K;i>0;i--){
            if (rec[!C[i].t]) near[i] = min(near[i], C[rec[!C[i].t]].x-C[i].x);
            rec[C[i].t] = i;
        }
    }
 
    for (int i=1;i<=K;i++) sp[i] = -1;
    for (int i=0;i<=K+K;i++) last[i] = -1;
    last[K] = 0; int now = 0;
    for (int i=1;i<=K;i++){
        if (C[i].t) now++, S[i] = C[i].x;
        else now--, S[i] = -C[i].x;
        S[i] += S[i-1];
        if (last[now+K] >= 0)
            sp[i] = last[now+K];
        last[now+K] = i;
    }
    for (int i=1;i<=K;i++){
        D[i] = D[i-1] + near[i];
        if (sp[i] >= 0){
            int j = sp[i];
            D[i] = min(D[i], D[j] + abs(S[i]-S[j]));
        }
    }
    return D[K];
}

Compilation message

wiring.cpp: In function 'lld min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:31:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
         if (j > M || i <= N && A[i] < B[j])
                             ^

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10612 KB Output is correct
2 Correct 0 ms 10612 KB Output is correct
3 Correct 43 ms 11788 KB Output is correct
4 Correct 39 ms 11788 KB Output is correct
5 Correct 33 ms 11788 KB Output is correct
6 Correct 39 ms 12180 KB Output is correct
7 Correct 49 ms 12180 KB Output is correct
8 Correct 36 ms 12180 KB Output is correct
9 Correct 26 ms 12180 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10612 KB Output is correct
2 Correct 0 ms 10612 KB Output is correct
3 Correct 39 ms 12180 KB Output is correct
4 Correct 43 ms 12180 KB Output is correct
5 Correct 0 ms 10612 KB Output is correct
6 Correct 0 ms 10612 KB Output is correct
7 Correct 0 ms 10612 KB Output is correct
8 Correct 0 ms 10612 KB Output is correct
9 Correct 0 ms 10612 KB Output is correct
10 Correct 0 ms 10612 KB Output is correct
11 Correct 0 ms 10612 KB Output is correct
12 Correct 0 ms 10612 KB Output is correct
13 Correct 0 ms 10612 KB Output is correct
14 Correct 0 ms 10612 KB Output is correct
15 Correct 0 ms 10612 KB Output is correct
16 Correct 0 ms 10612 KB Output is correct
17 Correct 0 ms 10612 KB Output is correct
18 Correct 36 ms 12180 KB Output is correct
19 Correct 43 ms 12180 KB Output is correct
20 Correct 46 ms 12180 KB Output is correct
21 Correct 53 ms 12180 KB Output is correct
22 Correct 36 ms 12180 KB Output is correct
23 Correct 56 ms 12180 KB Output is correct
24 Correct 33 ms 12180 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10612 KB Output is correct
2 Correct 33 ms 12180 KB Output is correct
3 Correct 39 ms 12180 KB Output is correct
4 Correct 23 ms 12180 KB Output is correct
5 Correct 26 ms 12180 KB Output is correct
6 Correct 0 ms 10612 KB Output is correct
7 Correct 0 ms 10612 KB Output is correct
8 Correct 0 ms 10612 KB Output is correct
9 Correct 0 ms 10612 KB Output is correct
10 Correct 0 ms 10612 KB Output is correct
11 Correct 0 ms 10612 KB Output is correct
12 Correct 0 ms 10612 KB Output is correct
13 Correct 0 ms 10612 KB Output is correct
14 Correct 0 ms 10612 KB Output is correct
15 Correct 0 ms 10612 KB Output is correct
16 Correct 0 ms 10612 KB Output is correct
17 Correct 0 ms 10612 KB Output is correct
18 Correct 36 ms 12180 KB Output is correct
19 Correct 29 ms 12180 KB Output is correct
20 Correct 46 ms 12180 KB Output is correct
21 Correct 46 ms 12180 KB Output is correct
22 Correct 33 ms 12180 KB Output is correct
23 Correct 33 ms 12180 KB Output is correct
24 Correct 29 ms 12180 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10612 KB Output is correct
2 Correct 0 ms 10612 KB Output is correct
3 Correct 0 ms 10612 KB Output is correct
4 Correct 0 ms 10612 KB Output is correct
5 Correct 0 ms 10612 KB Output is correct
6 Correct 0 ms 10612 KB Output is correct
7 Correct 0 ms 10612 KB Output is correct
8 Correct 0 ms 10612 KB Output is correct
9 Correct 0 ms 10612 KB Output is correct
10 Correct 0 ms 10612 KB Output is correct
11 Correct 0 ms 10612 KB Output is correct
12 Correct 0 ms 10612 KB Output is correct
13 Correct 0 ms 10612 KB Output is correct
14 Correct 0 ms 10612 KB Output is correct
15 Correct 0 ms 10612 KB Output is correct
16 Correct 0 ms 10612 KB Output is correct
17 Correct 0 ms 10612 KB Output is correct
18 Correct 0 ms 10612 KB Output is correct
19 Correct 43 ms 11788 KB Output is correct
20 Correct 39 ms 11788 KB Output is correct
21 Correct 33 ms 11788 KB Output is correct
22 Correct 39 ms 12180 KB Output is correct
23 Correct 49 ms 12180 KB Output is correct
24 Correct 36 ms 12180 KB Output is correct
25 Correct 26 ms 12180 KB Output is correct
26 Correct 0 ms 10612 KB Output is correct
27 Correct 0 ms 10612 KB Output is correct
28 Correct 39 ms 12180 KB Output is correct
29 Correct 43 ms 12180 KB Output is correct
30 Correct 0 ms 10612 KB Output is correct
31 Correct 0 ms 10612 KB Output is correct
32 Correct 0 ms 10612 KB Output is correct
33 Correct 0 ms 10612 KB Output is correct
34 Correct 0 ms 10612 KB Output is correct
35 Correct 0 ms 10612 KB Output is correct
36 Correct 0 ms 10612 KB Output is correct
37 Correct 0 ms 10612 KB Output is correct
38 Correct 0 ms 10612 KB Output is correct
39 Correct 0 ms 10612 KB Output is correct
40 Correct 0 ms 10612 KB Output is correct
41 Correct 0 ms 10612 KB Output is correct
42 Correct 0 ms 10612 KB Output is correct
43 Correct 36 ms 12180 KB Output is correct
44 Correct 43 ms 12180 KB Output is correct
45 Correct 46 ms 12180 KB Output is correct
46 Correct 53 ms 12180 KB Output is correct
47 Correct 36 ms 12180 KB Output is correct
48 Correct 56 ms 12180 KB Output is correct
49 Correct 33 ms 12180 KB Output is correct
50 Correct 0 ms 10612 KB Output is correct
51 Correct 33 ms 12180 KB Output is correct
52 Correct 39 ms 12180 KB Output is correct
53 Correct 23 ms 12180 KB Output is correct
54 Correct 26 ms 12180 KB Output is correct
55 Correct 0 ms 10612 KB Output is correct
56 Correct 0 ms 10612 KB Output is correct
57 Correct 0 ms 10612 KB Output is correct
58 Correct 0 ms 10612 KB Output is correct
59 Correct 0 ms 10612 KB Output is correct
60 Correct 0 ms 10612 KB Output is correct
61 Correct 0 ms 10612 KB Output is correct
62 Correct 0 ms 10612 KB Output is correct
63 Correct 0 ms 10612 KB Output is correct
64 Correct 0 ms 10612 KB Output is correct
65 Correct 0 ms 10612 KB Output is correct
66 Correct 0 ms 10612 KB Output is correct
67 Correct 36 ms 12180 KB Output is correct
68 Correct 29 ms 12180 KB Output is correct
69 Correct 46 ms 12180 KB Output is correct
70 Correct 46 ms 12180 KB Output is correct
71 Correct 33 ms 12180 KB Output is correct
72 Correct 33 ms 12180 KB Output is correct
73 Correct 29 ms 12180 KB Output is correct
74 Correct 53 ms 12180 KB Output is correct
75 Correct 39 ms 12180 KB Output is correct
76 Correct 63 ms 12180 KB Output is correct
77 Correct 43 ms 12180 KB Output is correct
78 Correct 39 ms 12180 KB Output is correct
79 Correct 43 ms 12180 KB Output is correct
80 Correct 53 ms 12180 KB Output is correct
81 Correct 43 ms 12180 KB Output is correct
82 Correct 46 ms 12180 KB Output is correct
83 Correct 36 ms 12180 KB Output is correct
84 Correct 49 ms 12180 KB Output is correct
85 Correct 63 ms 12180 KB Output is correct
86 Correct 59 ms 12180 KB Output is correct
87 Correct 43 ms 12180 KB Output is correct
88 Correct 59 ms 12180 KB Output is correct
89 Correct 66 ms 12180 KB Output is correct
90 Correct 49 ms 12180 KB Output is correct
91 Correct 39 ms 12180 KB Output is correct
92 Correct 56 ms 12180 KB Output is correct
93 Correct 46 ms 12180 KB Output is correct
94 Correct 53 ms 12180 KB Output is correct
95 Correct 33 ms 12180 KB Output is correct
96 Correct 43 ms 12180 KB Output is correct
97 Correct 36 ms 12180 KB Output is correct
98 Correct 53 ms 12180 KB Output is correct
99 Correct 43 ms 12180 KB Output is correct
100 Correct 49 ms 12180 KB Output is correct
101 Correct 36 ms 12180 KB Output is correct
102 Correct 43 ms 12180 KB Output is correct