oj.uz

Submission #922216

# Submission time Handle Problem Language Result Execution time Memory
922216 2024-02-05T08:50:31 Z asdasdqwer Palembang Bridges (APIO15_bridge) C++14
63 / 100
 161 ms 14084 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define pii array<int,2>

struct cmp {
    bool operator()(const pii &x, const pii &y) {
        return (x[0] + x[1]) < (y[0] + y[1]);
    }
};

signed main() {
    int k, n;cin>>k>>n;
    vector<pii> dif;
    int dis = 0;
    for (int i=0;i<n;i++) {
        char c1,c2;
        int p1,p2;
        cin>>c1>>p1>>c2>>p2;
        if (c1 == c2) {
            dis += abs(p1-p2);
        }
        else {
            dif.push_back({p1,p2});
        }
    }

    if (dif.size() == 0) {
        cout<<dis<<"\n";
        return 0;
    }

    if (k == 1 || dif.size() == 1) {

        vector<int> al;
        for (auto x:dif) {
            al.push_back(x[0]);
            al.push_back(x[1]);
        }

        sort(al.begin(),al.end());

        int med = al[al.size() / 2];

        for (int x:al) {
            dis += abs(x - med);
        }

        dis += dif.size();

        cout<<dis<<"\n";

        return 0;
    }

    sort(dif.begin(),dif.end(), cmp());

    multiset<int> m1, m2;
    int s1 = 0, s2 = 0;

    function<void(int,int)> insert=[&](int num1, int num2) {
        m1.insert(num1);
        m1.insert(num2);
        s1 += num1;
        s1 += num2;
        int num = *m1.rbegin();
        s1 -= num;
        s2 += num;
        m1.erase(m1.find(num));
        m2.insert(num);
    };

    vector<int> cst1, cst2;
    vector<int> al;
    if (dif.size() > 4000) {
        for (auto x:dif) {
            insert(x[0], x[1]);
            assert(m1.size() == m2.size());
            cst1.push_back(s2 - s1);
        }
    }

    else {
        for (auto x:dif) {
            al.push_back(x[0]);
            al.push_back(x[1]);
            sort(al.begin(),al.end());
            int med = al[al.size()/2];
            int tmp=0;
            for (int y:al) {
                tmp += abs(y-med);
            }
            cst1.push_back(tmp);
        }
    }

    reverse(dif.begin(),dif.end());
    m1.clear();m2.clear();
    s1=s2=0;
    al.clear();

    if (dif.size() > 4000) {
        for (auto x:dif) {
            insert(x[0], x[1]);
            assert(m1.size() == m2.size());
            cst2.push_back(s2 - s1);
        }
    }

    else {
        for (auto x:dif) {
            al.push_back(x[0]);
            al.push_back(x[1]);
            sort(al.begin(),al.end());
            int med = al[al.size()/2];
            int tmp=0;
            for (int y:al) {
                tmp += abs(y-med);
            }
            cst2.push_back(tmp);
        }
    }

    reverse(cst2.begin(),cst2.end());
    int res = 1e18;

    for (int i=1;i<(int)cst1.size();i++) {
        res = min(res, cst1[i-1] + cst2[i]);
    }

    res += (int)dif.size();

    cout<<res+dis<<"\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 564 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 452 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 36 ms 5828 KB Output is correct
13 Correct 79 ms 7360 KB Output is correct
14 Correct 60 ms 6088 KB Output is correct
15 Correct 46 ms 4036 KB Output is correct
16 Correct 55 ms 6576 KB Output is correct
17 Correct 70 ms 7356 KB Output is correct
18 Correct 68 ms 6996 KB Output is correct
19 Correct 90 ms 7172 KB Output is correct
20 Correct 62 ms 6852 KB Output is correct
21 Correct 71 ms 7108 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 17 ms 348 KB Output is correct
14 Correct 65 ms 348 KB Output is correct
15 Correct 63 ms 388 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 8 ms 348 KB Output is correct
19 Correct 18 ms 508 KB Output is correct
20 Correct 70 ms 500 KB Output is correct
21 Correct 64 ms 628 KB Output is correct
22 Correct 79 ms 348 KB Output is correct
23 Correct 19 ms 344 KB Output is correct
24 Correct 62 ms 348 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 16 ms 348 KB Output is correct
14 Correct 65 ms 344 KB Output is correct
15 Correct 64 ms 596 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 17 ms 348 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Correct 17 ms 504 KB Output is correct
20 Correct 62 ms 500 KB Output is correct
21 Correct 62 ms 344 KB Output is correct
22 Correct 63 ms 492 KB Output is correct
23 Correct 20 ms 600 KB Output is correct
24 Correct 62 ms 348 KB Output is correct
25 Correct 126 ms 13760 KB Output is correct
26 Incorrect 161 ms 14084 KB Output isn't correct
27 Halted 0 ms 0 KB -