oj.uz

Submission #386442

# Submission time Handle Problem Language Result Execution time Memory
386442 2021-04-06T14:31:43 Z rocks03 Road Construction (JOI21_road_construction) C++14
100 / 100
 3961 ms 13028 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

class FenwickTree{
public:
    vector<int> fen;
    int bitsz;
    void build(int n){
        bitsz = n + 10;
        fen = vector<int>(bitsz, 0);
    }
    void add(int i, int k){
        ++i;
        for(; i < bitsz; i += (i & -i)) fen[i] += k;
    }
    int get(int i){
        ++i;
        int s = 0;
        for(; i; i -= (i & -i)) s += fen[i];
        return s;
    }
    int get(int l, int r){
        return get(r) - get(l - 1);
    }
} bit;

const int MAXN = 3e5+100;
int N, K;
pll a[MAXN];
vector<ll> c;

bool check(ll mid){
    bit.build(N);
    int j = 0;
    ll ans = 0;
    rep(i, 0, N){
        while(a[i].ff - a[j].ff > mid){
            bit.add(a[j].ss, -1);
            j++;
        }
        int l = lower_bound(all(c), c[a[i].ss] - mid) - c.begin();
        int r = upper_bound(all(c), c[a[i].ss] + mid) - c.begin() - 1;
        ans += bit.get(l, r);
        bit.add(a[i].ss, +1);
    }
    return (ans >= K);
}

void print_answer(ll mid){
    vector<ll> answer;
    set<pii> s;
    int j = 0;
    rep(i, 0, N){
        while(a[i].ff - a[j].ff > mid){
            s.erase({a[j].ss, j});
            j++;
        }
        int l = lower_bound(all(c), c[a[i].ss] - mid) - c.begin();
        int r = upper_bound(all(c), c[a[i].ss] + mid) - c.begin() - 1;
        auto it = s.lower_bound({l, -1});
        while(it != s.end()){
            if((*it).ff > r) break;
            answer.pb(max(a[i].ff - a[(*it).ss].ff, abs(c[(*it).ff] - c[a[i].ss])));
            ++it;
        }
        s.insert({a[i].ss, i});
    }
    while(SZ(answer) < K) answer.pb(mid + 1);
    sort(all(answer));
    rep(i, 0, K) cout << answer[i] << "\n";
}

void solve(){
    cin >> N >> K;
    rep(i, 0, N){
        int x, y;
        cin >> x >> y;
        a[i] = {x - y, x + y};
        c.pb(x + y);
    }
    sort(all(c));
    c.resize(unique(all(c)) - c.begin());
    rep(i, 0, N){
        a[i].ss = lower_bound(all(c), a[i].ss) - c.begin();
    }
    sort(a, a + N);
    ll l = 0, r = 1e11;
    while(r - l > 1){
        ll mid = (l + r) / 2;
        if(check(mid)){
            r = mid;
        } else{
            l = mid;
        }
    }
    print_answer(l);
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5096 KB Output is correct
2 Correct 57 ms 5096 KB Output is correct
3 Correct 53 ms 5096 KB Output is correct
4 Correct 60 ms 5224 KB Output is correct
5 Correct 51 ms 3944 KB Output is correct
6 Correct 3 ms 492 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1902 ms 10596 KB Output is correct
2 Correct 1854 ms 12984 KB Output is correct
3 Correct 49 ms 4968 KB Output is correct
4 Correct 1881 ms 10412 KB Output is correct
5 Correct 1812 ms 10612 KB Output is correct
6 Correct 1785 ms 13028 KB Output is correct
7 Correct 1812 ms 10384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3453 ms 8316 KB Output is correct
2 Correct 3469 ms 8208 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1739 ms 8164 KB Output is correct
5 Correct 1590 ms 8164 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3453 ms 8316 KB Output is correct
2 Correct 3469 ms 8208 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1739 ms 8164 KB Output is correct
5 Correct 1590 ms 8164 KB Output is correct
6 Correct 3589 ms 8172 KB Output is correct
7 Correct 3600 ms 8164 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3536 ms 8292 KB Output is correct
11 Correct 1729 ms 8164 KB Output is correct
12 Correct 1562 ms 8164 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5096 KB Output is correct
2 Correct 57 ms 5096 KB Output is correct
3 Correct 53 ms 5096 KB Output is correct
4 Correct 60 ms 5224 KB Output is correct
5 Correct 51 ms 3944 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1416 ms 8280 KB Output is correct
8 Correct 1395 ms 8292 KB Output is correct
9 Correct 52 ms 5224 KB Output is correct
10 Correct 1290 ms 7476 KB Output is correct
11 Correct 1244 ms 6376 KB Output is correct
12 Correct 535 ms 7292 KB Output is correct
13 Correct 587 ms 6756 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 5096 KB Output is correct
2 Correct 57 ms 5096 KB Output is correct
3 Correct 53 ms 5096 KB Output is correct
4 Correct 60 ms 5224 KB Output is correct
5 Correct 51 ms 3944 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1902 ms 10596 KB Output is correct
8 Correct 1854 ms 12984 KB Output is correct
9 Correct 49 ms 4968 KB Output is correct
10 Correct 1881 ms 10412 KB Output is correct
11 Correct 1812 ms 10612 KB Output is correct
12 Correct 1785 ms 13028 KB Output is correct
13 Correct 1812 ms 10384 KB Output is correct
14 Correct 3453 ms 8316 KB Output is correct
15 Correct 3469 ms 8208 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1739 ms 8164 KB Output is correct
18 Correct 1590 ms 8164 KB Output is correct
19 Correct 3589 ms 8172 KB Output is correct
20 Correct 3600 ms 8164 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 3536 ms 8292 KB Output is correct
24 Correct 1729 ms 8164 KB Output is correct
25 Correct 1562 ms 8164 KB Output is correct
26 Correct 1416 ms 8280 KB Output is correct
27 Correct 1395 ms 8292 KB Output is correct
28 Correct 52 ms 5224 KB Output is correct
29 Correct 1290 ms 7476 KB Output is correct
30 Correct 1244 ms 6376 KB Output is correct
31 Correct 535 ms 7292 KB Output is correct
32 Correct 587 ms 6756 KB Output is correct
33 Correct 3946 ms 11436 KB Output is correct
34 Correct 3961 ms 11336 KB Output is correct
35 Correct 3464 ms 12980 KB Output is correct
36 Correct 1403 ms 11060 KB Output is correct
37 Correct 1449 ms 11316 KB Output is correct
38 Correct 1588 ms 10468 KB Output is correct