oj.uz

Submission #1075444

# Submission time Handle Problem Language Result Execution time Memory
1075444 2024-08-26T06:10:42 Z stdfloat Palembang Bridges (APIO15_bridge) C++17
31 / 100
 2000 ms 10020 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});
    }

    if (v.empty()) return cout << sm, 0;
 
    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 + 1; 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 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 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 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 524 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 26 ms 8528 KB Output is correct
13 Correct 50 ms 10020 KB Output is correct
14 Correct 37 ms 8192 KB Output is correct
15 Correct 27 ms 5972 KB Output is correct
16 Correct 28 ms 9020 KB Output is correct
17 Correct 28 ms 9456 KB Output is correct
18 Correct 35 ms 8884 KB Output is correct
19 Correct 37 ms 9472 KB Output is correct
20 Correct 37 ms 8956 KB Output is correct
21 Correct 40 ms 9020 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 21 ms 348 KB Output is correct
4 Correct 21 ms 348 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 30 ms 348 KB Output is correct
10 Correct 30 ms 348 KB Output is correct
11 Correct 30 ms 348 KB Output is correct
12 Correct 30 ms 348 KB Output is correct

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 21 ms 348 KB Output is correct
4 Correct 24 ms 344 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 30 ms 464 KB Output is correct
8 Correct 28 ms 348 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 34 ms 348 KB Output is correct
11 Correct 30 ms 348 KB Output is correct
12 Correct 31 ms 348 KB Output is correct
13 Execution timed out 2084 ms 344 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.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 23 ms 468 KB Output is correct
4 Correct 23 ms 464 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 30 ms 440 KB Output is correct
8 Correct 30 ms 344 KB Output is correct
9 Correct 30 ms 348 KB Output is correct
10 Correct 30 ms 344 KB Output is correct
11 Correct 31 ms 344 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Execution timed out 2075 ms 348 KB Time limit exceeded
14 Halted 0 ms 0 KB -