oj.uz

Submission #743196

# Submission time Handle Problem Language Result Execution time Memory
743196 2023-05-17T08:46:04 Z jamezzz Nicelines (RMI20_nicelines) C++17
87.8233 / 100
 81 ms 452 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;++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});
	}
	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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 2 ms 300 KB Output is correct
4 Correct 2 ms 208 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 2 ms 208 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.0553761202 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 39 ms 316 KB Output is partially correct
2 Partially correct 39 ms 452 KB Output is partially correct
3 Partially correct 38 ms 316 KB Output is partially correct
4 Partially correct 43 ms 324 KB Output is partially correct

Subtask #5
21.3393415294 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 20 ms 328 KB Output is partially correct
2 Partially correct 18 ms 316 KB Output is partially correct
3 Partially correct 24 ms 328 KB Output is partially correct
4 Partially correct 17 ms 336 KB Output is partially correct

Subtask #6
19.4285788704 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 39 ms 316 KB Output is partially correct
2 Partially correct 39 ms 452 KB Output is partially correct
3 Partially correct 38 ms 316 KB Output is partially correct
4 Partially correct 43 ms 324 KB Output is partially correct
5 Partially correct 20 ms 328 KB Output is partially correct
6 Partially correct 18 ms 316 KB Output is partially correct
7 Partially correct 24 ms 328 KB Output is partially correct
8 Partially correct 17 ms 336 KB Output is partially correct
9 Partially correct 76 ms 396 KB Output is partially correct
10 Partially correct 60 ms 388 KB Output is partially correct
11 Partially correct 81 ms 304 KB Output is partially correct
12 Partially correct 75 ms 328 KB Output is partially correct