답안 #489960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489960	2021-11-25T05:46:03 Z	JerryLiu06	Palembang Bridges (APIO15_bridge)	C++17	100 / 100	67 ms	6924 KB

bridge

// https://oj.uz/problem/view/APIO15_bridge
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 5e4 + 10;
const ll INF = 1e18;
 
int K, N; vector<array<int, 2>> ed; vl ansPref, ansSuff; 
 
vl genAns() {
    vl res; res.pb(0);
 
    priority_queue<int> L;
    priority_queue<int, vi, greater<int>> R; // R contains the median
    
    while (sz(L)) L.pop();
    while (sz(R)) R.pop();
 
    ll lsum = 0, rsum = 0;
 
    int curMedian = 0;
 
    F0R(i, sz(ed)) {
        EACH(C, ed[i]) {
            if (C >= curMedian) {
                R.push(C); rsum += C;
            }
            else {
                L.push(C); lsum += C;
            }
        }
        if (sz(R) > sz(L)) {
            L.push(R.top()); lsum += R.top();
 
            rsum -= R.top(); R.pop();
 
            curMedian = R.top();
        }
        if (sz(L) > sz(R)) {
            R.push(L.top()); rsum += L.top();
 
            lsum -= L.top(); L.pop();
 
            curMedian = R.top();
        }
        res.pb(rsum - lsum);
    }
    return res;
}
 
int main() {
    FASTIO; 
 
    cin >> K >> N; 
 
    ll ans = 0;
 
    FOR(i, 1, N + 1) {
        char C1, C2; int A, B;
 
        cin >> C1 >> A >> C2 >> B;
 
        if (C1 == C2) {
            ans += abs(B - A);
        }
        else {
            ed.pb({A, B});
        }
    }
    sort(all(ed), [&](array<int, 2> a, array<int, 2> b) { return a[0] + a[1] < b[0] + b[1]; });
 
    ansPref = genAns();
 
    reverse(all(ed));
 
    ansSuff = genAns();
    
    if (K == 1) {
        return cout << ans + ansPref[sz(ed)] + sz(ed) << "\n", 0;
    }
    ll res = INF;
 
    F0R(i, sz(ed) + 1) {
        ckmin(res, ans + ansPref[i] + ansSuff[sz(ed) - i] + sz(ed));
    }
    cout << res;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	1 ms	332 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

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	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	29 ms	5124 KB	Output is correct
13	Correct	60 ms	6416 KB	Output is correct
14	Correct	44 ms	5372 KB	Output is correct
15	Correct	34 ms	3728 KB	Output is correct
16	Correct	30 ms	5820 KB	Output is correct
17	Correct	46 ms	6924 KB	Output is correct
18	Correct	32 ms	6472 KB	Output is correct
19	Correct	54 ms	6900 KB	Output is correct
20	Correct	39 ms	6452 KB	Output is correct
21	Correct	55 ms	6632 KB	Output is correct

Subtask #3
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 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	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	316 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 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	0 ms	332 KB	Output is correct
17	Correct	0 ms	316 KB	Output is correct
18	Correct	1 ms	320 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

Subtask #5
37.0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 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	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 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	0 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	324 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	28 ms	5056 KB	Output is correct
26	Correct	39 ms	5420 KB	Output is correct
27	Correct	53 ms	6172 KB	Output is correct
28	Correct	67 ms	6680 KB	Output is correct
29	Correct	54 ms	6596 KB	Output is correct
30	Correct	28 ms	3680 KB	Output is correct
31	Correct	35 ms	5860 KB	Output is correct
32	Correct	49 ms	6820 KB	Output is correct
33	Correct	42 ms	6084 KB	Output is correct
34	Correct	53 ms	6876 KB	Output is correct
35	Correct	38 ms	6456 KB	Output is correct
36	Correct	63 ms	6620 KB	Output is correct
37	Correct	25 ms	5304 KB	Output is correct

답안 #489960

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 14.0 / 14.0

Subtask #3 9.0 / 9.0

Subtask #4 32.0 / 32.0

Subtask #5 37.0 / 37.0

Subtask #1
8.0 / 8.0

Subtask #2
14.0 / 14.0

Subtask #3
9.0 / 9.0

Subtask #4
32.0 / 32.0

Subtask #5
37.0 / 37.0