Submission #742920

#	Time	Username	Problem	Language	Result	Execution time	Memory
742920		jamezzz	Nicelines (RMI20_nicelines)	C++17	0 / 100	6 ms	208 KiB

nicelines

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

#define maxn 10000

#define dist(a,b,x,y) pow(pow(((long double)y-a*b-a*a*x)/(1+a*a),2)+pow(((long double)a*x+a*y+b-y-a*a*y)/(1+a*a),2),0.5)

void solve(int subtask_id,int N){
	int x[]={0,0,100,100},y[]={0,100,0,100};
	long double ans[]={query(0,0),query(0,100),query(100,0),query(100,100)};
    for(int a=-maxn;a<=maxn;++a){
		int bb=(int)pow(1+a*a,0.5)*ans[0];
		vector<int> v;
		v.push_back(bb);
		v.push_back(bb+1);
		v.push_back(bb-1);
		v.push_back(-bb);
		v.push_back(-bb+1);
		v.push_back(-bb-1);
		for(int b:v){
			bool can=true;
			//printf("%d %d: ",a,b);
			for(int i=0;i<4;++i){
				//printf("(%Lf %Lf) ",dist(a,b,x[i],y[i]),ans[i]);
				if(dist(a,b,x[i],y[i])-ans[i]>1e-6)can=false;
			}
			//printf("\n");
			if(can)the_lines_are({a},{b});
		}
	}
}

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