oj.uz

Submission #443683

# Submission time Handle Problem Language Result Execution time Memory
443683 2021-07-11T10:28:09 Z stat0r1c Palembang Bridges (APIO15_bridge) C++11
100 / 100
 82 ms 6252 KB 
#include <bits/stdc++.h>
/* #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> */
using namespace std;
// using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned ll;
template<typename T> using vt = vector<T>;
using vi = vt<int>;
using vvi = vt<vi>;
using ii = pair<int, int>;
using vii = vt<ii>;
/* template<typename T>
using indexed_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; */
/* struct chash {
    static ull hash_f(ull x) {x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31);}
    size_t operator()(ull x) const {static const ull RANDOM = chrono::steady_clock::now().time_since_epoch().count();return hash_f(x + RANDOM);}
};
struct iihash {
    template <class T1, class T2>
    size_t operator () (const pair<T1,T2> &p) const {auto h1 = hash<T1>{}(p.first);auto h2 = hash<T2>{}(p.second);return h1 ^ h2;}
};
template<class T1, class T2, class T3> using ii_umap = gp_hash_table<pair<T1,T2>,T3,iihash>;
template<class T1, class T2> using f_umap = gp_hash_table<T1,T2,chash>;
template<class T1, class T2> using o_umap = gp_hash_table<T1,T2>; */
#define sqr(x) (x)*(x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << " -> " << x << '\n'
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int inf = 1e9 + 7;
const ll infll = 1e18 + 10;
template <typename T> inline T fgcd(T a, T b) {while(b) swap(b, a %= b); return a;}
ll fpow(ll a, ll b) {ll o = 1; for(;b;b >>= 1) {if(b & 1) o = o * a;a = a * a;} return o;}
ll fpow(ll a, ll b, ll m) {ll o = 1; a %= m; for(;b;b >>= 1) {if(b & 1) o = o * a % m;a = a * a % m;} return o;}
template<class T> void uniq(vt<T> &a) {sort(all(a));a.resize(unique(all(a)) - a.begin());}
void setIO(string name = "", string inp = "inp", string out = "out") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(name)) {
        if(sz(inp)) freopen((name+"."+inp).c_str(), "r", stdin);
        if(sz(out)) freopen((name+"."+out).c_str(), "w", stdout);
    }
}
ll sul,sur,n,k,l,r,ans;
vt<pair<ll, ll>> a;
priority_queue<ll> pql,ltemp;
priority_queue<ll, vt<ll>, greater<ll>> pqr,rtemp;
vt<ll> b;
char x,y;
void clear() {
    pql = ltemp;
    pqr = rtemp;
    sul = sur = 0;
}
void add(ll u) {
    if(pql.empty() || u <= pql.top()) {
        sul += u;
        pql.push(u);
    }
    else {
        pqr.push(u);
        sur += u;
    }
    while(sz(pql) != sz(pqr) && sz(pql) - sz(pqr) != 1) {
        if(sz(pql) > sz(pqr)) {
            sul -= pql.top();
            sur += pql.top();
            pqr.push(pql.top());
            pql.pop();
        }
        else {
            sul += pqr.top();
            sur -= pqr.top();
            pql.push(pqr.top());
            pqr.pop();
        }
    }
}
ll get() {
    ll e = pql.top();
    return e * sz(pql) - sul + sur - e * sz(pqr);
}
int main() {
    setIO();
    cin >> k >> n;
    for(int i = 0; i < n; i++) {
        cin >> x >> l >> y >> r;
        if(x == y) ans += abs(r - l);
        else {
            a.eb(l,r);
            if(k == 1) {
                b.pb(l);
                b.pb(r);
            }
        }
    }
    if(k == 1) {
        if(!b.empty()) {
            sort(all(b));
            l = b[(sz(b) - 1) / 2];
            for(auto i : a) {
                ans += abs(i.F - l) + abs(i.S - l) + 1;
            }
        }
        cout << ans;
    }
    else {
        if(a.empty()) {
            cout << ans;
            return 0;
        }
        sort(all(a), [&](const ii &p, const ii &q) {return p.F + p.S < q.F + q.S;});
        b.resize(sz(a));
        for(int i = 0; i < sz(a); i++) {
            add(a[i].F);
            add(a[i].S);
            b[i] = get();
        }
        clear();
        for(int i = sz(a) - 1; i; i--) {
            add(a[i].F);
            add(a[i].S);
            b[i - 1] += get();
        }
        cout << ans + *min_element(all(b)) + sz(a);
    }
    return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 26 ms 3636 KB Output is correct
13 Correct 48 ms 3620 KB Output is correct
14 Correct 36 ms 3512 KB Output is correct
15 Correct 28 ms 2308 KB Output is correct
16 Correct 34 ms 3660 KB Output is correct
17 Correct 36 ms 3756 KB Output is correct
18 Correct 43 ms 3620 KB Output is correct
19 Correct 48 ms 3572 KB Output is correct
20 Correct 34 ms 3636 KB Output is correct
21 Correct 43 ms 3596 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
6 Correct 1 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 308 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 308 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 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 1 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 376 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 344 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 204 KB Output is correct
8 Correct 1 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 1 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 1 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 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 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 38 ms 5852 KB Output is correct
26 Correct 59 ms 5944 KB Output is correct
27 Correct 75 ms 5808 KB Output is correct
28 Correct 78 ms 5932 KB Output is correct
29 Correct 82 ms 5348 KB Output is correct
30 Correct 40 ms 3192 KB Output is correct
31 Correct 48 ms 5356 KB Output is correct
32 Correct 59 ms 5820 KB Output is correct
33 Correct 60 ms 6252 KB Output is correct
34 Correct 64 ms 5816 KB Output is correct
35 Correct 46 ms 5772 KB Output is correct
36 Correct 64 ms 5788 KB Output is correct
37 Correct 34 ms 5860 KB Output is correct