oj.uz

답안 #1054300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054300 2024-08-12T08:30:45 Z Harold Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 348 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;
        ll cur = 0;
        for(auto i: p) {
            cur += abs(i.second-i.first)+1 + 2*max(a[m]-i.second, (ll)0) + 2*max(i.first-a[m], (ll)0);
        }
        if(m-1 >= 0) {
            ll cur2 = 0;
            for(auto i: p) {
                cur2 += abs(i.second-i.first)+1 + 2*max(a[m-1]-i.second, (ll)0) + 2*max(i.first-a[m-1], (ll)0);
            }
            cur = min(cur, cur2);
        }
        res += cur;
    }

    cout << res << "\n";

    return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -