oj.uz

Submission #944452

# Submission time Handle Problem Language Result Execution time Memory
944452 2024-03-12T17:56:49 Z daoquanglinh2007 Nicelines (RMI20_nicelines) C++17
64.7582 / 100
 46 ms 1204 KB 
#include <bits/stdc++.h>
#include "nice_lines.h"
using namespace std;
 
#define ll long long
#define ld long double
#define pii pair <int, int>
#define pld pair <ld, ld>
#define fi first
#define se second
#define mp make_pair
 
const ll LIM = 1e4;

const ld EPS = 1e-9, inf = 1e18;

struct line{
	ld a, b, c;
};

ll MAX_DEP = 32, x0 = 2*LIM+10;
vector <int> va, vb;
vector <ld> pos, neg;
set <pii> S;
 
void get(ld y){
	int b = int(round(y+x0*LIM+LIM))%x0-LIM, a = int(round(y-b)/(ld)x0);
	if (!S.count(mp(a, b))){
		va.push_back(a);
		vb.push_back(b);
		S.insert(mp(a, b));
		if (x0 > 0) pos.push_back(y); else neg.push_back(y);
	}
}
 
void dnc(int dep, ld l, ld r, ld fl, ld fr){
	if (dep == MAX_DEP){
		get((l+r)/2.0);
		return;
	}
	ld mid = (l+r)/2.0;
	if (fl == +inf) fl = query(x0, l);
	if (fr == +inf) fr = query(x0, r);
	ld fmid = query(x0, mid);
	if (abs(2.0*fmid - (fl+fr)) <= EPS) return;
	dnc(dep+1, l, mid, fl, fmid);
	dnc(dep+1, mid, r, fmid, fr);
}

line calc(pld A, pld B){
	line d;
	d.a = A.se-B.se, d.b = B.fi-A.fi, d.c = -A.fi*(A.se-B.se)-A.se*(B.fi-A.fi);
	return d;
}
 
void solve(int subtask_id, int N){
	if (N <= 3) MAX_DEP = 31;
	dnc(0, -2*LIM*(x0+1), 2*LIM*(x0+1), +inf, +inf);
	if (N <= 3){
		x0 = -x0;
		dnc(0, -2*LIM*(-x0+1), 2*LIM*(-x0+1), +inf, +inf);
		va.clear(); vb.clear();
		assert((int)pos.size() == N);
		assert((int)neg.size() == N);
		sort(pos.begin(), pos.end(), greater <ld>());
		sort(neg.begin(), neg.end());
		for (int i = 0; i < N; i++){
			line d = calc(mp(-x0, pos[i]), mp(x0, neg[i]));
			int a = round(-d.a/d.b), b = round(-d.c/d.b);
			va.push_back(a);
			vb.push_back(b);
		}
	}
	the_lines_are(va, vb);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 704 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 452 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
14.1625026041 / 19.0

# Verdict Execution time Memory Grader output
1 Partially correct 29 ms 700 KB Output is partially correct
2 Partially correct 29 ms 700 KB Output is partially correct
3 Partially correct 27 ms 684 KB Output is partially correct
4 Partially correct 27 ms 1204 KB Output is partially correct

Subtask #5
21.1162429669 / 23.0

# Verdict Execution time Memory Grader output
1 Partially correct 13 ms 452 KB Output is partially correct
2 Partially correct 11 ms 704 KB Output is partially correct
3 Partially correct 11 ms 696 KB Output is partially correct
4 Partially correct 13 ms 448 KB Output is partially correct

Subtask #6
18.4794436341 / 27.0

# Verdict Execution time Memory Grader output
1 Partially correct 29 ms 700 KB Output is partially correct
2 Partially correct 29 ms 700 KB Output is partially correct
3 Partially correct 27 ms 684 KB Output is partially correct
4 Partially correct 27 ms 1204 KB Output is partially correct
5 Partially correct 13 ms 452 KB Output is partially correct
6 Partially correct 11 ms 704 KB Output is partially correct
7 Partially correct 11 ms 696 KB Output is partially correct
8 Partially correct 13 ms 448 KB Output is partially correct
9 Partially correct 31 ms 944 KB Output is partially correct
10 Partially correct 46 ms 872 KB Output is partially correct
11 Partially correct 32 ms 692 KB Output is partially correct
12 Partially correct 36 ms 940 KB Output is partially correct