oj.uz

Submission #906195

# Submission time Handle Problem Language Result Execution time Memory
906195 2024-01-13T15:20:46 Z Mikhail Mobile (BOI12_mobile) C++14
8 / 100
 786 ms 16168 KB 
#include <iostream>
#include <math.h>
#define MAX_N 1000000
double x[MAX_N], y[MAX_N];
#define MAX(a,b)  ((a > b) ? a : b)

using namespace std;

int main() {
	int N;
	cin >> N;
	double L;
	cin >> L;

	cin >> x[0] >> y[0];
	y[0] = y[0] * y[0];
	int ni = 1;
	for (int i = 1; i < N; i++) {
		cin >> x[ni] >> y[ni];
		if (x[ni] == x[ni - 1]) {
			if (y[ni] * y[ni] < y[ni - 1]) {
				x[ni - 1] = x[ni];
				y[ni - 1] = y[ni] * y[ni];
			}
		}
		else {
			y[ni] = y[ni] * y[ni];
			ni++;
		}
	}


	double l = 0., m, r = 1e9, m_sqr, c, t0, tn;
	while(r - l > 0.0009) {
		m = l / 2 + r / 2;
		m_sqr = m * m;
		c = 0.;
		for (int j = 0; j < ni; j++) {
			if (m_sqr < y[j]) continue;
			t0 = sqrt(m_sqr - y[j]);
			tn = x[j] - t0;
			if (tn > c) continue;
			t0 += x[j];
			c = MAX(t0, c);
		}
		//cout << c << ' ' << l << ' ' << r << ' ' << min_t <<  '\n';
		if (c > L) r = m;
		else l = m;
	}
	cout << l / 2 + r / 2 << '\n';
	return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2548 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Incorrect 3 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2396 KB Output is correct
2 Incorrect 5 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2396 KB Output is correct
2 Incorrect 5 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2396 KB Output is correct
2 Incorrect 7 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 4700 KB Output is correct
2 Incorrect 64 ms 4700 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2748 KB Output is correct
2 Correct 57 ms 4688 KB Output is correct
3 Incorrect 62 ms 4688 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6752 KB Output is correct
2 Incorrect 64 ms 4700 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 82 ms 4512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 340 ms 10848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 408 ms 2776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 413 ms 15200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 464 ms 2496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 479 ms 14964 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 523 ms 2488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 549 ms 14960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 601 ms 2732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 698 ms 16168 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 786 ms 2496 KB Output isn't correct
2 Halted 0 ms 0 KB -