oj.uz

Submission #922161

# Submission time Handle Problem Language Result Execution time Memory
922161 2024-02-05T07:48:11 Z asdasdqwer Palembang Bridges (APIO15_bridge) C++14
22 / 100
 84 ms 7356 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 || n == 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)> insert=[&](int num) {
        m1.insert(num);
        s1 += num;
        while ((m1.size() > m2.size() && ((m1.size() + m2.size()) % 2 == 0)) ||
                (m1.size() - 1 > m2.size() && ((m1.size() + m2.size()) % 2 == 1))) {
            num = *m1.rbegin();
            m1.erase(m1.find(num));
            m2.insert(num);
            s1 -= num;
            s2 += num;
        }
    };

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

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

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

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

    res += dif.size();

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

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:102:19: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for (int i=1;i<cst1.size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 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 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 344 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 456 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 38 ms 5676 KB Output is correct
13 Correct 79 ms 7216 KB Output is correct
14 Correct 53 ms 6052 KB Output is correct
15 Correct 46 ms 4036 KB Output is correct
16 Correct 56 ms 6592 KB Output is correct
17 Correct 69 ms 7356 KB Output is correct
18 Correct 67 ms 6620 KB Output is correct
19 Correct 84 ms 7200 KB Output is correct
20 Correct 60 ms 6796 KB Output is correct
21 Correct 69 ms 6864 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -