oj.uz

Submission #743193

# Submission time Handle Problem Language Result Execution time Memory
743193 2023-05-17T08:43:49 Z jamezzz Nicelines (RMI20_nicelines) C++17
82.2323 / 100
 95 ms 304 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(memo.find({x,y})!=memo.end())res=memo[{x,y}];
	//else res=memo[{x,y}]=query(x,y);
	ld 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 208 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 3 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 #3
7.0 / 7.0

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

Subtask #4
14.022546364 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 63 ms 292 KB Output is partially correct
2 Partially correct 73 ms 292 KB Output is partially correct
3 Partially correct 70 ms 300 KB Output is partially correct
4 Partially correct 67 ms 296 KB Output is partially correct

Subtask #5
20.7723692447 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 27 ms 208 KB Output is partially correct
2 Partially correct 36 ms 208 KB Output is partially correct
3 Partially correct 26 ms 208 KB Output is partially correct
4 Partially correct 23 ms 208 KB Output is partially correct

Subtask #6
16.4374244622 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 63 ms 292 KB Output is partially correct
2 Partially correct 73 ms 292 KB Output is partially correct
3 Partially correct 70 ms 300 KB Output is partially correct
4 Partially correct 67 ms 296 KB Output is partially correct
5 Partially correct 27 ms 208 KB Output is partially correct
6 Partially correct 36 ms 208 KB Output is partially correct
7 Partially correct 26 ms 208 KB Output is partially correct
8 Partially correct 23 ms 208 KB Output is partially correct
9 Partially correct 95 ms 292 KB Output is partially correct
10 Partially correct 80 ms 304 KB Output is partially correct
11 Partially correct 93 ms 292 KB Output is partially correct
12 Partially correct 88 ms 304 KB Output is partially correct