oj.uz

답안 #1007575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007575 2024-06-25T08:06:12 Z Unforgettablepl Road Construction (JOI21_road_construction) C++17
59 / 100
 7834 ms 416804 KB 
#include <bits/stdc++.h>
using namespace std;


#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
typedef tree<pair<int,int>,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> orderedset;

orderedset seg[1000000];
vector<pair<int,int>> points;
vector<pair<int,int>> edges;
int n;

void build(int x=1,int L=1,int R=n){
    if(L==R){
        seg[x].insert({points[L].second,L});
        return;
    }
    int mid = (L+R)/2;
    build(2*x,L,mid);
    build(2*x+1,mid+1,R);
    for(auto i:seg[2*x])seg[x].insert(i);
    for(auto i:seg[2*x+1])seg[x].insert(i);
}

int get(int qL,int qR,int qUpper,int qLower,int x=1,int L=1,int R=n){
    if(qR<L or R<qL)return 0;
    if(qL<=L and R<=qR){
        return seg[x].order_of_key({qUpper+1,0})-seg[x].order_of_key({qLower,0});
    }
    int mid = (L+R)/2;
    return get(qL,qR,qUpper,qLower,2*x,L,mid)+get(qL,qR,qUpper,qLower,2*x+1,mid+1,R);
}

int base;

void debug(int x){
    for(int i=0;i<seg[x].size();i++)cerr<<seg[x].find_by_order(i)->first<<' ';
}

void rec(int qL,int qR,int qUpper,int qLower,int x=1,int L=1,int R=n){
    if(qR<L or R<qL)return;
    if(qL<=L and R<=qR){
        auto lo = seg[x].order_of_key({qLower,0});
        auto hi = seg[x].order_of_key({qUpper+1,0});
        while(lo!=hi){
            edges.emplace_back(min(base,(int)seg[x].find_by_order(lo)->second),max(base,(int)seg[x].find_by_order(lo)->second));
            lo++;
        }
        return;
    }
    int mid = (L+R)/2;
    rec(qL,qR,qUpper,qLower,2*x,L,mid);
    rec(qL,qR,qUpper,qLower,2*x+1,mid+1,R);
}


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int k;
    cin >> n >> k;
    for(int i=1;i<=n;i++){
        int x,y;
        cin >> x >> y;
        points.emplace_back(x-y,x+y);
    }
    sort(points.begin(),points.end());
    points.insert(points.begin(),{0,0});
    build();
    auto calc = [&](int limit){
        int curr = 0;
        for(int i=1;i<=n;i++){
            int qL = lower_bound(points.begin()+1,points.end(),make_pair(points[i].first-limit,0ll))-points.begin();
            int qR = lower_bound(points.begin()+1,points.end(),make_pair(points[i].first+limit,0ll))-points.begin()-1;
            curr+=get(qL,qR,points[i].second+limit,points[i].second-limit);
        }
        curr-=n;
        return curr<2*k;
    };
    vector<int> edgewt;
    auto recover = [&](int limit){
        for(int i=1;i<=n;i++){
            int qL = lower_bound(points.begin(),points.end(),make_pair(points[i].first-limit,0ll))-points.begin();
            int qR = lower_bound(points.begin(),points.end(),make_pair(points[i].first+limit,0ll))-points.begin()-1;
            base = i;
            rec(qL,qR,points[i].second+limit,points[i].second-limit);
        }
        sort(edges.begin(),edges.end());
        edges.erase(unique(edges.begin(),edges.end()),edges.end());
        for(auto[a,b]:edges){
            if(a==b)continue;
            edgewt.emplace_back(max(abs(points[a].first-points[b].first),abs(points[a].second-points[b].second)));
        }
        sort(edgewt.begin(),edgewt.end());
    };
    int ans = 0;
    for(int jump=2147483648ll;jump;jump/=2)if(calc(ans+jump))ans+=jump;
    recover(ans);
    for(int i=0;i<k;i++){
        if(i<edgewt.size())cout<<edgewt[i]<<'\n';
        else cout<<ans+1<<'\n';
    }
}

Compilation message

road_construction.cpp: In function 'void debug(long long int)':
road_construction.cpp:40:18: warning: comparison of integer expressions of different signedness: 'long long int' and '__gnu_pbds::detail::bin_search_tree_set<std::pair<long long int, long long int>, __gnu_pbds::null_type, std::less<void>, __gnu_pbds::detail::tree_traits<std::pair<long long int, long long int>, __gnu_pbds::null_type, std::less<void>, __gnu_pbds::tree_order_statistics_node_update, __gnu_pbds::rb_tree_tag, std::allocator<char> >, std::allocator<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=0;i<seg[x].size();i++)cerr<<seg[x].find_by_order(i)->first<<' ';
      |                 ~^~~~~~~~~~~~~~
road_construction.cpp: In function 'int32_t main()':
road_construction.cpp:103:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |         if(i<edgewt.size())cout<<edgewt[i]<<'\n';
      |            ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 109448 KB Output is correct
2 Correct 133 ms 109388 KB Output is correct
3 Correct 144 ms 109284 KB Output is correct
4 Correct 128 ms 109228 KB Output is correct
5 Correct 148 ms 108208 KB Output is correct
6 Correct 58 ms 95060 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5384 ms 416064 KB Output is correct
2 Correct 4930 ms 416804 KB Output is correct
3 Incorrect 121 ms 109232 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7698 ms 406224 KB Output is correct
2 Correct 7834 ms 406224 KB Output is correct
3 Correct 48 ms 94288 KB Output is correct
4 Correct 4899 ms 404564 KB Output is correct
5 Correct 6483 ms 406968 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7698 ms 406224 KB Output is correct
2 Correct 7834 ms 406224 KB Output is correct
3 Correct 48 ms 94288 KB Output is correct
4 Correct 4899 ms 404564 KB Output is correct
5 Correct 6483 ms 406968 KB Output is correct
6 Correct 7817 ms 406996 KB Output is correct
7 Correct 7820 ms 408024 KB Output is correct
8 Correct 48 ms 94292 KB Output is correct
9 Correct 47 ms 94304 KB Output is correct
10 Correct 7734 ms 406964 KB Output is correct
11 Correct 5389 ms 405428 KB Output is correct
12 Correct 6401 ms 407480 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 109448 KB Output is correct
2 Correct 133 ms 109388 KB Output is correct
3 Correct 144 ms 109284 KB Output is correct
4 Correct 128 ms 109228 KB Output is correct
5 Correct 148 ms 108208 KB Output is correct
6 Correct 58 ms 95060 KB Output is correct
7 Correct 4548 ms 225508 KB Output is correct
8 Correct 4609 ms 225516 KB Output is correct
9 Correct 127 ms 109432 KB Output is correct
10 Correct 3307 ms 226024 KB Output is correct
11 Correct 2819 ms 226192 KB Output is correct
12 Correct 2075 ms 228392 KB Output is correct
13 Correct 2054 ms 226864 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 109448 KB Output is correct
2 Correct 133 ms 109388 KB Output is correct
3 Correct 144 ms 109284 KB Output is correct
4 Correct 128 ms 109228 KB Output is correct
5 Correct 148 ms 108208 KB Output is correct
6 Correct 58 ms 95060 KB Output is correct
7 Correct 5384 ms 416064 KB Output is correct
8 Correct 4930 ms 416804 KB Output is correct
9 Incorrect 121 ms 109232 KB Output isn't correct
10 Halted 0 ms 0 KB -