oj.uz

Submission #922200

# Submission time Handle Problem Language Result Execution time Memory
922200 2024-02-05T08:29:05 Z asdasdqwer Palembang Bridges (APIO15_bridge) C++14
22 / 100
 80 ms 5068 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;
        num1 = *m1.rbegin();
        s1 -= num1;
        s2 += num1;
        m1.erase(m1.find(num1));
        m2.insert(num1);
    };

    vector<int> cst1;
    for (auto x:dif) {
        insert(x[0], x[1]);
        int med = *m2.begin();
        cst1.push_back((((int)m1.size() * med) - s1) + (s2 - (((int)m2.size()) * med)));
    }

    // 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];
    //     int tmp=0;
    //     for (int y:al) {
    //         tmp += abs(y-med);
    //     }
    //     cst1.push_back(tmp);
    // }

    reverse(dif.begin(),dif.end());
    vector<int> cst2;
    m1.clear();m2.clear();
    s1=s2=0;

    for (auto x:dif) {
        insert(x[0], x[1]);
        int med = *m2.begin();
        cst2.push_back((((int)m1.size() * med) - s1) + (s2 - (((int)m2.size()) * med)));
    }

    // 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());
    // reverse(tmp2.begin(), tmp2.end());
    int res = 1e17;

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

    res += 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 344 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 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.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 348 KB Output is correct
7 Correct 1 ms 464 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 444 KB Output is correct
12 Correct 37 ms 5068 KB Output is correct
13 Correct 80 ms 4832 KB Output is correct
14 Correct 52 ms 4796 KB Output is correct
15 Correct 50 ms 2644 KB Output is correct
16 Correct 56 ms 5052 KB Output is correct
17 Correct 70 ms 5068 KB Output is correct
18 Correct 68 ms 4972 KB Output is correct
19 Correct 78 ms 5012 KB Output is correct
20 Correct 61 ms 4984 KB Output is correct
21 Correct 74 ms 5056 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -