oj.uz

Submission #313135

# Submission time Handle Problem Language Result Execution time Memory
313135 2020-10-15T08:39:37 Z kylych03 Wiring (IOI17_wiring) C++14
100 / 100
 80 ms 12604 KB 
#include "wiring.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
#define ll long long
using namespace std;
long long dp[200002];
long long inf  = 1e15;
long long MAXN =200005;
long long balance[200005];
long long pref[200005];
vector <int> r,b;
int getMin(pair<ll, bool> curr) {
    if(curr.second) {
        auto it = lower_bound(r.begin(), r.end(), curr.first);
        long long mn = inf;
        if(it != r.end())
            mn = min(mn, *it - curr.first);
        if(it != r.begin())
        {it --; mn = min(mn, curr.first - *it);}
        return mn;
    } else {
        auto it = lower_bound(b.begin(), b.end(), curr.first);
       long long mn = inf;
        if(it != b.end())
            mn = min(mn, *it - curr.first);
        if(it != b.begin()) {
            it --; mn = min(mn, curr.first - *it);
        }
        return mn;
    }
}
long long min_total_length(std::vector<int> r1, std::vector<int> b1) {
    vector < pair <ll, bool> > pr;
    int n = r1.size();
    int m = b1.size();
    pr.resize(n+m);
    r.resize(n);
    r=r1;
    b.resize(m);
    b=b1;

    for(int i = 0 ; i < n; i++){
        pr[i].first = r1[i];

        pr[i].second = 0;
    }
    for(int i = 0 ; i < m; i++){
        pr[i+n].first = b1[i];
        pr[i+n].second = 1;
    }
    pr.push_back(make_pair(-inf, 0));
    sort(pr.begin(), pr.end());
   for(int i = 0 ; i < MAXN; i++)
    balance[i]=-1;
    long long curr = MAXN / 2;
    balance[curr] = 0;
    dp[0]=0;
    for(int i = 1 ; i <= n + m ; i++){

        if(pr[i].second) {
            pref[i] = pref[i -1] - pr[i].first;
            curr --;
        } else {
            pref[i] = pref[i -1] + pr[i].first;
            curr ++;
        }
        dp[i] = dp[i-1] + getMin(pr[i]);
        if(balance[curr]!=-1){
            dp[i] = min(dp[i], dp[balance[curr]] + abs(pref[i] - pref[balance[curr]]));
        }
        balance[curr] = i;
    }


	return dp[n+m];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:53:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   53 |    for(int i = 0 ; i < MAXN; i++)
      |    ^~~
wiring.cpp:55:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   55 |     long long curr = MAXN / 2;
      |     ^~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1920 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 51 ms 9868 KB Output is correct
4 Correct 51 ms 9816 KB Output is correct
5 Correct 51 ms 9808 KB Output is correct
6 Correct 67 ms 12224 KB Output is correct
7 Correct 69 ms 12224 KB Output is correct
8 Correct 68 ms 12228 KB Output is correct
9 Correct 67 ms 12224 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 74 ms 12352 KB Output is correct
4 Correct 73 ms 12096 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 1 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 1 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 1 ms 1920 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 2 ms 1920 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 75 ms 12488 KB Output is correct
19 Correct 73 ms 12488 KB Output is correct
20 Correct 80 ms 12476 KB Output is correct
21 Correct 73 ms 12492 KB Output is correct
22 Correct 73 ms 12484 KB Output is correct
23 Correct 72 ms 12384 KB Output is correct
24 Correct 71 ms 12484 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1840 KB Output is correct
2 Correct 52 ms 11712 KB Output is correct
3 Correct 62 ms 11712 KB Output is correct
4 Correct 64 ms 11712 KB Output is correct
5 Correct 62 ms 11712 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 1 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 1 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 1 ms 1920 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 2 ms 1920 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 61 ms 11712 KB Output is correct
19 Correct 64 ms 11708 KB Output is correct
20 Correct 54 ms 11712 KB Output is correct
21 Correct 63 ms 11712 KB Output is correct
22 Correct 63 ms 11708 KB Output is correct
23 Correct 55 ms 11716 KB Output is correct
24 Correct 57 ms 11712 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 1 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1916 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 2 ms 1920 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 2 ms 1920 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 1 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 51 ms 9868 KB Output is correct
20 Correct 51 ms 9816 KB Output is correct
21 Correct 51 ms 9808 KB Output is correct
22 Correct 67 ms 12224 KB Output is correct
23 Correct 69 ms 12224 KB Output is correct
24 Correct 68 ms 12228 KB Output is correct
25 Correct 67 ms 12224 KB Output is correct
26 Correct 2 ms 1920 KB Output is correct
27 Correct 2 ms 1920 KB Output is correct
28 Correct 74 ms 12352 KB Output is correct
29 Correct 73 ms 12096 KB Output is correct
30 Correct 2 ms 1920 KB Output is correct
31 Correct 1 ms 1920 KB Output is correct
32 Correct 2 ms 1920 KB Output is correct
33 Correct 2 ms 1920 KB Output is correct
34 Correct 2 ms 1920 KB Output is correct
35 Correct 1 ms 1920 KB Output is correct
36 Correct 2 ms 1920 KB Output is correct
37 Correct 2 ms 1920 KB Output is correct
38 Correct 1 ms 1920 KB Output is correct
39 Correct 2 ms 1920 KB Output is correct
40 Correct 2 ms 1920 KB Output is correct
41 Correct 2 ms 1920 KB Output is correct
42 Correct 2 ms 1920 KB Output is correct
43 Correct 75 ms 12488 KB Output is correct
44 Correct 73 ms 12488 KB Output is correct
45 Correct 80 ms 12476 KB Output is correct
46 Correct 73 ms 12492 KB Output is correct
47 Correct 73 ms 12484 KB Output is correct
48 Correct 72 ms 12384 KB Output is correct
49 Correct 71 ms 12484 KB Output is correct
50 Correct 2 ms 1840 KB Output is correct
51 Correct 52 ms 11712 KB Output is correct
52 Correct 62 ms 11712 KB Output is correct
53 Correct 64 ms 11712 KB Output is correct
54 Correct 62 ms 11712 KB Output is correct
55 Correct 2 ms 1920 KB Output is correct
56 Correct 2 ms 1920 KB Output is correct
57 Correct 1 ms 1920 KB Output is correct
58 Correct 2 ms 1920 KB Output is correct
59 Correct 1 ms 1920 KB Output is correct
60 Correct 2 ms 1920 KB Output is correct
61 Correct 1 ms 1920 KB Output is correct
62 Correct 1 ms 1920 KB Output is correct
63 Correct 2 ms 1920 KB Output is correct
64 Correct 2 ms 1920 KB Output is correct
65 Correct 2 ms 1920 KB Output is correct
66 Correct 2 ms 1920 KB Output is correct
67 Correct 61 ms 11712 KB Output is correct
68 Correct 64 ms 11708 KB Output is correct
69 Correct 54 ms 11712 KB Output is correct
70 Correct 63 ms 11712 KB Output is correct
71 Correct 63 ms 11708 KB Output is correct
72 Correct 55 ms 11716 KB Output is correct
73 Correct 57 ms 11712 KB Output is correct
74 Correct 75 ms 12604 KB Output is correct
75 Correct 65 ms 12092 KB Output is correct
76 Correct 71 ms 12604 KB Output is correct
77 Correct 64 ms 11968 KB Output is correct
78 Correct 55 ms 11840 KB Output is correct
79 Correct 50 ms 11840 KB Output is correct
80 Correct 63 ms 11836 KB Output is correct
81 Correct 62 ms 11964 KB Output is correct
82 Correct 55 ms 11968 KB Output is correct
83 Correct 63 ms 12088 KB Output is correct
84 Correct 68 ms 12476 KB Output is correct
85 Correct 57 ms 12480 KB Output is correct
86 Correct 68 ms 12480 KB Output is correct
87 Correct 60 ms 12480 KB Output is correct
88 Correct 70 ms 12480 KB Output is correct
89 Correct 71 ms 12476 KB Output is correct
90 Correct 71 ms 12424 KB Output is correct
91 Correct 61 ms 12480 KB Output is correct
92 Correct 72 ms 12604 KB Output is correct
93 Correct 71 ms 12476 KB Output is correct
94 Correct 64 ms 12484 KB Output is correct
95 Correct 71 ms 12484 KB Output is correct
96 Correct 69 ms 12476 KB Output is correct
97 Correct 60 ms 12488 KB Output is correct
98 Correct 61 ms 12464 KB Output is correct
99 Correct 62 ms 12480 KB Output is correct
100 Correct 74 ms 12480 KB Output is correct
101 Correct 71 ms 12476 KB Output is correct
102 Correct 73 ms 12476 KB Output is correct