oj.uz

Submission #57005

# Submission time Handle Problem Language Result Execution time Memory
57005 2018-07-13T13:31:19 Z Benq Palembang Bridges (APIO15_bridge) C++14
100 / 100
 1075 ms 40564 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200005;

template<class T, int SZ> struct BIT {
    T bit[SZ+1];
    
    BIT() { memset(bit,0,sizeof bit); }
    
    void upd(int k, T val) { // add val to index k
        for( ;k <= SZ; k += (k&-k)) bit[k] += val;
    }
    
    T query(int k) {
        T temp = 0;
        for (;k > 0;k -= (k&-k)) temp += bit[k];
        return temp;
    }
    T query(int l, int r) { return query(r)-query(l-1); } // range query [l,r]
};

BIT<ll,MX> s[2];

int K,N;
ll ans = 0, mn = INF;
vpi v;
map<int,int> m;
vi rm;
pl cur;

pl operator+(const pl& l, const pl& r) { return {l.f+r.f,l.s+r.s}; }
pl operator-(const pl& l, const pl& r) { return {l.f-r.f,l.s-r.s}; }

ll eval(int x) {
    return s[1].query(x)*rm[x]+s[0].query(x);
}

void ad(int ind, int l, int r, int x) {
    s[ind].upd(l,x);
    s[ind].upd(r+1,-x);
}

void ins(int a, int b) {
    ad(1,1,m[a],-1);
    ad(0,1,m[a],a);
    ad(1,m[b],sz(m),1);
    ad(0,m[b],sz(m),-b);
}

ll pre(int x) {
    return cur.s*rm[x]-cur.f;
}

void compress() {
    int co = 0;
    
    rm.resize(sz(m)+1);
    rm.pb(-1);
    for (auto& a: m) {
        a.s = ++co;
        rm[co] = a.f;
    }
}

void getmn() {
    compress();
    
    sort(all(v),[](pi a, pi b){ return a.f+a.s < b.f+b.s; });
    int ind = sz(m);
    vl ans1(sz(v));
    F0Rd(i,sz(v)) {
        ins(v[i].f,v[i].s);
        while (ind > 1 && eval(ind-1) < eval(ind)) ind --;
        ans1[i] = eval(ind);
    }
    vl ans2(sz(v));
    s[0] = s[1] = BIT<ll,MX>();
    
    ind = 1;
    F0R(i,sz(v)) {
        ins(v[i].f,v[i].s);
        while (ind < sz(m) && eval(ind+1) < eval(ind)) ind ++;
        ans2[i] = eval(ind);
    }
    
    mn = ans1[0];
    if (K == 2) {
        F0R(i,sz(v)-1) mn = min(mn,ans1[i+1]+ans2[i]);
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> K >> N;
    m[0] = 0;
    F0R(i,N) {
        char a1, b1; int a2, b2; 
        cin >> a1 >> a2 >> b1 >> b2;
        ans += abs(a2-b2);
        if (a1 != b1) {
            v.pb({min(a2,b2),max(a2,b2)});
            ans ++;
            m[a2] = m[b2] = 0;
        }
    }
    if (sz(v) == 0) {
        cout << ans;
        exit(0);
    }
    getmn();
    cout << ans+2*mn;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3448 KB Output is correct
2 Correct 4 ms 3448 KB Output is correct
3 Correct 7 ms 5256 KB Output is correct
4 Correct 9 ms 5324 KB Output is correct
5 Correct 8 ms 5324 KB Output is correct
6 Correct 10 ms 5324 KB Output is correct
7 Correct 11 ms 5424 KB Output is correct
8 Correct 9 ms 5512 KB Output is correct
9 Correct 8 ms 5512 KB Output is correct
10 Correct 10 ms 5512 KB Output is correct
11 Correct 10 ms 5512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5512 KB Output is correct
2 Correct 5 ms 5512 KB Output is correct
3 Correct 7 ms 5512 KB Output is correct
4 Correct 10 ms 5512 KB Output is correct
5 Correct 12 ms 5516 KB Output is correct
6 Correct 9 ms 5540 KB Output is correct
7 Correct 9 ms 5688 KB Output is correct
8 Correct 8 ms 5688 KB Output is correct
9 Correct 9 ms 5688 KB Output is correct
10 Correct 9 ms 5688 KB Output is correct
11 Correct 11 ms 5688 KB Output is correct
12 Correct 120 ms 8344 KB Output is correct
13 Correct 658 ms 18572 KB Output is correct
14 Correct 297 ms 18572 KB Output is correct
15 Correct 512 ms 18572 KB Output is correct
16 Correct 139 ms 18572 KB Output is correct
17 Correct 313 ms 18572 KB Output is correct
18 Correct 386 ms 18572 KB Output is correct
19 Correct 466 ms 18572 KB Output is correct
20 Correct 141 ms 18572 KB Output is correct
21 Correct 273 ms 18572 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
32.0 / 32.0

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

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 18572 KB Output is correct
2 Correct 5 ms 18572 KB Output is correct
3 Correct 7 ms 18572 KB Output is correct
4 Correct 7 ms 18572 KB Output is correct
5 Correct 7 ms 18572 KB Output is correct
6 Correct 8 ms 18572 KB Output is correct
7 Correct 8 ms 18572 KB Output is correct
8 Correct 8 ms 18572 KB Output is correct
9 Correct 8 ms 18572 KB Output is correct
10 Correct 8 ms 18572 KB Output is correct
11 Correct 8 ms 18572 KB Output is correct
12 Correct 7 ms 18572 KB Output is correct
13 Correct 9 ms 18572 KB Output is correct
14 Correct 9 ms 18572 KB Output is correct
15 Correct 11 ms 18572 KB Output is correct
16 Correct 8 ms 18572 KB Output is correct
17 Correct 9 ms 18572 KB Output is correct
18 Correct 8 ms 18572 KB Output is correct
19 Correct 8 ms 18572 KB Output is correct
20 Correct 11 ms 18572 KB Output is correct
21 Correct 11 ms 18572 KB Output is correct
22 Correct 10 ms 18572 KB Output is correct
23 Correct 8 ms 18572 KB Output is correct
24 Correct 9 ms 18572 KB Output is correct
25 Correct 114 ms 18572 KB Output is correct
26 Correct 130 ms 18572 KB Output is correct
27 Correct 744 ms 21592 KB Output is correct
28 Correct 1075 ms 24896 KB Output is correct
29 Correct 953 ms 27244 KB Output is correct
30 Correct 415 ms 27244 KB Output is correct
31 Correct 138 ms 27244 KB Output is correct
32 Correct 376 ms 32332 KB Output is correct
33 Correct 341 ms 34272 KB Output is correct
34 Correct 532 ms 36128 KB Output is correct
35 Correct 166 ms 36128 KB Output is correct
36 Correct 392 ms 40564 KB Output is correct
37 Correct 131 ms 40564 KB Output is correct