oj.uz

답안 #1045846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1045846 2024-08-06T08:04:28 Z Whisper Road Construction (JOI21_road_construction) C++17
100 / 100
 943 ms 15232 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             250005
int N, K;

pair<int, int> A[MAX];

int ans[MAX];
void process(void){
    cin >> N >> K;
    for (int i = 1; i <= N; ++i){
        int x, y; cin >> x >> y;
        A[i] = make_pair(x + y, x - y);
    }
    sort(A + 1, A + N + 1);
    /*
        After rotating the plane by 45 degree, the Manhattan distance becomes Chebyshev distance instead
        Chebyshev between two point A(x1, y1) and B(x2, y2) is max(|x2 - x1|, |y2 - y1|)
    */

    auto check = [&](int x) -> bool{
        multiset<int> mySet;

        int j = 1, cnt = 0;
        for (int i = 1; i <= N; ++i){
            while (A[i].first - A[j].first > x){
                mySet.erase(mySet.find(A[j].second));
                ++j;
            }

            auto it = mySet.lower_bound(A[i].second - x);
            for (; it != mySet.end(); ++it){
                if ((*it) > A[i].second + x) break;
                ++cnt;
                if (cnt > K) return false;
            }
            mySet.insert(A[i].second);
        }
        return true;
    };
    int l = -1, r = 4e9 + 1;
    while (r - l > 1){
        int m = (l + r) >> 1;
        if(check(m)) l = m;
        else r = m;
    }

    multiset<pair<int, int>> mySet;
    int j = 1;

    vector<int> res;

    for (int i = 1; i <= N; ++i){
        while (j <= N && A[i].first - A[j].first > l) {
            mySet.erase(mySet.find(make_pair(A[j].second, A[j].first)));
            ++j;
        }
        auto it = mySet.lower_bound(make_pair(A[i].second - l, -INF));
        for (; it != mySet.end(); ++it){
            if ((*it).first > A[i].second + l) break;

            int dis = max(abs(A[i].first - (*it).second), abs(A[i].second - (*it).first));
            res.emplace_back(dis);
            assert((int)res.size() <= K);
        }
        mySet.insert(make_pair(A[i].second, A[i].first));
    }

    sort(res.begin(), res.end());
    for  (auto&i : res) cout << i << "\n";
    for (int i = 0; i < K - (int)res.size(); ++i) cout << l + 1 << "\n";
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 7136 KB Output is correct
2 Correct 56 ms 7048 KB Output is correct
3 Correct 51 ms 7116 KB Output is correct
4 Correct 50 ms 7136 KB Output is correct
5 Correct 53 ms 6024 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 11964 KB Output is correct
2 Correct 177 ms 9424 KB Output is correct
3 Correct 49 ms 7124 KB Output is correct
4 Correct 145 ms 9176 KB Output is correct
5 Correct 131 ms 9432 KB Output is correct
6 Correct 130 ms 9432 KB Output is correct
7 Correct 124 ms 8660 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 10324 KB Output is correct
2 Correct 230 ms 11228 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 67 ms 9068 KB Output is correct
5 Correct 170 ms 11496 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 10324 KB Output is correct
2 Correct 230 ms 11228 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 67 ms 9068 KB Output is correct
5 Correct 170 ms 11496 KB Output is correct
6 Correct 218 ms 11096 KB Output is correct
7 Correct 201 ms 11192 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 166 ms 11080 KB Output is correct
11 Correct 64 ms 9052 KB Output is correct
12 Correct 183 ms 11348 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 7136 KB Output is correct
2 Correct 56 ms 7048 KB Output is correct
3 Correct 51 ms 7116 KB Output is correct
4 Correct 50 ms 7136 KB Output is correct
5 Correct 53 ms 6024 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 463 ms 10584 KB Output is correct
8 Correct 463 ms 10700 KB Output is correct
9 Correct 64 ms 7124 KB Output is correct
10 Correct 240 ms 9952 KB Output is correct
11 Correct 145 ms 9700 KB Output is correct
12 Correct 152 ms 8492 KB Output is correct
13 Correct 181 ms 9128 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 7136 KB Output is correct
2 Correct 56 ms 7048 KB Output is correct
3 Correct 51 ms 7116 KB Output is correct
4 Correct 50 ms 7136 KB Output is correct
5 Correct 53 ms 6024 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 176 ms 11964 KB Output is correct
8 Correct 177 ms 9424 KB Output is correct
9 Correct 49 ms 7124 KB Output is correct
10 Correct 145 ms 9176 KB Output is correct
11 Correct 131 ms 9432 KB Output is correct
12 Correct 130 ms 9432 KB Output is correct
13 Correct 124 ms 8660 KB Output is correct
14 Correct 160 ms 10324 KB Output is correct
15 Correct 230 ms 11228 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 67 ms 9068 KB Output is correct
18 Correct 170 ms 11496 KB Output is correct
19 Correct 218 ms 11096 KB Output is correct
20 Correct 201 ms 11192 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 166 ms 11080 KB Output is correct
24 Correct 64 ms 9052 KB Output is correct
25 Correct 183 ms 11348 KB Output is correct
26 Correct 463 ms 10584 KB Output is correct
27 Correct 463 ms 10700 KB Output is correct
28 Correct 64 ms 7124 KB Output is correct
29 Correct 240 ms 9952 KB Output is correct
30 Correct 145 ms 9700 KB Output is correct
31 Correct 152 ms 8492 KB Output is correct
32 Correct 181 ms 9128 KB Output is correct
33 Correct 943 ms 15232 KB Output is correct
34 Correct 918 ms 15232 KB Output is correct
35 Correct 616 ms 14464 KB Output is correct
36 Correct 265 ms 13384 KB Output is correct
37 Correct 257 ms 13304 KB Output is correct
38 Correct 283 ms 13912 KB Output is correct