oj.uz

Submission #778947

# Submission time Handle Problem Language Result Execution time Memory
778947 2023-07-11T04:29:00 Z bachhoangxuan Road Construction (JOI21_road_construction) C++17
100 / 100
 1543 ms 13448 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
*/
//const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,k;cin >> n >> k;
    vector<pii> p(n);
    for(int i=0;i<n;i++){int x,y;cin >> x >> y;p[i]={x+y,x-y};}
    sort(p.begin(),p.end());
    vector<int> ans;
    auto check = [&](int m,int t){
        int cnt=0,j=0;
        set<pii> s;
        for(int i=0;i<n;i++){
            while(j<i && p[i].fi-p[j].fi>m) s.erase({p[j].se,j++});
            auto it=s.lower_bound({p[i].se-m,0});
            while(it!=s.end() && it->fi<=p[i].se+m){
                if(++cnt>k) return false;
                if(t) ans.push_back(max(p[i].fi-p[it->se].fi,abs(p[i].se-p[it->se].se)));
                it++;
            }
            s.insert({p[i].se,i});
        }
        return true;
    };
    int l=0,r=4e9;
    while(r>l){
        int mid=(l+r+1)>>1;
        if(check(mid,0)) l=mid;
        else r=mid-1;
    }
    check(l,1);
    sort(ans.begin(),ans.end());
    for(int x:ans) cout << x << '\n';
    for(int i=0;i<k-(int)ans.size();i++) cout << l+1 << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message

road_construction.cpp: In lambda function:
road_construction.cpp:64:63: warning: operation on 'j' may be undefined [-Wsequence-point]
   64 |             while(j<i && p[i].fi-p[j].fi>m) s.erase({p[j].se,j++});
      |                                                              ~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 5048 KB Output is correct
2 Correct 82 ms 4972 KB Output is correct
3 Correct 71 ms 5092 KB Output is correct
4 Correct 69 ms 5092 KB Output is correct
5 Correct 77 ms 3832 KB Output is correct
6 Correct 3 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 10544 KB Output is correct
2 Correct 290 ms 10524 KB Output is correct
3 Correct 62 ms 5008 KB Output is correct
4 Correct 248 ms 10380 KB Output is correct
5 Correct 257 ms 10444 KB Output is correct
6 Correct 254 ms 10524 KB Output is correct
7 Correct 222 ms 9976 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 9224 KB Output is correct
2 Correct 262 ms 9220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 128 ms 7044 KB Output is correct
5 Correct 252 ms 9544 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 9224 KB Output is correct
2 Correct 262 ms 9220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 128 ms 7044 KB Output is correct
5 Correct 252 ms 9544 KB Output is correct
6 Correct 383 ms 9220 KB Output is correct
7 Correct 352 ms 9212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 300 ms 9216 KB Output is correct
11 Correct 104 ms 7180 KB Output is correct
12 Correct 301 ms 9552 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 5048 KB Output is correct
2 Correct 82 ms 4972 KB Output is correct
3 Correct 71 ms 5092 KB Output is correct
4 Correct 69 ms 5092 KB Output is correct
5 Correct 77 ms 3832 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 729 ms 8068 KB Output is correct
8 Correct 728 ms 7988 KB Output is correct
9 Correct 74 ms 5144 KB Output is correct
10 Correct 378 ms 7256 KB Output is correct
11 Correct 236 ms 7164 KB Output is correct
12 Correct 293 ms 5972 KB Output is correct
13 Correct 393 ms 6620 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 5048 KB Output is correct
2 Correct 82 ms 4972 KB Output is correct
3 Correct 71 ms 5092 KB Output is correct
4 Correct 69 ms 5092 KB Output is correct
5 Correct 77 ms 3832 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 302 ms 10544 KB Output is correct
8 Correct 290 ms 10524 KB Output is correct
9 Correct 62 ms 5008 KB Output is correct
10 Correct 248 ms 10380 KB Output is correct
11 Correct 257 ms 10444 KB Output is correct
12 Correct 254 ms 10524 KB Output is correct
13 Correct 222 ms 9976 KB Output is correct
14 Correct 278 ms 9224 KB Output is correct
15 Correct 262 ms 9220 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 128 ms 7044 KB Output is correct
18 Correct 252 ms 9544 KB Output is correct
19 Correct 383 ms 9220 KB Output is correct
20 Correct 352 ms 9212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 300 ms 9216 KB Output is correct
24 Correct 104 ms 7180 KB Output is correct
25 Correct 301 ms 9552 KB Output is correct
26 Correct 729 ms 8068 KB Output is correct
27 Correct 728 ms 7988 KB Output is correct
28 Correct 74 ms 5144 KB Output is correct
29 Correct 378 ms 7256 KB Output is correct
30 Correct 236 ms 7164 KB Output is correct
31 Correct 293 ms 5972 KB Output is correct
32 Correct 393 ms 6620 KB Output is correct
33 Correct 1477 ms 13448 KB Output is correct
34 Correct 1543 ms 13428 KB Output is correct
35 Correct 1012 ms 12688 KB Output is correct
36 Correct 469 ms 11532 KB Output is correct
37 Correct 462 ms 11520 KB Output is correct
38 Correct 581 ms 12152 KB Output is correct