oj.uz

Submission #1038338

# Submission time Handle Problem Language Result Execution time Memory
1038338 2024-07-29T17:03:28 Z stdfloat Palembang Bridges (APIO15_bridge) C++17
22 / 100
 56 ms 7988 KB 
#include <bits/stdc++.h>
using namespace std;
    
using ll = long long;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int K, n;
    cin >> K >> n;

    ll sm = 0;
    vector<vector<int>> v;
    for (int i = 0; i < n; i++) {
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;

        if (p == q) sm += abs(t - s);
        else v.push_back({s + t, s, t});
    }

    sm += (int)v.size();

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

    vector<int> u;
    for (auto i : v) u.insert(u.end(), {i[1], i[2]});

    if (K == 1) {
        sort(u.begin(), u.end());
        for (int j = 0; j < (int)u.size(); j++) sm += (j < (int)u.size() >> 1 ? -1 : 1) * u[j];

        return cout << sm, 0;
    }

    ll mn = LLONG_MAX;
    for (int i = 0; i < (int)u.size(); i++) {
        for (int j = i; j < (int)u.size(); j++) {
            ll sm = 0;
            for (auto k : v) sm += min(abs(k[1] - u[i]) + abs(k[2] - u[i]), abs(k[1] - u[j]) + abs(k[2] - u[j]));

            mn = min(mn, sm);
        }
    }

    cout << sm + mn;
}

Subtask #1
8.0 / 8.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 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 508 KB Output is correct
11 Correct 0 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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 25 ms 7752 KB Output is correct
13 Correct 56 ms 7680 KB Output is correct
14 Correct 37 ms 7172 KB Output is correct
15 Correct 26 ms 4444 KB Output is correct
16 Correct 26 ms 7680 KB Output is correct
17 Correct 26 ms 7688 KB Output is correct
18 Correct 33 ms 7680 KB Output is correct
19 Correct 36 ms 7988 KB Output is correct
20 Correct 28 ms 7692 KB Output is correct
21 Correct 37 ms 7948 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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