oj.uz

Submission #456359

# Submission time Handle Problem Language Result Execution time Memory
456359 2021-08-06T14:11:27 Z blue Wiring (IOI17_wiring) C++17
100 / 100
 93 ms 18336 KB 
#include "wiring.h"
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


vector<int> R, B;
int N, M;

vector<int> S;
vector< vector<long long> > X;
vector< vector<long long> > Xsum;

const long long INF = 1'000'000'000'000'000'000LL;

long long get_score(int i, int p1, int p2)
{
    long long size1 = S[i] - p1 + 1;
    long long size2 = p2;

    // cerr << "size ";

    // cerr << size1 << ' ' << size2 << '\n';

    long long ans = Xsum[i+1][size2]  -  (Xsum[i][S[i]] - Xsum[i][S[i] - size1]);

    // cerr << "ans = " <<  ans << '\n';
    // cerr << X[i+1][1] * (size1 - size2) << '\n';

    if(size1 > size2) ans += X[i+1][1] * (size1 - size2);
    else if(size1 < size2) ans -= X[i].back() * (size2 - size1);

    // cerr << "get score " << i << ' ' << p1 << ' ' << p2 << ' ' << ans << '\n';

    return ans;
}

long long min_total_length(vector<int> r, vector<int> b)
{
//PART 0: GET INPUT AND DIVIDE INTO BLOCKS
    R = r;
    B = b;
    N = R.size();
    M = B.size();

    int I[N+M];
    for(int i = 1; i <= N; i++) I[i-1] = i;
    for(int j = 1; j <= M; j++) I[N+j-1] = -j;
    sort(I, I+N+M, [] (int x, int y)
    {
        int px = x > 0 ? R[x-1] : B[-(x+1)];
        int py = y > 0 ? R[y-1] : B[-(y+1)];
        return px < py;
    });


    for(int j = 0; j < N+M; j++)
    {
        // cerr << "j = " << I[j] << '\n';

        int new_vector = (j == 0 || ((I[j] > 0) != (I[j-1] > 0)));

        if(new_vector)
        {
            S.push_back(0);
            X.push_back(vector<long long>(1, 0));
        }

        int i = I[j];
        X.back().push_back(i > 0 ? R[i-1] : B[-(i+1)]);
        S[S.size()-1]++;
    }

    Xsum = X;
    for(int i = 0; i < X.size(); i++)
    {
        for(int j = 1; j < X[i].size(); j++)
        {
            Xsum[i][j] += Xsum[i][j-1];
        }
        // cerr << i << ' ' << S[i] << ": ";
        // for(int j = 0; j < X[i].size(); j++) cerr << X[i][j] << ' ';
        // cerr << "| ";
        // for(int j = 0; j < Xsum[i].size(); j++) cerr << Xsum[i][j] << ' ';
        // cerr << '\n';
    }

    // cerr << get_score(6, 2, 1) << '\n';

    vector<long long> res[X.size()];

    // cerr << "blocks = " << X.size() << '\n';

    res[0] = vector<long long>(X[0].size());
    res[0][0] = 0;
    for(int j = 1; j < res[0].size(); j++)
    {
        // cerr << 0 << ' ' << j << ' ' << X[0][j] << ' ' << INF << '\n';
        res[0][j] = INF;
    }

    res[1] = vector<long long>(X[1].size());
    res[1][0] = INF;
    for(int j = 1; j < res[1].size(); j++)
    {
        res[1][j] = get_score(0, 1, j);
        // cerr << 1 << ' ' << j << ' ' << X[1][j] << ' ' << res[1][j] << '\n';
    }

    // cerr << "yes\n";

    for(int i = 2; i < X.size(); i++)
    {
        // cerr << "i = " << i << '\n';
        res[i] = vector<long long>(X[i].size());
        res[i][0] = res[i-1].back();

        int j1 = res[i-1].size()-1;
        for(int j = 1; j < res[i].size(); j++)
        {
            // cerr << "j = " << j << '\n';
            res[i][j] = min(res[i-1][j1-1], res[i-1][j1]) + get_score(i-1, j1, j);
            while(j1-1 >= 1)
            {
                long long curr_dp = min(res[i-1][j1-1], res[i-1][j1]) + get_score(i-1, j1, j);
                long long next_dp = min(res[i-1][j1-2], res[i-1][j1-1]) + get_score(i-1, j1-1, j);
                if(next_dp <= curr_dp)
                {
                    j1--;
                    res[i][j] = next_dp;
                }
                else
                    break;
            }

            // cerr << i << ' ' << j << ' ' << X[i][j] << ' ' << res[i][j] << '\n';
        }
        // cerr << "check\n";
    }

    return res[X.size()-1].back();
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i = 0; i < X.size(); i++)
      |                    ~~^~~~~~~~~~
wiring.cpp:78:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for(int j = 1; j < X[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~
wiring.cpp:97:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for(int j = 1; j < res[0].size(); j++)
      |                    ~~^~~~~~~~~~~~~~~
wiring.cpp:105:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for(int j = 1; j < res[1].size(); j++)
      |                    ~~^~~~~~~~~~~~~~~
wiring.cpp:113:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i = 2; i < X.size(); i++)
      |                    ~~^~~~~~~~~~
wiring.cpp:120:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |         for(int j = 1; j < res[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 31 ms 7704 KB Output is correct
4 Correct 30 ms 7636 KB Output is correct
5 Correct 30 ms 7516 KB Output is correct
6 Correct 40 ms 10152 KB Output is correct
7 Correct 40 ms 10144 KB Output is correct
8 Correct 40 ms 10172 KB Output is correct
9 Correct 40 ms 10172 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 90 ms 18336 KB Output is correct
4 Correct 86 ms 14204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 89 ms 18296 KB Output is correct
19 Correct 89 ms 18292 KB Output is correct
20 Correct 84 ms 14548 KB Output is correct
21 Correct 88 ms 18264 KB Output is correct
22 Correct 89 ms 17244 KB Output is correct
23 Correct 93 ms 17380 KB Output is correct
24 Correct 89 ms 17296 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 55 ms 9548 KB Output is correct
3 Correct 71 ms 12516 KB Output is correct
4 Correct 80 ms 9984 KB Output is correct
5 Correct 70 ms 12552 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 50 ms 9420 KB Output is correct
19 Correct 67 ms 9640 KB Output is correct
20 Correct 57 ms 9924 KB Output is correct
21 Correct 48 ms 9456 KB Output is correct
22 Correct 53 ms 9508 KB Output is correct
23 Correct 42 ms 9880 KB Output is correct
24 Correct 41 ms 9380 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 31 ms 7704 KB Output is correct
20 Correct 30 ms 7636 KB Output is correct
21 Correct 30 ms 7516 KB Output is correct
22 Correct 40 ms 10152 KB Output is correct
23 Correct 40 ms 10144 KB Output is correct
24 Correct 40 ms 10172 KB Output is correct
25 Correct 40 ms 10172 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 90 ms 18336 KB Output is correct
29 Correct 86 ms 14204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 89 ms 18296 KB Output is correct
44 Correct 89 ms 18292 KB Output is correct
45 Correct 84 ms 14548 KB Output is correct
46 Correct 88 ms 18264 KB Output is correct
47 Correct 89 ms 17244 KB Output is correct
48 Correct 93 ms 17380 KB Output is correct
49 Correct 89 ms 17296 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 55 ms 9548 KB Output is correct
52 Correct 71 ms 12516 KB Output is correct
53 Correct 80 ms 9984 KB Output is correct
54 Correct 70 ms 12552 KB Output is correct
55 Correct 1 ms 296 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 50 ms 9420 KB Output is correct
68 Correct 67 ms 9640 KB Output is correct
69 Correct 57 ms 9924 KB Output is correct
70 Correct 48 ms 9456 KB Output is correct
71 Correct 53 ms 9508 KB Output is correct
72 Correct 42 ms 9880 KB Output is correct
73 Correct 41 ms 9380 KB Output is correct
74 Correct 43 ms 10012 KB Output is correct
75 Correct 70 ms 9936 KB Output is correct
76 Correct 56 ms 10168 KB Output is correct
77 Correct 51 ms 9532 KB Output is correct
78 Correct 50 ms 9504 KB Output is correct
79 Correct 53 ms 9596 KB Output is correct
80 Correct 53 ms 9500 KB Output is correct
81 Correct 52 ms 9592 KB Output is correct
82 Correct 40 ms 9636 KB Output is correct
83 Correct 42 ms 9852 KB Output is correct
84 Correct 43 ms 10264 KB Output is correct
85 Correct 57 ms 10108 KB Output is correct
86 Correct 45 ms 10140 KB Output is correct
87 Correct 46 ms 10072 KB Output is correct
88 Correct 51 ms 10080 KB Output is correct
89 Correct 49 ms 10016 KB Output is correct
90 Correct 64 ms 10136 KB Output is correct
91 Correct 44 ms 10392 KB Output is correct
92 Correct 52 ms 10040 KB Output is correct
93 Correct 47 ms 10136 KB Output is correct
94 Correct 49 ms 10132 KB Output is correct
95 Correct 55 ms 10160 KB Output is correct
96 Correct 43 ms 10148 KB Output is correct
97 Correct 43 ms 10080 KB Output is correct
98 Correct 49 ms 10268 KB Output is correct
99 Correct 47 ms 10300 KB Output is correct
100 Correct 56 ms 10092 KB Output is correct
101 Correct 49 ms 10016 KB Output is correct
102 Correct 58 ms 10148 KB Output is correct