oj.uz

Submission #709450

# Submission time Handle Problem Language Result Execution time Memory
709450 2023-03-13T15:32:20 Z cig32 Road Construction (JOI21_road_construction) C++14
5 / 100
 10000 ms 79896 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e5 + 2;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
bool cmp1(pair<int,int> x, pair<int,int> y) {
  return x.first+x.second < y.first+y.second;
}
bool cmp2(pair<int,int> x, pair<int,int> y) {
  return x.first-x.second < y.first-y.second;
}
int bit[MAXN];
void add(int x, int v) {
  for(;x<MAXN;x+=x&-x) bit[x] += v;
}
int sum(int x) {
  int s=0;
  for(;x;x-=x&-x) s += bit[x];
  return s;
}
void clear() {
  for(int i=0; i<MAXN; i++) bit[i] = 0;
}
int count(vector<pair<int,int> >v, int d) {
  int n = v.size();
  set<int>disc;
  for(int i=0; i<n; i++) {
    disc.insert(v[i].first-v[i].second);
  }
  map<int,int>is;
  int it=1;
  for(int x: disc) {
    is[x] = it++;
  }
  int ans=0;
  sort(v.begin(), v.end(), cmp1);
  int w[n];
  for(int i=0; i<n; i++) w[i] = is[v[i].first-v[i].second];
  clear();
  int j=0;
  for(int i=0; i<v.size(); i++) {
    while(j<i && (v[i].first+v[i].second)-(v[j].first+v[j].second) > d) {
      add(w[j], -1);
      j++;
    }
    auto it = disc.lower_bound(v[i].first-v[i].second+d+1);
    it--;
    int ub = is[*it];
    it = disc.lower_bound(v[i].first-v[i].second-d);
    int lb = is[*it];
    ans += sum(ub) - (lb == 0 ? 0 : sum(lb-1));
    add(w[i], 1);
  }
  return ans;
}

vector<int> all(vector<pair<int,int> >v, int d) {
  int n = v.size();
  set<int>disc;
  for(int i=0; i<n; i++) {
    disc.insert(v[i].first-v[i].second);
  }
  map<int,int>is;
  int it=1;
  for(int x: disc) {
    is[x] = it++;
  }
  int ans=0;
  sort(v.begin(), v.end(), cmp1);
  int j=0;
  vector<int> result;
  multiset<pair<int, int> > ms;
  for(int i=0; i<v.size(); i++) {
    while(j<i && (v[i].first+v[i].second)-(v[j].first+v[j].second) > d) {
      ms.erase(ms.lower_bound({v[j].first-v[j].second, v[j].first+v[j].second}));
      j++;
    }
    int ub = v[i].first-v[i].second+d, lb = v[i].first-v[i].second-d;
    if(ms.size()) {
      auto it = ms.lower_bound({lb, -4e9});
      while(it != ms.end() && (*it).first <= ub) {
        int x = abs((*it).first - (v[i].first - v[i].second));
        int y = abs((*it).second - (v[i].first + v[i].second));
        result.push_back(max(x, y));
        it++;
      }
    }
    ms.insert({v[i].first-v[i].second, v[i].first+v[i].second});
  }
  return result;
}
void solve(int tc) {
  int n, k;
  cin >> n >> k;
  vector<pair<int,int> > points;
  for(int i=0; i<n; i++) {
    int x, y;
    cin >> x >> y;
    points.push_back({x, y});
  }
  int lb = 0, rb = 4e9;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    int c = count(points, mid);
    if(c <= k) lb = mid;
    else rb = mid - 1;
  }
  vector<int> res = all(points, lb);
  sort(res.begin(), res.end());
  for(int x: res) cout << x << "\n";
  int finc = count(points, lb);
  if(finc < k) {
    rb = 4e9;
    lb++;
    while(lb < rb) {
      int mid = (lb + rb) >> 1;
      int c = count(points, mid);
      if(c != finc) rb = mid;
      else lb = mid + 1;
    }
    for(int i=finc+1; i<=k; i++) cout << lb << "\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Compilation message

road_construction.cpp: In function 'long long int count(std::vector<std::pair<long long int, long long int> >, long long int)':
road_construction.cpp:58:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i=0; i<v.size(); i++) {
      |                ~^~~~~~~~~
road_construction.cpp: In function 'std::vector<long long int> all(std::vector<std::pair<long long int, long long int> >, long long int)':
road_construction.cpp:90:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   for(int i=0; i<v.size(); i++) {
      |                ~^~~~~~~~~
road_construction.cpp:85:7: warning: unused variable 'ans' [-Wunused-variable]
   85 |   int ans=0;
      |       ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 6800 KB Output is correct
2 Correct 64 ms 6644 KB Output is correct
3 Correct 64 ms 6736 KB Output is correct
4 Correct 50 ms 6716 KB Output is correct
5 Correct 67 ms 5504 KB Output is correct
6 Correct 19 ms 1876 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 288 ms 79328 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 473 ms 79896 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 473 ms 79896 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 64 ms 6800 KB Output is correct
2 Correct 64 ms 6644 KB Output is correct
3 Correct 64 ms 6736 KB Output is correct
4 Correct 50 ms 6716 KB Output is correct
5 Correct 67 ms 5504 KB Output is correct
6 Correct 19 ms 1876 KB Output is correct
7 Correct 9481 ms 23248 KB Output is correct
8 Correct 9708 ms 24816 KB Output is correct
9 Correct 50 ms 6780 KB Output is correct
10 Execution timed out 10078 ms 22552 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 6800 KB Output is correct
2 Correct 64 ms 6644 KB Output is correct
3 Correct 64 ms 6736 KB Output is correct
4 Correct 50 ms 6716 KB Output is correct
5 Correct 67 ms 5504 KB Output is correct
6 Correct 19 ms 1876 KB Output is correct
7 Runtime error 288 ms 79328 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -