# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
576209 |
2022-06-12T13:56:14 Z |
Pietra |
Sure Bet (CEOI17_sure) |
C++14 |
|
91 ms |
8028 KB |
#include<bits/stdc++.h>
using namespace std ;
const int maxn = 1e5 + 5 ;
int n ;
double x[maxn], y[maxn], p_x[maxn], p_y[maxn] ;
bool cmp(double a, double b){ return a >= b ; }
int main(){
scanf("%d",&n) ;
for(int i = 1 ; i <= n ; i++) scanf("%lf%lf", &x[i],&y[i]) ;
sort(x + 1, x + 1 + n, cmp) ; sort(y + 1, y + 1 + n, cmp) ;
for(int i = 1 ; i <= n ; i++) p_x[i] = p_x[i-1] + x[i], p_y[i] = p_y[i-1] + y[i] ;
double ans = 0 ;
for(int i = 1 ; i <= n ; i++){
int ini = 1, fim = n, mid, best = 0 ; double mn = p_x[i] ;
while(ini <= fim){
mid = (ini + fim)>>1 ;
if(p_x[i] - mid - i < p_y[mid] - mid - i) fim = mid - 1 ;
else ini = mid + 1 ;
if(abs((p_x[i] - mid - i)-(p_y[mid] - mid - i)) <= mn){
mn = abs((p_x[i] - mid - i)-(p_y[mid] - mid - i)) ;
best = mid ;
}
}
ans = max(ans, min(p_x[i] - (double)best - (double)i, p_y[best] - (double)i - (double)best)) ;
}
printf("%.4lf\n", ans) ;
}
Compilation message
sure.cpp: In function 'int main()':
sure.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | scanf("%d",&n) ;
| ~~~~~^~~~~~~~~
sure.cpp:15:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | for(int i = 1 ; i <= n ; i++) scanf("%lf%lf", &x[i],&y[i]) ;
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
312 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
312 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
2 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
320 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
312 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
2 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
320 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
85 ms |
4668 KB |
Output is correct |
18 |
Correct |
84 ms |
4752 KB |
Output is correct |
19 |
Correct |
86 ms |
4660 KB |
Output is correct |
20 |
Correct |
91 ms |
4688 KB |
Output is correct |
21 |
Correct |
80 ms |
5128 KB |
Output is correct |
22 |
Correct |
75 ms |
4760 KB |
Output is correct |
23 |
Runtime error |
88 ms |
8028 KB |
Execution killed with signal 11 |
24 |
Halted |
0 ms |
0 KB |
- |