oj.uz

Submission #1018879

# Submission time Handle Problem Language Result Execution time Memory
1018879 2024-07-10T10:34:46 Z JuliaTatad Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 4772 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

double MAX(double a, double b) {
	if (a > b) {
		return a;
	}
	return b;
}

double MIN(double a, double b) {
	if (a < b) {
		return a;
	}
	return b;
}

int main() {
	int n; cin >> n; double profit = 0;
	vector<double> a(n); vector<double> b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i]; cin >> b[i];
	}
	sort(a.begin(), a.end()); reverse(a.begin(), a.end()); sort(b.begin(), b.end()); reverse(b.begin(), b.end());

	vector<double> pa(n); vector<double> pb(n);
	pa[0] = a[0]; pb[0] = b[0];
	for (int i = 1; i < n; i++) {
		pa[i] = pa[i - 1] + a[i]; pb[i] = pb[i - 1] + b[i];
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			profit = MAX(profit, MIN(pa[i], pb[j]) - i - j - 2);
		}
	}

	printf("%.4lf", (double)profit);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Execution timed out 2043 ms 4772 KB Time limit exceeded
18 Halted 0 ms 0 KB -