oj.uz

Submission #443050

# Submission time Handle Problem Language Result Execution time Memory
443050 2021-07-09T14:18:57 Z 233 Palembang Bridges (APIO15_bridge) C++11
100 / 100
 101 ms 5696 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

bool cmp(pair<int, int> a, pair<int, int> b) { return a.first + a.second < b.first + b.second; }

priority_queue<int> lpq;
priority_queue<int, vector<int>, greater<int>> rpq;
ll lsum, rsum;

void insert(int x) {
    int median = (lpq.size() ? lpq.top() : 1000000001);
    if (x <= median) {
        lpq.push(x);
        lsum += x;
    } else {
        rpq.push(x);
        rsum += x;
    }
    
    if (rpq.size() + 1 < lpq.size()) {
        int nxt = lpq.top();
        lpq.pop();
        rpq.push(nxt);
        lsum -= nxt;
        rsum += nxt;
    } else if (lpq.size() < rpq.size()) {
        int nxt = rpq.top();
        rpq.pop();
        lpq.push(nxt);
        rsum -= nxt;
        lsum += nxt;
    }
}

ll pref[100001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int k, n;
    ll same_side = 0;
    vector<pair<int, int>> v = {{0, 0}};
    cin >> k >> n;
    FOR(i, 0, n) {
        char a, b;
        int x, y;
        cin >> a >> x >> b >> y;
        if (a == b) same_side += abs(x - y);
        else v.push_back({x, y});
    }
    sort(v.begin(), v.end(), cmp);
    n = v.size() - 1;
    same_side += n;
    
    lsum = rsum = 0;
    FOR(i, 1, n + 1) {
        insert(v[i].first);
        insert(v[i].second);
        pref[i] = rsum - lsum;
    }
    
    ll ans = pref[n];
    
    if (k == 2) {
        while (lpq.size()) lpq.pop();
        while (rpq.size()) rpq.pop();
        lsum = rsum = 0;
        
        for (int i = n; i; i--) {
            insert(v[i].first);
            insert(v[i].second);
            ans = min(ans, rsum - lsum + pref[i - 1]);
        }
    }
    cout << same_side + ans;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 33 ms 3808 KB Output is correct
13 Correct 63 ms 5476 KB Output is correct
14 Correct 49 ms 4556 KB Output is correct
15 Correct 38 ms 3560 KB Output is correct
16 Correct 44 ms 4860 KB Output is correct
17 Correct 52 ms 5440 KB Output is correct
18 Correct 49 ms 5444 KB Output is correct
19 Correct 56 ms 5352 KB Output is correct
20 Correct 42 ms 5296 KB Output is correct
21 Correct 55 ms 5180 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 356 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 49 ms 3828 KB Output is correct
26 Correct 76 ms 4492 KB Output is correct
27 Correct 99 ms 5048 KB Output is correct
28 Correct 101 ms 5696 KB Output is correct
29 Correct 101 ms 5404 KB Output is correct
30 Correct 54 ms 3012 KB Output is correct
31 Correct 54 ms 4672 KB Output is correct
32 Correct 81 ms 5364 KB Output is correct
33 Correct 79 ms 5048 KB Output is correct
34 Correct 83 ms 5448 KB Output is correct
35 Correct 58 ms 5308 KB Output is correct
36 Correct 79 ms 5184 KB Output is correct
37 Correct 42 ms 3912 KB Output is correct