oj.uz

Submission #387744

# Submission time Handle Problem Language Result Execution time Memory
387744 2021-04-09T07:06:48 Z abc864197532 Road Construction (JOI21_road_construction) C++17
0 / 100
 187 ms 33316 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
	for (auto i : x) cout << i << ' ';\
	cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
    return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
    return o >> a.X >> a.Y;
}
const int mod = 1e9 + 7, abc = 864197532, N = 80001, K = 111;

struct Pt {
    lli x, y, idx;
    Pt (lli _x = 0, lli _y = 0) : x(_x), y(_y) {}
    bool operator < (const Pt &o) const {
        return x < o.x;
    }
};

struct cmp {
    bool operator () (const Pt &a, const Pt &b) const {
        if (a.y == b.y) return a.idx < b.idx;
        return a.y < b.y;
    }
};

int bit[N];

void reset() {
    for (int i = 0; i < N; ++i) bit[i] = 0;
}

void add(int p, int v) {
    for (int i = p; i < N; i += i & (-i)) bit[i] += v;
}

int query(int p) {
    int ans = 0;
    for (int i = p; i > 0; i -= i & (-i)) ans += bit[i];
    return ans;
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector <Pt> a;
    for (int i = 0, x, y; i < n; ++i) {
        cin >> x >> y;
        a.pb(Pt(x + y, x - y));
        a.back().idx = i;
    }
    sort(all(a));
    auto chk = [&](lli d) {
        vector <lli> y_idx;
        for (int i = 0; i < n; ++i) y_idx.pb(a[i].y), y_idx.pb(a[i].y + d), y_idx.pb(a[i].y - d - 1);
        sort(all(y_idx));
        y_idx.resize(unique(all(y_idx)) - y_idx.begin());
        auto get = [&](lli x) {
            return lower_bound(all(y_idx), x) - y_idx.begin() + 1;
        };
        reset();
        lli ans = 0;
        for (int i = 0, j = 0; i < n; ++i) {
            while (j < n && a[j].x + d < a[i].x) add(get(a[j++].y), -1);
            ans += query(get(a[i].y + d)) - query(get(a[i].y - d - 1));
            add(get(a[i].y), 1);
        }
        return ans;
    };
    lli l = 0, r = 2e9 + 87;
    while (r - l > 1) {
        ((chk(l + r >> 1)) < k ? l : r) = l + r >> 1;
    }
    int d = l;
    l = 0, r = 2e9 + 87;
    while (r - l > 1) {
        ((chk(l + r >> 1)) >= k ? r : l) = l + r >> 1;
    }
    vector <int> ans;
    set <Pt, cmp> s;
    for (int i = 0, j = 0; i < n; ++i) {
        while (j < n && a[j].x + d < a[i].x) s.erase(a[j++]);
        for (auto it = s.lower_bound(Pt(0, a[i].y - d)); it != s.end() && it->y <= a[i].y + d; ++it) {
            ans.pb(max(a[i].x - it->x, abs(it->y - a[i].y)));
        }
        s.insert(a[i]);
    }
    sort(all(ans));
    for (int i = 0; i < k; ++i) {
        if (i < ans.size()) cout << ans[i] << '\n';
        else cout << r << '\n';
    }
}

Compilation message

road_construction.cpp: In function 'int main()':
road_construction.cpp:90:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |         ((chk(l + r >> 1)) < k ? l : r) = l + r >> 1;
      |               ~~^~~
road_construction.cpp:90:45: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |         ((chk(l + r >> 1)) < k ? l : r) = l + r >> 1;
      |                                           ~~^~~
road_construction.cpp:95:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |         ((chk(l + r >> 1)) >= k ? r : l) = l + r >> 1;
      |               ~~^~~
road_construction.cpp:95:46: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |         ((chk(l + r >> 1)) >= k ? r : l) = l + r >> 1;
      |                                            ~~^~~
road_construction.cpp:108:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         if (i < ans.size()) cout << ans[i] << '\n';
      |             ~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 4288 KB Output is correct
2 Correct 86 ms 4304 KB Output is correct
3 Incorrect 68 ms 4172 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 145 ms 33316 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 187 ms 33172 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 187 ms 33172 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 4288 KB Output is correct
2 Correct 86 ms 4304 KB Output is correct
3 Incorrect 68 ms 4172 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 4288 KB Output is correct
2 Correct 86 ms 4304 KB Output is correct
3 Incorrect 68 ms 4172 KB Output isn't correct
4 Halted 0 ms 0 KB -