oj.uz

Submission #95413

# Submission time Handle Problem Language Result Execution time Memory
95413 2019-01-31T22:36:50 Z jed Wiring (IOI17_wiring) C++14
100 / 100
 63 ms 11768 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define scanu(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
#define scan(x) do{while((x=getchar())<'-'); _ssign=x=='-'; if(_ssign) while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0'); x=_ssign?-x:x;}while(0)
char _; bool _ssign;
struct pair_hash { template <typename T1, typename T2> std::size_t operator()(const std::pair<T1, T2> &p) const { auto h1 = std::hash<T1>{}(p.first); auto h2 = std::hash<T2>{}(p.second); return h1 ^ h2; } };
template<typename T1, typename T2, typename T3> struct triple { T1 first; T2 second; T3 third; triple() : first{}, second{}, third{} {} triple(const T1 &first, const T2 &second, const T3 &third) : first{ first }, second{ second }, third{ third } {} triple(T1 &&first, T2 &&second, T3 &&third) : first{ first }, second{ second }, third{ third } {} };
template<typename T1, typename T2, typename T3, typename T4> struct quad { T1 first; T2 second; T3 third; T4 fourth; quad() : first{}, second{}, third{}, fourth{} {} quad(const T1 &first, const T2 &second, const T3 &third, const T4 &fourth) : first{ first }, second{ second }, third{ third }, fourth{ fourth } {} quad(T1 &&first, T2 &&second, T3 &&third, T4 &&fourth) : first{ first }, second{ second }, third{ third }, fourth{ fourth } {} };
template<typename T> using min_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> using max_priority_queue = std::priority_queue<T>;
inline int ffs(int x) { return __builtin_ffs(x); }
inline int ctz(int x) { return __builtin_ctz(x); }
inline int clz(int x) { return __builtin_clz(x); }
inline int popcount(int x) { return __builtin_popcount(x); }
inline int ffs(long long x) { return __builtin_ffsll(x); }
inline int ctz(long long x) { return __builtin_ctzll(x); }
inline int clz(long long x) { return __builtin_clzll(x); }
inline int popcount(long long x) { return __builtin_popcountll(x); }
template<typename _EuclideanRingElement> inline _EuclideanRingElement euclidean(const _EuclideanRingElement &_m, const _EuclideanRingElement &_n) { return std::__gcd(_m, _n); }
template<typename T> inline constexpr const T &_min(const T &x, const T &y) { return x < y ? x : y; }
template<typename T> inline constexpr const T &_max(const T &x, const T &y) { return x < y ? y : x; }
template<typename T, typename ...Ts> inline constexpr const T &_min(const T &x, const Ts &...xs) { return _min(x, _min(xs...)); }
template<typename T, typename ...Ts> inline constexpr const T &_max(const T &x, const Ts &...xs) { return _max(x, _max(xs...)); }
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
#define INF 0x3f3f3f3f3f3f3f3fll
#define inf 0x3f3f3f3f
using namespace std;

int N, lvl, lpos[200001], last[200001];
long long sumr[200001], sumb[200001], dp[200001];
pair<int, int> pts[200001];

long long nearist_dist(vector<int> &a, int x) {
    long long min_dist = INF;
    auto it = lower_bound(a.begin(), a.end(), x);
    if (it != a.end())
        min_dist = *it - x;
    if (it != a.begin())
        min_dist = min(min_dist, (long long) x - *--it);
    return min_dist;
}

long long min_total_length(vector<int> r, vector<int> b) {
    for (int x : r)
        pts[++N] = {x, -1};
    for (int x : b)
        pts[++N] = {x, 1};

    fill(last, last + N + 1, -1);
    sort(pts + 1, pts + N + 1);
    lvl = r.size();
    last[lvl] = 0;
    for (int i = 1; i <= N; i++) {
        sumr[i] = sumr[i - 1];
        sumb[i] = sumb[i - 1];
        (pts[i].second == -1 ? sumr[i] : sumb[i]) += pts[i].first;
        lvl += pts[i].second;
        lpos[i] = last[lvl];
        last[lvl] = i;
    }

    for (int i = 1; i <= N; i++) {
        dp[i] = dp[i - 1] + nearist_dist(pts[i].second == -1 ? b : r, pts[i].first);
        if (~lpos[i]) dp[i] = min(dp[i], dp[lpos[i]] + abs((sumr[i] - sumr[lpos[i]]) - (sumb[i] - sumb[lpos[i]])));
    }

    return dp[N];
}

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 376 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 380 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 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 32 ms 8808 KB Output is correct
4 Correct 31 ms 8824 KB Output is correct
5 Correct 33 ms 8752 KB Output is correct
6 Correct 42 ms 11640 KB Output is correct
7 Correct 43 ms 11640 KB Output is correct
8 Correct 42 ms 11640 KB Output is correct
9 Correct 42 ms 11640 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 62 ms 11768 KB Output is correct
4 Correct 59 ms 11256 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 376 KB Output is correct
8 Correct 2 ms 380 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 380 KB Output is correct
13 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 62 ms 11640 KB Output is correct
19 Correct 60 ms 11640 KB Output is correct
20 Correct 61 ms 11640 KB Output is correct
21 Correct 61 ms 11640 KB Output is correct
22 Correct 63 ms 11768 KB Output is correct
23 Correct 62 ms 11636 KB Output is correct
24 Correct 61 ms 11640 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 47 ms 10964 KB Output is correct
3 Correct 53 ms 10972 KB Output is correct
4 Correct 51 ms 11000 KB Output is correct
5 Correct 53 ms 11000 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 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 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 46 ms 11000 KB Output is correct
19 Correct 49 ms 11012 KB Output is correct
20 Correct 46 ms 11036 KB Output is correct
21 Correct 44 ms 11000 KB Output is correct
22 Correct 47 ms 11000 KB Output is correct
23 Correct 39 ms 11004 KB Output is correct
24 Correct 40 ms 11000 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 376 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 380 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 32 ms 8808 KB Output is correct
20 Correct 31 ms 8824 KB Output is correct
21 Correct 33 ms 8752 KB Output is correct
22 Correct 42 ms 11640 KB Output is correct
23 Correct 43 ms 11640 KB Output is correct
24 Correct 42 ms 11640 KB Output is correct
25 Correct 42 ms 11640 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 62 ms 11768 KB Output is correct
29 Correct 59 ms 11256 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 380 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 2 ms 376 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 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 62 ms 11640 KB Output is correct
44 Correct 60 ms 11640 KB Output is correct
45 Correct 61 ms 11640 KB Output is correct
46 Correct 61 ms 11640 KB Output is correct
47 Correct 63 ms 11768 KB Output is correct
48 Correct 62 ms 11636 KB Output is correct
49 Correct 61 ms 11640 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 47 ms 10964 KB Output is correct
52 Correct 53 ms 10972 KB Output is correct
53 Correct 51 ms 11000 KB Output is correct
54 Correct 53 ms 11000 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 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 376 KB Output is correct
63 Correct 2 ms 380 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 46 ms 11000 KB Output is correct
68 Correct 49 ms 11012 KB Output is correct
69 Correct 46 ms 11036 KB Output is correct
70 Correct 44 ms 11000 KB Output is correct
71 Correct 47 ms 11000 KB Output is correct
72 Correct 39 ms 11004 KB Output is correct
73 Correct 40 ms 11000 KB Output is correct
74 Correct 44 ms 11640 KB Output is correct
75 Correct 52 ms 11256 KB Output is correct
76 Correct 53 ms 11612 KB Output is correct
77 Correct 48 ms 11076 KB Output is correct
78 Correct 46 ms 11000 KB Output is correct
79 Correct 47 ms 11128 KB Output is correct
80 Correct 42 ms 11128 KB Output is correct
81 Correct 45 ms 11132 KB Output is correct
82 Correct 42 ms 11124 KB Output is correct
83 Correct 41 ms 11256 KB Output is correct
84 Correct 44 ms 11640 KB Output is correct
85 Correct 55 ms 11768 KB Output is correct
86 Correct 47 ms 11640 KB Output is correct
87 Correct 48 ms 11612 KB Output is correct
88 Correct 50 ms 11664 KB Output is correct
89 Correct 48 ms 11640 KB Output is correct
90 Correct 56 ms 11640 KB Output is correct
91 Correct 46 ms 11640 KB Output is correct
92 Correct 47 ms 11684 KB Output is correct
93 Correct 45 ms 11640 KB Output is correct
94 Correct 47 ms 11640 KB Output is correct
95 Correct 51 ms 11644 KB Output is correct
96 Correct 44 ms 11640 KB Output is correct
97 Correct 46 ms 11644 KB Output is correct
98 Correct 49 ms 11768 KB Output is correct
99 Correct 49 ms 11640 KB Output is correct
100 Correct 53 ms 11768 KB Output is correct
101 Correct 47 ms 11644 KB Output is correct
102 Correct 53 ms 11616 KB Output is correct