oj.uz

Submission #943819

# Submission time Handle Problem Language Result Execution time Memory
943819 2024-03-12T01:36:00 Z daoquanglinh2007 Nicelines (RMI20_nicelines) C++17
11 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#include "nice_lines.h"
using namespace std;

const int LIM = 1e4, inf = 1e9+7;

const long double EPS = 1e-9;

void solve(int subtask_id, int N){
	int l = -LIM, r = LIM, b = -inf, a = -inf;
	while (true){
		if (r-l < 3){
			for (int i = l; i <= r; i++)
				if (query(0, i) <= EPS){
					b = i;
					break;
				}
			break;
		}
		int m1 = l+(r-l)/3, m2 = r-(r-l)/3;
		if (query(0, m1) > query(0, m2)) l = m1; else r = m2;
	}
	l = -2*LIM, r = 2*LIM;
	while (true){
		if (r-l < 3){
			for (int i = l; i <= r; i++)
				if (query(1, i) <= EPS){
					a = i-b;
					break;
				}
			break;
		}
		int m1 = l+(r-l)/3, m2 = r-(r-l)/3;
		if (query(1, m1) > query(1, m2)) l = m1; else r = m2;
	}
	the_lines_are({a}, {b});
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 432 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 440 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB Incorrect
2 Halted 0 ms 0 KB -