답안 #159371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
159371	2019-10-22T13:17:00 Z	exqt	Jogging (kriii1_J)	C++14	0 / 1	101 ms	7660 KB

J

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<ll, ll>;

struct Line {
  ll x, y; // (xi - x) / yi

  double cross(Line &o) {
    double t = 1.0 * (x*o.y - o.x*y) / (o.y - y + 1e-18);
    return t;
  }

  double eval(double p) {
    return 1.0 * (x - p) / y;
  }
};

int main(int argc, char **argv) {
#ifdef LOCAL
  freopen("in.txt", "r", stdin);
#endif
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int n, m; cin >> n >> m;
  vector<Line> linesT(n);
  for(int i=0; i<n; i++) {
    cin >> linesT[i].x >> linesT[i].y;
  }

  vector<int> qrys(m);
  for(int i=0; i<m; i++) cin >> qrys[i];

  sort(linesT.begin(), linesT.end(), [&](Line &a, Line &b) {
    if(a.x != b.x) return a.x < b.x;
    else return a.y < b.y;
  });

  vector<Line> lines;
  for(Line l : linesT) {
    if(lines.size() == 0 || lines.back().x != l.x)
      lines.push_back(l);
  }

  vector<double> res(m);
  vector<Line> st;
  for(int i=m-1; i>=0; i--) {
    while(lines.size() && qrys[i] < lines.back().x) {
      st.push_back(lines.back());
      lines.pop_back();

      while(st.size() >= 2 &&
      qrys[i] <= st[(int)st.size()-2].cross(st.back())) {
        st.pop_back();
      }
    }

    while(st.size() >= 2 &&
    qrys[i] <= st[(int)st.size()-2].cross(st.back())) {
      st.pop_back();
    }

    res[i] = (st.size() ? st.back().eval(qrys[i]) : -1.0);
  }

  cout << fixed;
  cout.precision(7);
  for(double r : res) cout << (r == -1.0 ? 0.0 : atan(1.0/r)) << '\n';

  return 0;
}

Subtask #1

0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	101 ms	7660 KB	Output isn't correct
2	Halted	0 ms	0 KB	-