oj.uz

답안 #623519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623519 2022-08-05T18:30:35 Z ipaljak Wish (LMIO19_noras) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long llint;

const int MAXN = 2e5 + 10;

int n, r;

vector<pair<llint, int>> event;

inline llint dst(llint x, llint y) {
  return x * x + y * y;
}

llint closest(llint x, llint y, llint dx, llint dy) {
  llint lo = -1e9, hi = 1e9;
  while (hi - lo >= 3) {
    llint m1 = lo + (hi - lo) / 3;
    llint m2 = hi - (hi - lo) / 3;
    if (dst(x + m1 * dx, y + m1 * dy) > dst(x + m2 * dx, y + m2 * dy))
      lo = m1;
    else
      hi = m2;
  }
  llint ret = lo;
  for (llint i = lo + 1; i <= hi; ++i)
    if (dst(x + i * dx, y + i * dy) < dst(x + ret * dx, y + ret * dy))
      ret = i;
  return ret;
}

llint find_lo(llint x, llint y, llint dx, llint dy, llint lo, llint hi) {
  while (lo < hi) {
    llint mid = (lo + hi) / 2;
    if (dst(x + mid * dx, y + mid * dy) > r * r) lo = mid + 1; else hi = mid;
  }
  return lo;
}

llint find_hi(llint x, llint y, llint dx, llint dy, llint lo, llint hi) {
  while (lo < hi) {
    llint mid = (lo + hi) / 2 + 1;
    if (dst(x + mid * dx, y + mid * dy) <= r * r) lo = mid; else hi = mid - 1;
  }
  return lo;
}

void find_interval(llint a, llint b, llint c, llint d) {
   llint dx = c - a, dy = d - b;
   llint k = max(0LL, closest(a, b, dx, dy));
   if (dst(a + k * dx, b + k * dy) > r * r) return;
   llint lo = find_lo(a, b, dx, dy, 0, k);
   llint hi = find_hi(a, b, dx, dy, k, 1e9);
   if (hi < 0LL) return;
   lo = max(lo, 0LL);
   event.emplace_back(lo, 1);
   event.emplace_back(hi + 1, -1);
}

int main(void) {
  scanf("%d%d", &n, &r);
  for (int i = 0; i < n; ++i) {
    llint a, b, c, d;
    scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
    find_interval(a, b, c, d);
  }

  sort(event.begin(), event.end());

  int curr = 0, sol = 0;
  for (auto &p : event) {
    curr += p.second;
    sol = max(sol, curr);
  }

  printf("%d\n", sol);
  return 0;
}

Compilation message

noras.cpp: In function 'int main()':
noras.cpp:63:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |   scanf("%d%d", &n, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~
noras.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -