oj.uz

Submission #142565

# Submission time Handle Problem Language Result Execution time Memory
142565 2019-08-09T17:12:25 Z liwi Sure Bet (CEOI17_sure) C++11
100 / 100
 92 ms 3704 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int len;
double A[MAXN],B[MAXN],rr;

int main(){
	scanf("%d",&len);
	for(int i=1; i<=len; i++)
		scanf(" %lf %lf",&A[i],&B[i]);
	sort(A+1,A+len+1,greater<double>());
	sort(B+1,B+len+1,greater<double>());
	for(int i=1; i<=len; i++){
		A[i]+=A[i-1];
		B[i]+=B[i-1];
	}
	for(int i=1; i<=len; i++){
		int low = 1, high = len, ans = 1;
		double res = min(A[i]-1-i,B[1]-1-i);
		while(low <= high){
			int mid = (low+high)/2;
			double f = A[i]-mid-i;
			double s = B[mid]-mid-i;
			if(min(f,s) >= min(A[i]-(mid-1)-i,B[mid-1]-(mid-1)-i)){
				ans = mid, res = min(f,s);
				low = mid+1;
			}else high = mid-1;
		}
		rr = max(rr,res);
	}
	printf("%.4f\n",rr);
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:59:28: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   int low = 1, high = len, ans = 1;
                            ^~~
sure.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&len);
  ~~~~~^~~~~~~~~~~
sure.cpp:51: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 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 88 ms 3192 KB Output is correct
18 Correct 89 ms 3448 KB Output is correct
19 Correct 90 ms 3320 KB Output is correct
20 Correct 89 ms 3292 KB Output is correct
21 Correct 91 ms 3576 KB Output is correct
22 Correct 88 ms 3320 KB Output is correct
23 Correct 92 ms 3192 KB Output is correct
24 Correct 90 ms 3344 KB Output is correct
25 Correct 87 ms 3192 KB Output is correct
26 Correct 91 ms 3704 KB Output is correct