oj.uz

Submission #1054355

# Submission time Handle Problem Language Result Execution time Memory
1054355 2024-08-12T09:05:49 Z Harold Palembang Bridges (APIO15_bridge) C++14
22 / 100
 25 ms 3272 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    /*int k, n;
    cin >> k >> n;
    vector<pair<int, int>> a, p;
    int res = 0;
    for(int i = 0; i < n; i++) {
        char c1, c2;
        int a1, a2;
        cin >> c1 >> a1 >> c2 >> a2;
        if(c1 == c2) {
            res += abs(a1-a2);
        }
        else {
            a.push_back({a1, a2});
        }
    }
    // incorrect when k = 2 couse need to choose
    sort(a.begin(), a.end());
    for(auto i: a) {
        pair<int, int> cur = {i.first, i.second};
        if(p.empty()) {
            p.push_back(cur);
            continue;
        }
        if(p.back().second >= cur.first) {
            p.back() = {cur.first, p.back().second};
        }
        else {
            p.push_back(cur);
        }
    }
    int i = 0; // point to cur element in a
    int j = 0; // point to element in p
    int cross = 0;
    while(k > 0 && j < p.size()) {
        cross = p[j].second;
        while(i < a.size() && a[i].first <= cross) {
            res += abs(a[i].second-a[i].first);
            i++;
        }
        j++;
        k--;
    }

    while(i < a.size()) {
        res += abs(a[i].second-a[i].first) + 2*abs(cross-a[i].first);
        i++;
    }

    cout << res+a.size() << endl;*/

    int k, n;
    cin >> k >> n;
    vector<int> a;
    vector<pair<ll, ll>> p;
    ll res = 0;
    for(int i = 0; i < n; i++) {
        char c1, c2;
        ll a1, a2;
        cin >> c1 >> a1 >> c2 >> a2;
        if(c1 == c2) {
            res += abs(a1-a2);
        }
        else {
            a.push_back(a1);
            a.push_back(a2);
            p.push_back({a1, a2});
        }
    }
    sort(a.begin(), a.end());
    if(k == 1) {
        int m = a.size()/2;
        for(auto i: p) {
            res += abs(a[m]-i.first) + abs(a[m]-i.second)+1;
        }
    }
    else {
        // dist from middle should be as small as possible
        ll l = 0, r = 0;
        for(int i = 0; i < n; i++) {
            r += a[i];
        }
        ll cur = r;
        for(int i = 0; i < n; i++) {
            r -= a[i];
            l += a[i];
            cur = min(cur, r-l);
        }
        res += cur;
    }

    cout << res << "\n";

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 580 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 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 0 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 0 ms 348 KB Output is correct
10 Correct 0 ms 496 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 12 ms 3016 KB Output is correct
13 Correct 25 ms 3260 KB Output is correct
14 Correct 18 ms 3016 KB Output is correct
15 Correct 14 ms 1996 KB Output is correct
16 Correct 14 ms 3156 KB Output is correct
17 Correct 16 ms 3012 KB Output is correct
18 Correct 21 ms 3016 KB Output is correct
19 Correct 23 ms 3016 KB Output is correct
20 Correct 16 ms 3272 KB Output is correct
21 Correct 21 ms 3088 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -