oj.uz

Submission #562686

# Submission time Handle Problem Language Result Execution time Memory
562686 2022-05-15T02:36:36 Z Soul234 Palembang Bridges (APIO15_bridge) C++14
100 / 100
 93 ms 3528 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#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(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a = b, 1 : 0;
}

const int MOD = 1e9 + 7;
const int MX = 1e6+5;
int K, N;
ll pref[MX];
priority_queue<int> lo;
pqg<int> hi;
ll lsum = 0, rsum = 0;

void ins(int val) {
    int curmed = sz(lo) ? lo.top() : MOD;
    if(val <= curmed) {
        lo.push(val);
        lsum += val;
    }
    else {
        hi.push(val);
        rsum += val;
    }
    if(sz(hi)+1<sz(lo)) {
        int tmp = lo.top();
        lo.pop();
        hi.push(tmp);
        rsum += tmp;
        lsum -= tmp;
    }
    else if(sz(hi) > sz(lo)) {
        int tmp = hi.top();
        hi.pop();
        lo.push(tmp);
        rsum -= tmp;
        lsum += tmp;
    }
}

void solve() {
    cin>>K>>N;
    V<pi> v;
    v.pb({0,0});
    ll same = 0;
    FOR(i,1,N+1) {
        char a,b;
        int x,y;
        cin>>a>>x>>b>>y;
        if(a == b) { same += abs(x-y); }
        else v.pb({x,y});
    }
    sort(all(v), [&](const pi&a, const pi&b){ return a.first + a.second < b.first + b.second; });
    N = sz(v)-1;
    same += N;
    lsum = rsum = 0;
    FOR(i,1,N+1) {
        ins(v[i].first); ins(v[i].second);
        pref[i] = rsum - lsum;
    }
    ll ans = pref[N];
    if(K == 2) {
        while(sz(hi)) hi.pop();
        while(sz(lo)) lo.pop();
        lsum = rsum = 0;
        ROF(i,1,N+1) {
            ins(v[i].first); ins(v[i].second);
            ckmin(ans, rsum - lsum + pref[i-1]);
        }
    }
    cout << ans + same << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

bridge.cpp: In function 'void setIO(std::string)':
bridge.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 35 ms 3064 KB Output is correct
13 Correct 51 ms 3172 KB Output is correct
14 Correct 38 ms 3336 KB Output is correct
15 Correct 27 ms 2124 KB Output is correct
16 Correct 41 ms 3220 KB Output is correct
17 Correct 35 ms 3084 KB Output is correct
18 Correct 37 ms 3528 KB Output is correct
19 Correct 53 ms 3032 KB Output is correct
20 Correct 49 ms 3528 KB Output is correct
21 Correct 44 ms 3020 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 40 ms 3152 KB Output is correct
26 Correct 68 ms 3508 KB Output is correct
27 Correct 93 ms 3300 KB Output is correct
28 Correct 87 ms 3400 KB Output is correct
29 Correct 82 ms 3028 KB Output is correct
30 Correct 45 ms 1832 KB Output is correct
31 Correct 46 ms 3044 KB Output is correct
32 Correct 66 ms 3092 KB Output is correct
33 Correct 70 ms 3124 KB Output is correct
34 Correct 64 ms 3108 KB Output is correct
35 Correct 45 ms 3456 KB Output is correct
36 Correct 70 ms 3056 KB Output is correct
37 Correct 42 ms 3088 KB Output is correct