Submission #576217

# Submission time Handle Problem Language Result Execution time Memory
576217 2022-06-12T14:13:43 Z Pietra Sure Bet (CEOI17_sure) C++14
60 / 100
76 ms 6828 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(abs((p_x[i])-(p_y[mid])) <= mn){
    			mn = abs((p_x[i])-(p_y[mid])) ; 
    			best = mid ; 
    		} 
    		if(p_x[i] <= p_y[mid]) fim = mid - 1 ; 
    		else ini = mid + 1 ; 
    	}
    	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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 71 ms 3404 KB Output is correct
18 Correct 71 ms 3384 KB Output is correct
19 Correct 71 ms 3472 KB Output is correct
20 Correct 72 ms 3508 KB Output is correct
21 Correct 75 ms 3404 KB Output is correct
22 Correct 76 ms 3508 KB Output is correct
23 Runtime error 72 ms 6828 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -