답안 #56090 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56090	2018-07-09T23:51:06 Z	Benq	전선 연결 (IOI17_wiring)	C++14	100 / 100	193 ms	72620 KB

wiring

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

ll dp[200001];
set<int> S[2];

int getDist(pi x) {
    auto it = S[x.s^1].lb(x.f);
    int ret = MOD;
    if (it != S[x.s^1].end()) ret = min(ret,*it-x.f);
    if (it != S[x.s^1].begin()) ret = min(ret,x.f-*prev(it));
    return ret;
}

ll min_total_length(vi a, vi b) {
    for (int i: a) S[0].insert(i);
    for (int i: b) S[1].insert(i);
    
    vpi v;
    F0R(i,sz(a)) v.pb({a[i],0});
    F0R(i,sz(b)) v.pb({b[i],1});
    sort(all(v));
    
    ll csum = 0;
    int ind = -1;
    F0R(i,sz(v)) {
        dp[i+1] = dp[i]+getDist(v[i]);
        if (i && v[i].s != v[i-1].s) {
            csum = v[i].f-v[i-1].f;
            ind = i-1;
        } else if (ind > 0 && v[ind].s == v[ind-1].s) {
            ind --;
            csum += v[i].f-v[ind].f;
        } else ind = -1;
        
        if (ind != -1) dp[i+1] = min(dp[i+1],dp[ind]+csum);
        // cout << "HI " << i << " " << v[i].f << " " << v[i].s << " " << dp[i+1] << "\n";
    }
    
    return dp[sz(v)];
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	400 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	3 ms	644 KB	Output is correct
7	Correct	2 ms	668 KB	Output is correct
8	Correct	4 ms	796 KB	Output is correct
9	Correct	2 ms	796 KB	Output is correct
10	Correct	3 ms	796 KB	Output is correct
11	Correct	3 ms	796 KB	Output is correct
12	Correct	3 ms	796 KB	Output is correct
13	Correct	3 ms	796 KB	Output is correct
14	Correct	2 ms	796 KB	Output is correct
15	Correct	2 ms	796 KB	Output is correct
16	Correct	3 ms	796 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	796 KB	Output is correct
2	Correct	2 ms	804 KB	Output is correct
3	Correct	110 ms	12824 KB	Output is correct
4	Correct	92 ms	14264 KB	Output is correct
5	Correct	131 ms	15760 KB	Output is correct
6	Correct	132 ms	21180 KB	Output is correct
7	Correct	137 ms	23108 KB	Output is correct
8	Correct	146 ms	24976 KB	Output is correct
9	Correct	123 ms	26980 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	26980 KB	Output is correct
2	Correct	2 ms	26980 KB	Output is correct
3	Correct	161 ms	27000 KB	Output is correct
4	Correct	183 ms	28676 KB	Output is correct
5	Correct	2 ms	28676 KB	Output is correct
6	Correct	2 ms	28676 KB	Output is correct
7	Correct	2 ms	28676 KB	Output is correct
8	Correct	2 ms	28676 KB	Output is correct
9	Correct	2 ms	28676 KB	Output is correct
10	Correct	2 ms	28676 KB	Output is correct
11	Correct	2 ms	28676 KB	Output is correct
12	Correct	2 ms	28676 KB	Output is correct
13	Correct	3 ms	28676 KB	Output is correct
14	Correct	3 ms	28676 KB	Output is correct
15	Correct	3 ms	28676 KB	Output is correct
16	Correct	2 ms	28676 KB	Output is correct
17	Correct	2 ms	28676 KB	Output is correct
18	Correct	141 ms	30560 KB	Output is correct
19	Correct	182 ms	32436 KB	Output is correct
20	Correct	141 ms	34480 KB	Output is correct
21	Correct	140 ms	36360 KB	Output is correct
22	Correct	160 ms	38292 KB	Output is correct
23	Correct	193 ms	40224 KB	Output is correct
24	Correct	143 ms	42152 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	42152 KB	Output is correct
2	Correct	157 ms	42164 KB	Output is correct
3	Correct	185 ms	42256 KB	Output is correct
4	Correct	151 ms	42284 KB	Output is correct
5	Correct	144 ms	42292 KB	Output is correct
6	Correct	3 ms	42292 KB	Output is correct
7	Correct	2 ms	42292 KB	Output is correct
8	Correct	3 ms	42292 KB	Output is correct
9	Correct	3 ms	42292 KB	Output is correct
10	Correct	2 ms	42292 KB	Output is correct
11	Correct	2 ms	42292 KB	Output is correct
12	Correct	2 ms	42292 KB	Output is correct
13	Correct	2 ms	42292 KB	Output is correct
14	Correct	2 ms	42292 KB	Output is correct
15	Correct	2 ms	42292 KB	Output is correct
16	Correct	2 ms	42292 KB	Output is correct
17	Correct	2 ms	42292 KB	Output is correct
18	Correct	114 ms	42292 KB	Output is correct
19	Correct	123 ms	43444 KB	Output is correct
20	Correct	163 ms	44704 KB	Output is correct
21	Correct	114 ms	45888 KB	Output is correct
22	Correct	124 ms	47224 KB	Output is correct
23	Correct	125 ms	48484 KB	Output is correct
24	Correct	141 ms	49848 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	400 KB	Output is correct
3	Correct	2 ms	480 KB	Output is correct
4	Correct	2 ms	532 KB	Output is correct
5	Correct	3 ms	584 KB	Output is correct
6	Correct	3 ms	644 KB	Output is correct
7	Correct	2 ms	668 KB	Output is correct
8	Correct	4 ms	796 KB	Output is correct
9	Correct	2 ms	796 KB	Output is correct
10	Correct	3 ms	796 KB	Output is correct
11	Correct	3 ms	796 KB	Output is correct
12	Correct	3 ms	796 KB	Output is correct
13	Correct	3 ms	796 KB	Output is correct
14	Correct	2 ms	796 KB	Output is correct
15	Correct	2 ms	796 KB	Output is correct
16	Correct	3 ms	796 KB	Output is correct
17	Correct	2 ms	796 KB	Output is correct
18	Correct	2 ms	804 KB	Output is correct
19	Correct	110 ms	12824 KB	Output is correct
20	Correct	92 ms	14264 KB	Output is correct
21	Correct	131 ms	15760 KB	Output is correct
22	Correct	132 ms	21180 KB	Output is correct
23	Correct	137 ms	23108 KB	Output is correct
24	Correct	146 ms	24976 KB	Output is correct
25	Correct	123 ms	26980 KB	Output is correct
26	Correct	2 ms	26980 KB	Output is correct
27	Correct	2 ms	26980 KB	Output is correct
28	Correct	161 ms	27000 KB	Output is correct
29	Correct	183 ms	28676 KB	Output is correct
30	Correct	2 ms	28676 KB	Output is correct
31	Correct	2 ms	28676 KB	Output is correct
32	Correct	2 ms	28676 KB	Output is correct
33	Correct	2 ms	28676 KB	Output is correct
34	Correct	2 ms	28676 KB	Output is correct
35	Correct	2 ms	28676 KB	Output is correct
36	Correct	2 ms	28676 KB	Output is correct
37	Correct	2 ms	28676 KB	Output is correct
38	Correct	3 ms	28676 KB	Output is correct
39	Correct	3 ms	28676 KB	Output is correct
40	Correct	3 ms	28676 KB	Output is correct
41	Correct	2 ms	28676 KB	Output is correct
42	Correct	2 ms	28676 KB	Output is correct
43	Correct	141 ms	30560 KB	Output is correct
44	Correct	182 ms	32436 KB	Output is correct
45	Correct	141 ms	34480 KB	Output is correct
46	Correct	140 ms	36360 KB	Output is correct
47	Correct	160 ms	38292 KB	Output is correct
48	Correct	193 ms	40224 KB	Output is correct
49	Correct	143 ms	42152 KB	Output is correct
50	Correct	2 ms	42152 KB	Output is correct
51	Correct	157 ms	42164 KB	Output is correct
52	Correct	185 ms	42256 KB	Output is correct
53	Correct	151 ms	42284 KB	Output is correct
54	Correct	144 ms	42292 KB	Output is correct
55	Correct	3 ms	42292 KB	Output is correct
56	Correct	2 ms	42292 KB	Output is correct
57	Correct	3 ms	42292 KB	Output is correct
58	Correct	3 ms	42292 KB	Output is correct
59	Correct	2 ms	42292 KB	Output is correct
60	Correct	2 ms	42292 KB	Output is correct
61	Correct	2 ms	42292 KB	Output is correct
62	Correct	2 ms	42292 KB	Output is correct
63	Correct	2 ms	42292 KB	Output is correct
64	Correct	2 ms	42292 KB	Output is correct
65	Correct	2 ms	42292 KB	Output is correct
66	Correct	2 ms	42292 KB	Output is correct
67	Correct	114 ms	42292 KB	Output is correct
68	Correct	123 ms	43444 KB	Output is correct
69	Correct	163 ms	44704 KB	Output is correct
70	Correct	114 ms	45888 KB	Output is correct
71	Correct	124 ms	47224 KB	Output is correct
72	Correct	125 ms	48484 KB	Output is correct
73	Correct	141 ms	49848 KB	Output is correct
74	Correct	140 ms	51600 KB	Output is correct
75	Correct	127 ms	53192 KB	Output is correct
76	Correct	127 ms	55140 KB	Output is correct
77	Correct	115 ms	56532 KB	Output is correct
78	Correct	115 ms	57840 KB	Output is correct
79	Correct	126 ms	59188 KB	Output is correct
80	Correct	113 ms	60536 KB	Output is correct
81	Correct	149 ms	62032 KB	Output is correct
82	Correct	177 ms	63452 KB	Output is correct
83	Correct	117 ms	64988 KB	Output is correct
84	Correct	119 ms	66932 KB	Output is correct
85	Correct	134 ms	68864 KB	Output is correct
86	Correct	141 ms	70936 KB	Output is correct
87	Correct	125 ms	72564 KB	Output is correct
88	Correct	120 ms	72564 KB	Output is correct
89	Correct	120 ms	72564 KB	Output is correct
90	Correct	128 ms	72564 KB	Output is correct
91	Correct	132 ms	72564 KB	Output is correct
92	Correct	140 ms	72620 KB	Output is correct
93	Correct	119 ms	72620 KB	Output is correct
94	Correct	120 ms	72620 KB	Output is correct
95	Correct	124 ms	72620 KB	Output is correct
96	Correct	120 ms	72620 KB	Output is correct
97	Correct	125 ms	72620 KB	Output is correct
98	Correct	122 ms	72620 KB	Output is correct
99	Correct	134 ms	72620 KB	Output is correct
100	Correct	126 ms	72620 KB	Output is correct
101	Correct	120 ms	72620 KB	Output is correct
102	Correct	138 ms	72620 KB	Output is correct

답안 #56090

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 45.0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
45.0 / 45.0