oj.uz

답안 #1114365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114365 2024-11-18T16:59:58 Z ShaShi Palembang Bridges (APIO15_bridge) C++17
22 / 100
 133 ms 66648 KB 
#include <bits/stdc++.h>
 
#define int long long 
 
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
 
#define F first 
#define S second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) cout << x << "\n", exit(0);
#define pii pair<int, int>
#define pll pair<long long, long long>
#define endl "\n"
 
 
 
using namespace std;
typedef long long ll;
// typedef __int128_t lll;
typedef long double ld;
 
 
const int MAXN = (int)1e6 + 7;
const int MOD = 998244353;
const ll INF = (ll)1e18 + 7;
 
 
int n, m, k, tmp, t, tmp2, tmp3, tmp4, u, v, w, flag, q, ans, N, res, pre_ans;
pii arr[MAXN], di[MAXN];
char ch, ch2;
vector<int> vec[2][MAXN], cmp;
int ps[2][MAXN], cnt[2][MAXN];



inline int id(int n) { return lower_bound(all(cmp), n)-cmp.begin(); }


vector<pii> _vec;
map<int, int> _cnt;

inline int solve1() {
    for (int i=1; i<=n; i++) {
        u = arr[i].F; v = arr[i].S;

        _cnt[u]++, _cnt[v]++, _vec.pb({u, v}), tmp2 += 2;
    }

    int res2 = 0;
 
    for (auto cur: _cnt) {
        tmp += cur.S;
 
        // cout << cur.F << " " << cur.S << endl;
 
        if (tmp+tmp >= tmp2) {
            tmp = cur.F;
            break;
        }
    }
 
    for (auto cur:_cnt) res2 += abs(cur.F-tmp)*cur.S;

    tmp = tmp2 = 0;
 
    return res2+_vec.size();
}


/* Segment Tree */
#define mid ((l+r)>>1)
#define lid (id<<1)
#define rid (lid|1)


struct D {
    int sigmaL, sigmaR, cnt;

    D () {}
} seg[MAXN<<2], emp;


inline D merge(D x, D y) {
    D res;

    res.sigmaL = x.sigmaL+y.sigmaL;
    res.sigmaR = x.sigmaR+y.sigmaR;
    res.cnt = x.cnt+y.cnt;

    return res;
}


void add(int s, int ind, int l=0, int r=N, int id=1) {
    if (id == 1) cout << "+ " << arr[ind].F << " " << arr[ind].S << " " << s << endl;

    if (l+1 == r) {
        seg[id].cnt++;
        seg[id].sigmaL += arr[ind].F;
        seg[id].sigmaR += arr[ind].S;

        return;
    }

    if (s < mid) add(s, ind, l, mid, lid);
    else add(s, ind, mid, r, rid);

    seg[id] = merge(seg[lid], seg[rid]);
}


void rem(int s, int ind, int l=0, int r=N, int id=1) {
    if (id == 1) cout << "- " << arr[ind].F << " " << arr[ind].S << endl;

    if (l+1 == r) {
        seg[id].cnt--;
        seg[id].sigmaL -= arr[ind].F;
        seg[id].sigmaR -= arr[ind].S;

        return;
    }

    if (s < mid) rem(s, ind, l, mid, lid);
    else rem(s, ind, mid, r, rid);

    seg[id] = merge(seg[lid], seg[rid]);
}


D get(int s, int t, int l=0, int r=N, int id=1) {
    if (s >= t) return emp;
    if (s <= l && t >= r) return seg[id];
    if (t <= mid) return get(s, t, l, mid, lid);
    if (s >= mid) return get(s, t, mid, r, rid);
    return merge(get(s, t, l, mid, lid), get(s, t, mid, r, rid));
}

/* Segment Tree */


inline int cost(int x, int y) {
    int res = ps[0][x] + ps[1][y];

    D cur;
    cur = get(0, id(cmp[x]+cmp[y])); res += cur.sigmaL - cmp[x]*cur.cnt;
    cur = get(id(cmp[x]+cmp[y]), N); res += cmp[y]*cur.cnt - cur.sigmaR;

    return res;
}


inline int delta(int x, int y) {
    return -cnt[0][y+1]+cnt[1][y]-cost(x, y)+cost(x, y+1);
}


int32_t main() {
    #ifdef LOCAL
    freopen("inp.in", "r", stdin);
    freopen("res.out", "w", stdout);
    #else
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif
 
    cin >> k >> n;

    N = 0;
 
    for (int i=1; i<=n; i++) {
        cin >> ch >> u >> ch2 >> v;
 
        if (ch == ch2) res += abs(u-v);
        else arr[++N] = {u, v};
    }

    n = N; pre_ans = res; res += solve1();

    if (k == 1) kill(res);

    for (int i=1; i<=n; i++) {
        u = arr[i].F; v = arr[i].S;
        if (u > v) swap(arr[i].F, arr[i].S);
        pre_ans += abs(arr[i].F-arr[i].S)+1;
        cmp.pb(u); cmp.pb(v); cmp.pb(u+v);
    }

    sort(all(cmp));
    cmp.resize(unique(all(cmp))-cmp.begin());
    N = cmp.size(); emp.sigmaL = emp.sigmaR = emp.cnt = 0;

    // cout << "@ " << endl;
    // for (int u:cmp) cout << u << " ";
    // cout << endl;


    for (int i=1; i<=n; i++) {
        u = di[i].F = id(arr[i].F);
        v = di[i].S = id(arr[i].S);

        cnt[0][u]++; cnt[1][v]++;
        vec[0][u].pb(i); vec[1][v].pb(i);
    }

    
    tmp = tmp2 = 0;
    
    for (int i=0; i<N; i++) {
        ps[0][i] = cmp[i]*tmp2-tmp;

        for (int ind:vec[1][i]) {
            tmp2++;
            tmp += arr[ind].S;
        }
    }


    tmp = tmp2 = 0;
    
    for (int i=N-1; i>=0; i--) {
        ps[1][i] = tmp-cmp[i]*tmp2;

        for (int ind:vec[0][i]) {
            tmp2++;
            tmp += arr[ind].F;
        }
    }

    // for (int i=1; i<=n; i++) add(id(arr[i].F+arr[i].S), i);

    ans = INF;
    int j = 1;

    for (int i=0; i<N; i++) {
        for (auto ind:vec[0][j]) {
            if (di[ind].S >= j) continue;

            rem(id(arr[ind].F+arr[ind].S), ind);
        }

        while (j+1 < N && (j <= i || delta(i, j) <= 0)) {
            for (auto ind:vec[1][j]) {
                if (di[ind].F <= i) continue;

                add(id(arr[ind].F+arr[ind].S), ind);
            }

            j++;
        }

        // cout << "! " << i << " " << j << " " << pre_ans+2*cost(i, j) << endl;

        ans = min(ans, pre_ans+2*cost(i, j));
    }

    // for (int i=0; i<N; i++) {
    //     vector<int> temp;

    //     for (int j=i+1; j<N; j++) {
    //         // cout << "! " << i << " " << j << " : " << cmp[i] << " " << cmp[j] << " : " << cost(i, j) << " " << pre_ans+2*cost(i, j) << endl;


    //         ans = min(ans, pre_ans+2*cost(i, j));

    //         for (auto ind:vec[1][j]) {
    //             if (di[ind].F <= i) continue;

    //             temp.pb(ind); add(id(arr[ind].F+arr[ind].S), ind);
    //         }
    //     }

    //     for (auto ind:temp) rem(id(arr[ind].F+arr[ind].S), ind);
    // }

    // cout << ans << " " << res << endl;
    cout << min(ans, res) << endl;
    
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 49232 KB Output is correct
2 Correct 24 ms 49232 KB Output is correct
3 Correct 24 ms 49232 KB Output is correct
4 Correct 27 ms 49488 KB Output is correct
5 Correct 26 ms 49480 KB Output is correct
6 Correct 28 ms 49232 KB Output is correct
7 Correct 21 ms 49364 KB Output is correct
8 Correct 21 ms 49488 KB Output is correct
9 Correct 23 ms 49488 KB Output is correct
10 Correct 25 ms 49232 KB Output is correct
11 Correct 28 ms 49488 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 49232 KB Output is correct
2 Correct 25 ms 49288 KB Output is correct
3 Correct 33 ms 47432 KB Output is correct
4 Correct 35 ms 47432 KB Output is correct
5 Correct 33 ms 47540 KB Output is correct
6 Correct 44 ms 47432 KB Output is correct
7 Correct 32 ms 47440 KB Output is correct
8 Correct 39 ms 47432 KB Output is correct
9 Correct 35 ms 47436 KB Output is correct
10 Correct 31 ms 47432 KB Output is correct
11 Correct 32 ms 47432 KB Output is correct
12 Correct 48 ms 51816 KB Output is correct
13 Correct 133 ms 64572 KB Output is correct
14 Correct 58 ms 52668 KB Output is correct
15 Correct 79 ms 59908 KB Output is correct
16 Correct 47 ms 53996 KB Output is correct
17 Correct 85 ms 66620 KB Output is correct
18 Correct 97 ms 66176 KB Output is correct
19 Correct 116 ms 66648 KB Output is correct
20 Correct 44 ms 54932 KB Output is correct
21 Correct 94 ms 66164 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 49232 KB Output is correct
2 Correct 29 ms 49236 KB Output is correct
3 Correct 27 ms 49344 KB Output is correct
4 Incorrect 25 ms 49444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 49232 KB Output is correct
2 Correct 41 ms 49232 KB Output is correct
3 Correct 26 ms 49232 KB Output is correct
4 Incorrect 29 ms 49352 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 49164 KB Output is correct
2 Correct 24 ms 49288 KB Output is correct
3 Correct 33 ms 49232 KB Output is correct
4 Incorrect 34 ms 49224 KB Output isn't correct
5 Halted 0 ms 0 KB -