Submission #942709

#	Time	Username	Problem	Language	Result	Execution time	Memory
942709		vjudge1	Nicelines (RMI20_nicelines)	C++14	11 / 100	39 ms	600 KiB

nicelines

#include "nice_lines.h"

#include <bits/stdc++.h>

using namespace std;

template<class T>
struct Point{
   T x, y;
   Point (T _x=0, T _y=0){
      x=_x; y=_y;
   }
   bool operator<(Point a){ return tie(x, y)<tie(a.x, a.y); }
   bool operator==(Point a){ return tie(x, y)==tie(a.x, a.y); }
   Point operator+(Point a){ return Point(x+a.x, y+a.y); }
   Point operator-(Point a){ return Point(x-a.x, y-a.y); }
   Point operator*(T a){ return Point(x*a, y*a); }
   Point operator/(T a){ return Point(x/a, y/a); }
   T dot(Point a){ return x*a.x+y*a.y; }
   T dot(Point a, Point b){ return (a-*this).dot(b-*this); }
   T cross(Point a){ return x*a.y-y*a.x; }
   T cross(Point a, Point b){ return (a-*this).cross(b-*this); }
   T dist2(){ return x*x+y*y; }
   long double dist(){ return sqrt(dist2()); }
};

using pt=Point<long double>;

long double line_point_dist(pt a, pt b, pt c){
   return abs(a.cross(b, c))/(a-b).dist();
}

mt19937 rng(69420);

long double rand(long double l, long double r){
   return uniform_real_distribution<long double>(l, r)(rng);
}

void solve(int subtask_id, int N) {
   if (N==1){
      pt a, b;
      {
         pt l(-1e12, -rand(0, 69420));
         pt r(1e12, rand(0, 69420));
         for (int i=0; i<1000; ++i){
            pt m1=l+(r-l)/3, m2=l+(r-l)/3*2;
            long double t1=query(m1.x, m1.y), t2=query(m2.x, m2.y);
            if (t1<t2) r=m2;
            else l=m1;
         }
         a=l;
      }
      {
         pt l(-rand(0, 69420), -1e12);
         pt r(rand(0, 69420), 1e12);
         for (int i=0; i<1000; ++i){
            pt m1=l+(r-l)/3, m2=l+(r-l)/3*2;
            long double t1=query(m1.x, m1.y), t2=query(m2.x, m2.y);
            if (t1<t2) r=m2;
            else l=m1;
         }
         b=l;
      }
      long double slope=round((b.y-a.y)/(b.x-a.x));
      cerr << fixed << setprecision(6) << a.x << ' ' << a.y << ' ' << b.x << ' ' << b.y << endl;
      the_lines_are({(int)(round(slope))}, {(int)(round(a.y-a.x*slope))});
      return;
   }
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 7
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27