oj.uz

Submission #63154

# Submission time Handle Problem Language Result Execution time Memory
63154 2018-08-01T01:27:15 Z khsoo01 Sure Bet (CEOI17_sure) C++11
100 / 100
 142 ms 4412 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;

int n;
double a[N], b[N];

bool can (double P) {
	double pa = 0, pb = 0;
	int i = n, j = n;
	while(true) {
		bool upd = false;
		while(i >= 1 && pa < P) {
			pa -= 1.0; pb -= 1.0;
			pa += a[i]; i--;
			upd = true;
		}
		while(j >= 1 && pb < P) {
			pa -= 1.0; pb -= 1.0;
			pb += b[j]; j--;
			upd = true;
		}
		if(!upd) break;
	}
	if(pa >= P && pb >= P) return true;
	return false;
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++) {
		scanf("%lf%lf",&a[i],&b[i]);
	}
	sort(a+1, a+1+n);
	sort(b+1, b+1+n);
	double S = 0, E = 2e9;
	for(int i=0;i<50;i++) {
		double M = (S+E)/2;
		can(M) ? S = M : E = M;
	}
	printf("%.4f\n",S);
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
sure.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf%lf",&a[i],&b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 568 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 4 ms 652 KB Output is correct
13 Correct 3 ms 796 KB Output is correct
14 Correct 3 ms 796 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 3 ms 796 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 480 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 580 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 4 ms 652 KB Output is correct
13 Correct 3 ms 796 KB Output is correct
14 Correct 3 ms 796 KB Output is correct
15 Correct 3 ms 796 KB Output is correct
16 Correct 3 ms 796 KB Output is correct
17 Correct 100 ms 3564 KB Output is correct
18 Correct 103 ms 4292 KB Output is correct
19 Correct 104 ms 4292 KB Output is correct
20 Correct 100 ms 4408 KB Output is correct
21 Correct 142 ms 4408 KB Output is correct
22 Correct 104 ms 4408 KB Output is correct
23 Correct 99 ms 4408 KB Output is correct
24 Correct 142 ms 4408 KB Output is correct
25 Correct 104 ms 4408 KB Output is correct
26 Correct 112 ms 4412 KB Output is correct