oj.uz

답안 #284712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284712 2020-08-27T22:31:19 Z doowey Palembang Bridges (APIO15_bridge) C++14
100 / 100
 951 ms 40316 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);


// why would anyone write this
const int N = (int)1e5 + 10;
const int M = N * 2;

vector<int> uni;
int id(int x){
    return lower_bound(uni.begin(), uni.end(), x) - uni.begin();
}

ll pf[N];
ll suf[N];

struct Node{
    ll sum;
    ll cnt;
};

struct SegTree{
    Node T[M * 4 + 512];
    void init(){
        for(int i = 0 ;i < M * 4 + 512; i ++ )
            T[i] = {0, 0};
    }
    void upd(int node, int cl, int cr, int pos, int v){
        if(cl == cr){
            T[node].sum += v;
            T[node].cnt ++ ;
            return;
        }
        int mid = (cl + cr) / 2;
        if(mid >= pos)
            upd(node * 2, cl, mid, pos, v);
        else
            upd(node * 2 + 1, mid + 1, cr, pos, v);
        T[node].sum = T[node * 2].sum + T[node * 2 + 1].sum;
        T[node].cnt = T[node * 2].cnt + T[node * 2 + 1].cnt;
    }

    Node get(int node, int cl, int cr, int tl, int tr){
        if(cr < tl || cl > tr)
            return {0,0};
        if(cl >= tl && cr <= tr){
            return T[node];
        }
        int mid = (cl + cr) / 2;
        Node lef = get(node * 2, cl, mid, tl, tr);
        Node rig = get(node * 2 + 1, mid + 1, cr, tl, tr);
        lef.sum += rig.sum;
        lef.cnt += rig.cnt;
        return lef;
    }
};

SegTree up, down;
multiset<int> low, high;

bool comp(pii a, pii b){
    return a.fi + a.se < b.fi + b.se;
}

int main(){
    fastIO;
    int k, n;
    cin >> k >> n;
    vector<pii> posi;
    char a1, a2;
    int f1, f2;
    ll total = 0;
    for(int i = 1; i <= n; i ++ ){
        cin >> a1 >> f1 >> a2 >> f2;
        if(a1 == a2){
            total += abs(f2-f1);
        }
        else{
            total ++ ;
            if(a1 == 'B'){
                swap(f1, f2);
            }
            posi.push_back(mp(f1, f2));
            uni.push_back(f1);
            uni.push_back(f2);
        }
    }
    sort(uni.begin(), uni.end());
    uni.resize(unique(uni.begin(), uni.end()) - uni.begin());
    sort(posi.begin(), posi.end(), comp);
    int sz = uni.size();
    int fe, fp;
    int med;
    ll dist;
    for(int i = 0 ; i < posi.size(); i ++ ){
        low.insert(posi[i].fi);
        high.insert(posi[i].se);
        while(1){
            auto en = low.end();
            en -- ;
            auto pv = high.begin();
            fe = *en;
            fp = *pv;
            if(fe > fp){
                low.erase(en);
                high.erase(pv);
                low.insert(fp);
                high.insert(fe);
            }
            else{
                break;
            }
        }
        up.upd(1, 0, sz - 1, id(posi[i].fi), posi[i].fi);
        down.upd(1, 0, sz - 1, id(posi[i].se), posi[i].se);
        auto it = low.end();
        -- it;
        med = *it;
        dist = 0;
        Node lf = up.get(1, 0, sz - 1, 0, id(med)-1);
        Node rf = up.get(1, 0, sz - 1, id(med)+1, sz - 1);
        dist += med * 1ll * lf.cnt - lf.sum;
        dist += rf.sum - med * 1ll * rf.cnt;
        lf = down.get(1, 0, sz - 1, 0, id(med)-1);
        rf = down.get(1, 0, sz - 1, id(med)+1, sz - 1);
        dist += med * 1ll * lf.cnt - lf.sum;
        dist += rf.sum - med * 1ll * rf.cnt;
        pf[i + 1] = dist;
    }
    up.init();
    down.init();
    low.clear();
    high.clear();
    for(int i = posi.size() - 1;i >= 0 ; i -- ){
        low.insert(posi[i].fi);
        high.insert(posi[i].se);
        while(1){
            auto en = low.end();
            en -- ;
            auto pv = high.begin();
            fe = *en;
            fp = *pv;
            if(fe > fp){
                low.erase(en);
                high.erase(pv);
                low.insert(fp);
                high.insert(fe);
            }
            else{
                break;
            }
        }
        up.upd(1, 0, sz - 1, id(posi[i].fi), posi[i].fi);
        down.upd(1, 0, sz - 1, id(posi[i].se), posi[i].se);
        auto it = low.end();
        -- it;
        med = *it;
        dist = 0;
        Node lf = up.get(1, 0, sz - 1, 0, id(med)-1);
        Node rf = up.get(1, 0, sz - 1, id(med)+1, sz - 1);
        dist += med * 1ll * lf.cnt - lf.sum;
        dist += rf.sum - med * 1ll * rf.cnt;
        lf = down.get(1, 0, sz - 1, 0, id(med)-1);
        rf = down.get(1, 0, sz - 1, id(med)+1, sz - 1);
        dist += med * 1ll * lf.cnt - lf.sum;
        dist += rf.sum - med * 1ll * rf.cnt;
        suf[i + 1] = dist;
    }
    if(k == 1){
        cout << total+pf[(int)posi.size()] << "\n";
    }
    else{
        ll ans = (ll)1e14;
        for(int i = 0 ; i <= posi.size(); i ++ )
            ans = min(ans, pf[i] + suf[i + 1]);
        cout << total+ans << "\n";
    }
    return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:104:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for(int i = 0 ; i < posi.size(); i ++ ){
      |                     ~~^~~~~~~~~~~~~
bridge.cpp:183:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  183 |         for(int i = 0 ; i <= posi.size(); i ++ )
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 25344 KB Output is correct
2 Correct 15 ms 25344 KB Output is correct
3 Correct 16 ms 25472 KB Output is correct
4 Correct 18 ms 25472 KB Output is correct
5 Correct 20 ms 25556 KB Output is correct
6 Correct 16 ms 25472 KB Output is correct
7 Correct 22 ms 25472 KB Output is correct
8 Correct 18 ms 25600 KB Output is correct
9 Correct 19 ms 25472 KB Output is correct
10 Correct 16 ms 25472 KB Output is correct
11 Correct 18 ms 25472 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25344 KB Output is correct
2 Correct 15 ms 25472 KB Output is correct
3 Correct 18 ms 25472 KB Output is correct
4 Correct 18 ms 25472 KB Output is correct
5 Correct 18 ms 25472 KB Output is correct
6 Correct 16 ms 25600 KB Output is correct
7 Correct 17 ms 25472 KB Output is correct
8 Correct 17 ms 25472 KB Output is correct
9 Correct 18 ms 25472 KB Output is correct
10 Correct 16 ms 25472 KB Output is correct
11 Correct 18 ms 25472 KB Output is correct
12 Correct 180 ms 37864 KB Output is correct
13 Correct 917 ms 37984 KB Output is correct
14 Correct 558 ms 36708 KB Output is correct
15 Correct 430 ms 32748 KB Output is correct
16 Correct 192 ms 38080 KB Output is correct
17 Correct 500 ms 37988 KB Output is correct
18 Correct 391 ms 38112 KB Output is correct
19 Correct 500 ms 37988 KB Output is correct
20 Correct 197 ms 38008 KB Output is correct
21 Correct 510 ms 37988 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25344 KB Output is correct
2 Correct 15 ms 25344 KB Output is correct
3 Correct 15 ms 25472 KB Output is correct
4 Correct 15 ms 25472 KB Output is correct
5 Correct 15 ms 25472 KB Output is correct
6 Correct 15 ms 25472 KB Output is correct
7 Correct 15 ms 25472 KB Output is correct
8 Correct 15 ms 25472 KB Output is correct
9 Correct 15 ms 25472 KB Output is correct
10 Correct 15 ms 25472 KB Output is correct
11 Correct 17 ms 25472 KB Output is correct
12 Correct 15 ms 25472 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25344 KB Output is correct
2 Correct 15 ms 25344 KB Output is correct
3 Correct 15 ms 25472 KB Output is correct
4 Correct 17 ms 25472 KB Output is correct
5 Correct 15 ms 25472 KB Output is correct
6 Correct 15 ms 25344 KB Output is correct
7 Correct 15 ms 25472 KB Output is correct
8 Correct 17 ms 25504 KB Output is correct
9 Correct 15 ms 25376 KB Output is correct
10 Correct 15 ms 25472 KB Output is correct
11 Correct 15 ms 25472 KB Output is correct
12 Correct 16 ms 25472 KB Output is correct
13 Correct 16 ms 25472 KB Output is correct
14 Correct 17 ms 25600 KB Output is correct
15 Correct 19 ms 25600 KB Output is correct
16 Correct 15 ms 25472 KB Output is correct
17 Correct 16 ms 25472 KB Output is correct
18 Correct 16 ms 25472 KB Output is correct
19 Correct 18 ms 25472 KB Output is correct
20 Correct 19 ms 25472 KB Output is correct
21 Correct 17 ms 25472 KB Output is correct
22 Correct 18 ms 25472 KB Output is correct
23 Correct 16 ms 25472 KB Output is correct
24 Correct 18 ms 25472 KB Output is correct

Subtask #5
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25344 KB Output is correct
2 Correct 15 ms 25344 KB Output is correct
3 Correct 15 ms 25472 KB Output is correct
4 Correct 15 ms 25472 KB Output is correct
5 Correct 15 ms 25472 KB Output is correct
6 Correct 16 ms 25344 KB Output is correct
7 Correct 15 ms 25472 KB Output is correct
8 Correct 16 ms 25600 KB Output is correct
9 Correct 15 ms 25472 KB Output is correct
10 Correct 15 ms 25472 KB Output is correct
11 Correct 15 ms 25472 KB Output is correct
12 Correct 15 ms 25472 KB Output is correct
13 Correct 16 ms 25472 KB Output is correct
14 Correct 17 ms 25472 KB Output is correct
15 Correct 18 ms 25472 KB Output is correct
16 Correct 16 ms 25472 KB Output is correct
17 Correct 16 ms 25472 KB Output is correct
18 Correct 16 ms 25472 KB Output is correct
19 Correct 16 ms 25472 KB Output is correct
20 Correct 18 ms 25472 KB Output is correct
21 Correct 17 ms 25472 KB Output is correct
22 Correct 18 ms 25472 KB Output is correct
23 Correct 16 ms 25472 KB Output is correct
24 Correct 18 ms 25472 KB Output is correct
25 Correct 178 ms 37880 KB Output is correct
26 Correct 363 ms 38888 KB Output is correct
27 Correct 853 ms 39652 KB Output is correct
28 Correct 858 ms 40292 KB Output is correct
29 Correct 951 ms 40288 KB Output is correct
30 Correct 414 ms 33260 KB Output is correct
31 Correct 185 ms 39652 KB Output is correct
32 Correct 509 ms 40316 KB Output is correct
33 Correct 353 ms 40040 KB Output is correct
34 Correct 501 ms 40292 KB Output is correct
35 Correct 196 ms 39808 KB Output is correct
36 Correct 512 ms 40096 KB Output is correct
37 Correct 163 ms 38880 KB Output is correct