oj.uz

Submission #493398

# Submission time Handle Problem Language Result Execution time Memory
493398 2021-12-11T08:21:18 Z MilosMilutinovic Sure Bet (CEOI17_sure) C++14
100 / 100
 89 ms 3520 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=105000;
int n;
db a[N],b[N];

int main() {
    scanf("%d",&n);
    rep(i,1,n+1) scanf("%lf%lf",a+i,b+i);
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    reverse(a+1,a+n+1);
    reverse(b+1,b+n+1);
    rep(i,1,n+1) a[i]=a[i]+a[i-1];
    rep(i,1,n+1) b[i]=b[i]+b[i-1];
    int ptr=1;
    db ans=0;
    rep(i,1,n+1) {
        while (ptr+1<=n&&min(a[i]-(i+ptr),b[ptr]-(i+ptr))<min(a[i]-(i+ptr+1),b[ptr+1]-(i+ptr+1))) {
            ptr++;
        }
        ans=max(ans,min(a[i]-(i+ptr),b[ptr]-(i+ptr)));
    }
    printf("%.4lf",ans);
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
sure.cpp:28:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     rep(i,1,n+1) scanf("%lf%lf",a+i,b+i);
      |                  ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 62 ms 3220 KB Output is correct
18 Correct 65 ms 3168 KB Output is correct
19 Correct 66 ms 3216 KB Output is correct
20 Correct 77 ms 3116 KB Output is correct
21 Correct 63 ms 3520 KB Output is correct
22 Correct 60 ms 3140 KB Output is correct
23 Correct 63 ms 3136 KB Output is correct
24 Correct 62 ms 3216 KB Output is correct
25 Correct 63 ms 3220 KB Output is correct
26 Correct 89 ms 3504 KB Output is correct