oj.uz

답안 #743262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743262 2023-05-17T09:17:09 Z jamezzz Nicelines (RMI20_nicelines) C++17
87.9879 / 100
 83 ms 428 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,mid,res;
		if(subtask_id==4)lo=-500,hi=500;
		while(lo<=hi){
			mid=lo+((hi-lo)>>1);
			if(ask(0,mid)>ask(0,mid+1))lo=mid+1;
			else res=mid,hi=mid-1;
		}
		int b=(int)res;
		lo=-10000,hi=10000;
		if(subtask_id==4)lo=-500,hi=500;
		while(lo<=hi){
			mid=lo+((hi-lo)>>1);
			if(ask(EPS,mid*EPS+b)>ask(EPS,(mid+1)*EPS+b))lo=mid+1;
			else res=mid,hi=mid-1;
		}
		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=round(pow(inv*inv-1,0.5));
	//printf("%.20Lf\n",10001-x2*pow(a*a+1,0.5));
	int b=round(10001-x2*pow(a*a+1,0.5));
	//printf("%.20Lf %.20Lf\n",dist(a,b,1,10001),ask(1,10001));
	if(abs(dist(a,b,1,10001)-ask(1,10001))>1e-3)a=-a;
	know.pb({a,b});
	
	//printf("last %d %d\n",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 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 228 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
16.0789331106 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 328 KB Output is partially correct
2 Partially correct 52 ms 428 KB Output is partially correct
3 Partially correct 43 ms 332 KB Output is partially correct
4 Partially correct 66 ms 312 KB Output is partially correct

Subtask #5
21.4114711394 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 22 ms 324 KB Output is partially correct
2 Partially correct 19 ms 324 KB Output is partially correct
3 Partially correct 18 ms 332 KB Output is partially correct
4 Partially correct 22 ms 324 KB Output is partially correct

Subtask #6
19.4974994781 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 328 KB Output is partially correct
2 Partially correct 52 ms 428 KB Output is partially correct
3 Partially correct 43 ms 332 KB Output is partially correct
4 Partially correct 66 ms 312 KB Output is partially correct
5 Partially correct 22 ms 324 KB Output is partially correct
6 Partially correct 19 ms 324 KB Output is partially correct
7 Partially correct 18 ms 332 KB Output is partially correct
8 Partially correct 22 ms 324 KB Output is partially correct
9 Partially correct 67 ms 320 KB Output is partially correct
10 Partially correct 66 ms 324 KB Output is partially correct
11 Partially correct 75 ms 316 KB Output is partially correct
12 Partially correct 83 ms 388 KB Output is partially correct