oj.uz

답안 #578428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578428 2022-06-16T19:04:14 Z Pietra Sure Bet (CEOI17_sure) C++14
0 / 100
 1 ms 212 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*1.00 > b*1.00 ; }
 
int main(){
 
	cin >> n ; 
 
	for(int i = 1 ; i <= n ; i++) cin >> 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.00 ; 
 
    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] - i)-(p_y[mid]-mid)) <= mn){
    			mn = abs((p_x[i]-i)-(p_y[mid]-mid)) ; 
    			best = mid ; 
    		} 
    		if(p_x[i] - i <= p_y[mid] - mid) best = mid, fim = mid - 1 ; 
    		else ini = mid + 1 ; 
    	}
    	if(best) ans = max(ans, min(p_x[i] - (double)best - (double)i, p_y[best] - (double)i - (double)best)) ; 
    }

    cout << fixed << setprecision(4) << ans << "\n" ; 

}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -