oj.uz

답안 #743210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743210 2023-05-17T08:53:51 Z jamezzz Nicelines (RMI20_nicelines) C++17
11 / 100
 71 ms 456 KB 
#include <bits/stdc++.h>
using namespace std;
#include "nice_lines.h"

#define pf printf
#define pb push_back
#define maxn 10000
#define EPS 1e-5
#define dist(a,b,x,y) (ld)abs(y-a*x-b)/pow(1+a*a,0.5)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;

map<ii,ld> memo;
vector<ii> know;

ld ask(ld x,ld y){
	ld res;
	if(x==0){
		if(memo.find({(int)x,(int)y})!=memo.end())res=memo[{(int)x,(int)y}];
		else res=memo[{(int)x,(int)y}]=query(x,y);
	}
	else res=query(x,y);
	for(auto[a,b]:know)res-=dist(a,b,x,y);
	return res;
}

void solve(int subtask_id,int N){
	for(int i=0;i<N-1;++i){
		int lo=-10000,hi=10000;
		if(subtask_id==4)lo=-500,hi=500;
		while(hi-lo>=3){
			int mid1=lo+((hi-lo)/3),mid2=lo+((hi-lo)*2/3);
			if(ask(0,mid1)>ask(0,mid2))lo=mid1;
			else hi=mid2;
		}
		ld best=1e18;int res=lo;
		for(int i=lo;i<=hi;++i){
			ld tmp=ask(0,i);
			if(tmp<best)best=tmp,res=i;
		}
		int b=(int)res;
		lo=-10000,hi=10000;
		if(subtask_id==4)lo=-500,hi=500;
		while(hi-lo>=3){
			int mid1=lo+((hi-lo)/3),mid2=lo+((hi-lo)*2/3);
			if(ask(EPS,mid1*EPS+b)>ask(EPS,mid2*EPS+b))lo=mid1;
			else hi=mid2;
		}
		best=1e18;res=lo;
		for(int i=lo;i<=hi;++i){
			ld tmp=ask(EPS,i*EPS+b);
			if(tmp<best)best=tmp,res=i;
		}
		int a=(int)res;
		know.push_back({a,b});
	}
	
	ld x1=ask(0,10000),x2=ask(0,10001);
	ld inv=1/(x2-x1);
	int a=(int)(pow(inv*inv-1,0.5)+EPS);
	int b=(int)(10001-x2*pow(a*a+1,0.5)+EPS);
	if(abs(dist(a,b,1,10001)-ask(1,10001))>EPS)a=-a;
	the_lines_are({a},{b});
	know.pb({a,b});
	
	vector<int> A,B;
	for(auto[a,b]:know)A.pb(a),B.pb(b);
	the_lines_are(A,B);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 71 ms 456 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 448 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 71 ms 456 KB Incorrect
2 Halted 0 ms 0 KB -