oj.uz

답안 #1027249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027249 2024-07-19T02:46:35 Z vjudge1 Sure Bet (CEOI17_sure) C++17
100 / 100
 75 ms 3572 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(ll  i=(a);i<=(b);i++)
#define Ford(i,a,b) for(ll  i=(a);i>=(b);i--)
#define pb push_back
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define endl "\n"
using namespace std;
int Dx[] = {0, 1, 0, -1, -1, -1, 1, 1};
int Dy[] = {-1, 0, 1, 0, 1, -1, 1, -1};
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
const ll inf = 1000000000000000000;
const int N = 100000;
const int block_size = 300;
const ll MOD =  1e9 + 7; /* 998244353 */
const int LG = 18;
const int K = 20;	
const int M = 10000000;
ll nph(ll k, ll x) { return ((x >> k) & 1LL); }
#define ld double
ll n;
ld a[N+3],b[N+3], prea[N+3], preb[N+3];
bool cmp(ld a, ld b) {
	return a > b;
}
ld f(ll x, ll y) {
	return min(prea[x] - 1.0 * y, preb[y] - 1.0 * x);
}
ld binsech(ll x) {
	ll l = 1, r = n, ans = -1;
	if(n == 1) return f(x, 1);
	if(n == 2) return max(f(x, 1), f(x, 2));
	while(l <= r) {
		ll md = l + r >> 1;
		ll s = md - 1, t = md, u = md + 1;
		if(s == 0) {
			ans = t; l = md + 1;
			continue;
		}
		if(u == n+1) {
			ans = t; r = md - 1;
		}
		if(f(x, s) <= f(x, t) && f(x, t) <= f(x, u)) {
			ans = u; l = md + 1;
		}
		else if(f(x, s) >= f(x, t) && f(x, u)) {
			ans = s; r = md - 1;
		}
		else if(f(x, s) <= f(x, t) && f(x, t) >= f(x, u)) {
			return f(x, t);
		}
	}
	return f(x, ans);
}
void Solve() { 
	cin>>n;
	ld ans = 0.0;
	For(i, 1, n) cin>>a[i]>>b[i];
	For(i, 1, n) {a[i]--; b[i]--;}
	sort(a+1, a+n+1, cmp); sort(b+1, b+n+1, cmp);
	For(i, 1, n) prea[i] = prea[i-1] + a[i];
	For(i, 1, n) preb[i] = preb[i-1] + b[i];
	For(i, 1, n) {
		ans = max(ans, binsech(i));
	}
	cout << fixed << setprecision(4) << ans;
}	

int main() {
    // freopen("AVGSEQ.INP", "r", stdin);
    // freopen("AVGSEQ.OUT", "w", stdout);
    ios_base::sync_with_stdio(0); 
    cin.tie(NULL); 
    cout.tie(NULL);
    int t = 1;
    //cin >> t; 
    while(t--) 
    	Solve();
}

Compilation message

sure.cpp: In function 'double binsech(long long int)':
sure.cpp:39:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |   ll md = l + r >> 1;
      |           ~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 60 ms 3408 KB Output is correct
18 Correct 61 ms 3316 KB Output is correct
19 Correct 61 ms 3328 KB Output is correct
20 Correct 61 ms 3408 KB Output is correct
21 Correct 64 ms 3408 KB Output is correct
22 Correct 63 ms 3388 KB Output is correct
23 Correct 68 ms 3572 KB Output is correct
24 Correct 75 ms 3472 KB Output is correct
25 Correct 70 ms 3328 KB Output is correct
26 Correct 69 ms 3448 KB Output is correct