oj.uz

Submission #586853

# Submission time Handle Problem Language Result Execution time Memory
586853 2022-06-30T18:43:55 Z MohamedFaresNebili Wiring (IOI17_wiring) C++14
100 / 100
 52 ms 15260 KB 
#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

                        using namespace std;

                        using ll = long long;
                        using ii = pair<ll, ll>;
                        using vi = vector<int>;

                        #define ff first
                        #define ss second
                        #define pb push_back
                        #define all(x) (x).begin(), (x).end()
                        #define lb lower_bound

                        const int MOD = 1000 * 1000 * 1000 + 7;

                        ll DP[222222], D[222222], P[222222], M[444444];
                        ll min_total_length(vector<int> R, vector<int> B) {
                            int N = R.size() + B.size(); vector<pair<ll, ll>> A;
                            for(auto u : R) A.push_back({u, -1});
                            for(auto u : B) A.push_back({u, 1});

                            sort(A.begin(), A.end()); memset(M, -1, sizeof M);
                            ll U = -1, V = -1;

                            for(int l = 1; l <= N; l++)
                                P[l] = P[l - 1] + A[l - 1].ff * A[l - 1].ss;

                            for(int l = 0; l < N; l++) {
                                D[l] = 1e18 + 7;
                                if(A[l].ss == -1) {
                                    if(V != -1) D[l] = min(D[l], A[l].ff - V);
                                    U = A[l].ff; continue;
                                }
                                if(U != -1) D[l] = min(D[l], A[l].ff - U);
                                V = A[l].ff; continue;
                            }
                            U = -1, V = -1; ll curr = N;
                            for(int l = N - 1; l >= 0; l--) {
                                if(A[l].ss == -1) {
                                    if(V != -1) D[l] = min(D[l], V - A[l].ff);
                                    U = A[l].ff; continue;
                                }
                                if(U != -1) D[l] = min(D[l], U - A[l].ff);
                                V = A[l].ff; continue;
                            }

                            M[N] = 0;
                            for(int l = 1; l <= N; l++) {
                                curr += A[l - 1].ss;
                                DP[l] = D[l - 1] + DP[l - 1];
                                if(M[curr] != -1)
                                    DP[l] = min(DP[l], DP[M[curr]] + abs(P[l] - P[M[curr]]));
                                M[curr] = l;
                            }

                            return DP[N];
                        }

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3920 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 27 ms 10916 KB Output is correct
4 Correct 25 ms 10944 KB Output is correct
5 Correct 25 ms 10856 KB Output is correct
6 Correct 35 ms 13252 KB Output is correct
7 Correct 32 ms 13260 KB Output is correct
8 Correct 33 ms 13240 KB Output is correct
9 Correct 34 ms 13308 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 44 ms 13236 KB Output is correct
4 Correct 45 ms 14884 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3768 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 45 ms 15140 KB Output is correct
19 Correct 44 ms 15136 KB Output is correct
20 Correct 47 ms 15232 KB Output is correct
21 Correct 45 ms 15140 KB Output is correct
22 Correct 45 ms 15212 KB Output is correct
23 Correct 43 ms 15152 KB Output is correct
24 Correct 46 ms 15140 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 38 ms 13244 KB Output is correct
3 Correct 42 ms 14472 KB Output is correct
4 Correct 41 ms 14500 KB Output is correct
5 Correct 52 ms 14460 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3716 KB Output is correct
17 Correct 2 ms 3764 KB Output is correct
18 Correct 36 ms 14496 KB Output is correct
19 Correct 39 ms 14500 KB Output is correct
20 Correct 38 ms 14520 KB Output is correct
21 Correct 35 ms 14496 KB Output is correct
22 Correct 38 ms 14484 KB Output is correct
23 Correct 32 ms 14468 KB Output is correct
24 Correct 32 ms 14504 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 1 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 1 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 2 ms 3920 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 27 ms 10916 KB Output is correct
20 Correct 25 ms 10944 KB Output is correct
21 Correct 25 ms 10856 KB Output is correct
22 Correct 35 ms 13252 KB Output is correct
23 Correct 32 ms 13260 KB Output is correct
24 Correct 33 ms 13240 KB Output is correct
25 Correct 34 ms 13308 KB Output is correct
26 Correct 2 ms 3796 KB Output is correct
27 Correct 2 ms 3796 KB Output is correct
28 Correct 44 ms 13236 KB Output is correct
29 Correct 45 ms 14884 KB Output is correct
30 Correct 2 ms 3796 KB Output is correct
31 Correct 2 ms 3796 KB Output is correct
32 Correct 2 ms 3796 KB Output is correct
33 Correct 2 ms 3796 KB Output is correct
34 Correct 2 ms 3796 KB Output is correct
35 Correct 2 ms 3796 KB Output is correct
36 Correct 2 ms 3796 KB Output is correct
37 Correct 2 ms 3796 KB Output is correct
38 Correct 2 ms 3796 KB Output is correct
39 Correct 2 ms 3796 KB Output is correct
40 Correct 2 ms 3796 KB Output is correct
41 Correct 2 ms 3768 KB Output is correct
42 Correct 2 ms 3796 KB Output is correct
43 Correct 45 ms 15140 KB Output is correct
44 Correct 44 ms 15136 KB Output is correct
45 Correct 47 ms 15232 KB Output is correct
46 Correct 45 ms 15140 KB Output is correct
47 Correct 45 ms 15212 KB Output is correct
48 Correct 43 ms 15152 KB Output is correct
49 Correct 46 ms 15140 KB Output is correct
50 Correct 2 ms 3796 KB Output is correct
51 Correct 38 ms 13244 KB Output is correct
52 Correct 42 ms 14472 KB Output is correct
53 Correct 41 ms 14500 KB Output is correct
54 Correct 52 ms 14460 KB Output is correct
55 Correct 2 ms 3796 KB Output is correct
56 Correct 2 ms 3796 KB Output is correct
57 Correct 2 ms 3796 KB Output is correct
58 Correct 2 ms 3796 KB Output is correct
59 Correct 2 ms 3796 KB Output is correct
60 Correct 2 ms 3796 KB Output is correct
61 Correct 2 ms 3796 KB Output is correct
62 Correct 2 ms 3796 KB Output is correct
63 Correct 2 ms 3796 KB Output is correct
64 Correct 2 ms 3796 KB Output is correct
65 Correct 2 ms 3716 KB Output is correct
66 Correct 2 ms 3764 KB Output is correct
67 Correct 36 ms 14496 KB Output is correct
68 Correct 39 ms 14500 KB Output is correct
69 Correct 38 ms 14520 KB Output is correct
70 Correct 35 ms 14496 KB Output is correct
71 Correct 38 ms 14484 KB Output is correct
72 Correct 32 ms 14468 KB Output is correct
73 Correct 32 ms 14504 KB Output is correct
74 Correct 33 ms 15252 KB Output is correct
75 Correct 43 ms 14780 KB Output is correct
76 Correct 39 ms 15156 KB Output is correct
77 Correct 38 ms 14624 KB Output is correct
78 Correct 35 ms 14648 KB Output is correct
79 Correct 37 ms 14648 KB Output is correct
80 Correct 32 ms 14620 KB Output is correct
81 Correct 37 ms 14648 KB Output is correct
82 Correct 32 ms 14620 KB Output is correct
83 Correct 34 ms 14816 KB Output is correct
84 Correct 34 ms 15260 KB Output is correct
85 Correct 42 ms 15248 KB Output is correct
86 Correct 38 ms 15256 KB Output is correct
87 Correct 38 ms 15260 KB Output is correct
88 Correct 38 ms 15152 KB Output is correct
89 Correct 36 ms 15160 KB Output is correct
90 Correct 45 ms 15140 KB Output is correct
91 Correct 36 ms 15144 KB Output is correct
92 Correct 37 ms 15144 KB Output is correct
93 Correct 37 ms 15232 KB Output is correct
94 Correct 37 ms 15140 KB Output is correct
95 Correct 45 ms 15140 KB Output is correct
96 Correct 36 ms 15164 KB Output is correct
97 Correct 35 ms 15140 KB Output is correct
98 Correct 38 ms 15148 KB Output is correct
99 Correct 37 ms 15160 KB Output is correct
100 Correct 42 ms 15144 KB Output is correct
101 Correct 37 ms 15144 KB Output is correct
102 Correct 41 ms 15160 KB Output is correct