oj.uz

답안 #1089087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089087 2024-09-16T01:48:30 Z kh0i Palembang Bridges (APIO15_bridge) C++17
22 / 100
 31 ms 5076 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif

using ll = long long;
using pii = pair<int, int>;

#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
    assert(l <= r);
    return uniform_int_distribution<ll> (l, r)(rng);
}

int k, n;
vector<pair<ll, ll>> a;
ll res;

namespace Sub1{
    void solve(){
        vector<ll> x;
        for(auto [s, t] : a){
            x.push_back(s);
            x.push_back(t);
        }
        sort(all(x));

        ll pos = x[sz(x) / 2];
        for(ll k : x)
            res += abs(k - pos);

        cout << res + sz(a);
    }
}

struct SlidingMedian{
    multiset<ll> fi, se;
    ll sum_fi = 0, sum_se = 0;

    void add(ll x){
        se.insert(x);
        sum_se += x;
        while(sz(fi) < sz(se)){
            ll d = *se.begin();
            sum_se -= d;
            sum_fi += d;
            fi.insert(d);
            se.erase(se.find(d));
        }
    }

    ll get_sum(){
        ll med = *fi.rbegin();
        return (1ll * sz(fi) * med - sum_fi) + (sum_se - 1ll * sz(se) * med);
    }

    void reset(){
        fi.clear();
        se.clear();
        sum_fi = sum_se = 0;
    }
};

namespace Sub2{
    void solve(){
        sort(all(a), [](pair<ll, ll> &f, pair<ll, ll> &g) -> bool{
            return f.F + f.S < g.F + g.S;
        });

        vector<ll> pre(sz(a)), suf(sz(a));
        SlidingMedian st;
        for(int i = 0; i < sz(a); ++i){
            st.add(a[i].F);
            st.add(a[i].S);
            pre[i] = st.get_sum();
        }
        st.reset();
        for(int i = sz(a) - 1; i >= 0; --i){
            st.add(a[i].F);
            st.add(a[i].S);
            suf[i] = st.get_sum();
        }

        ll mn = suf[0];
        for(int i = 0; i < sz(a) - 1; ++i)
            mn = min(mn, pre[i] + suf[i + 1]);

        cout << res + mn + sz(a);
    }
}

void solve(){
    cin >> k >> n;
    for(int i = 1; i <= n; ++i){
        char p, q;
        int s, t;
        cin >> p >> s >> q >> t;
        if(p == q)
            res += abs(s - t);
        else{
            if(s > t)
                swap(s, t);
            a.push_back({s, t});
        }
    }

    if(k == 1)
        Sub1::solve();
    else
        Sub2::solve();
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    #define task "troll"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int test = 1;
//    cin >> test;
    for(int i = 1; i <= test; ++i){
//        cout << "Case #" << i << ": ";
        solve();
    }
    #ifdef LOCAL
        cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    #endif
    return 0;
}

Compilation message

bridge.cpp: In function 'int32_t main()':
bridge.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:127:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 16 ms 5076 KB Output is correct
13 Correct 31 ms 5076 KB Output is correct
14 Correct 23 ms 4860 KB Output is correct
15 Correct 18 ms 2776 KB Output is correct
16 Correct 24 ms 5004 KB Output is correct
17 Correct 22 ms 5064 KB Output is correct
18 Correct 23 ms 5076 KB Output is correct
19 Correct 29 ms 5076 KB Output is correct
20 Correct 20 ms 5076 KB Output is correct
21 Correct 26 ms 4872 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -