oj.uz

Submission #1017793

# Submission time Handle Problem Language Result Execution time Memory
1017793 2024-07-09T10:15:24 Z aufan Palembang Bridges (APIO15_bridge) C++17
22 / 100
 32 ms 6452 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

const int inff = 1e18;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int k, n;
        cin >> k >> n;

        int ans = 0;
        vector<int> a, b;
        for (int i = 0; i < n; i++) {
                char p, q;
                int s, t;
                cin >> p >> s >> q >> t;

                if (p == q) {
                        ans += abs(s - t);
                } else {
                        if (s > t) swap(s, t);
                        a.push_back(s);
                        b.push_back(t);
                }
        }

        if (k == 1) {
                int m = (int)a.size();
                vector<int> c;
                for (int i = 0; i < m; i++) {
                        c.push_back(a[i]);
                        c.push_back(b[i]);
                }
                sort(c.begin(), c.end());
                
                ans += m;
                for (int i = 0; i < 2 * m; i++) {
                        ans += abs(c[i] - c[m]);
                }

                cout << ans << '\n';
        } else if (k == 2) {
                int m = (int)a.size(), sl = 0, sr = 0;
                vector<int> pref(m);
                priority_queue<int> le;
                priority_queue<int, vector<int>, greater<int>> ri;
                for (int i = 0; i < m; i++) {
                        sl += a[i];
                        le.push(a[i]);
                        sr += b[i];
                        ri.push(b[i]);
                        while (le.top() > ri.top()) {
                                sr += le.top();
                                ri.push(le.top());
                                sl += ri.top();
                                le.push(ri.top());
                                sr -= ri.top();
                                ri.pop();
                                sl -= le.top();
                                le.pop();
                        }

                        pref[i] = ((i + 1) * le.top() - sl) + (sr - (i + 1) * le.top());
                }

                sl = sr = 0;
                while (!le.empty()) le.pop();
                while (!ri.empty()) ri.pop();
                vector<int> suf(m);
                for (int i = m - 1; i >= 0; i--) {
                        sl += a[i];
                        le.push(a[i]);
                        sr += b[i];
                        ri.push(b[i]);
                        while (le.top() > ri.top()) {
                                sr += le.top();
                                ri.push(le.top());
                                sl += ri.top();
                                le.push(ri.top());
                                sr -= ri.top();
                                ri.pop();
                                sl -= le.top();
                                le.pop();
                        }

                        suf[i] = ((m - i) * le.top() - sl) + (sr - (m - i) * le.top());
                }

                int mn = inff;
                ans += m;
                for (int i = 0; i < m - 1; i++) mn = min(mn, pref[i] + suf[i + 1]);
                if (m == 0) mn = 0;     
                ans += mn;

                cout << ans << '\n';
        }
        
        return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 404 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 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 1 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 496 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 348 KB Output is correct
12 Correct 15 ms 4836 KB Output is correct
13 Correct 31 ms 6212 KB Output is correct
14 Correct 22 ms 5192 KB Output is correct
15 Correct 18 ms 3664 KB Output is correct
16 Correct 25 ms 5704 KB Output is correct
17 Correct 26 ms 6200 KB Output is correct
18 Correct 23 ms 5960 KB Output is correct
19 Correct 29 ms 6452 KB Output is correct
20 Correct 19 ms 5960 KB Output is correct
21 Correct 32 ms 6084 KB Output is correct

Subtask #3
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 Incorrect 1 ms 452 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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

# 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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -