oj.uz

답안 #1059615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059615 2024-08-15T06:15:39 Z Malix Sure Bet (CEOI17_sure) C++14
60 / 100
 2000 ms 11324 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

vector<double> a,b,c,d;

int TS(int x,int l,int r){
    if(l==r)return l;
    int ml=l+(r-l)/3;
    int mr=r-(r-l)/3;
    double p=min(c[x]-ml-1,d[ml]-x-1);
    double q=min(c[x]-mr-1,d[mr]-x-1);
    if(r-l==1){
        if(p>q)return l;
        return r;
    }
    if(r-l==2){
        if(p<q)return TS(x,l+1,r);
        return TS(x,l,r-1);
    }cerr<<p<<" "<<q<<"\n";
    if(p<q)return TS(x,ml,r);
    else return TS(x,l,mr);
}

int main() {   
    int n;cin>>n;
    a.resize(n);b.resize(n);c.resize(n);d.resize(n);
    REP(i,0,n)cin>>a[i]>>b[i];
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
    double ans=0;
    c[0]=a[0]-1;
    REP(i,1,n)c[i]=a[i]+c[i-1]-1;
    d[0]=b[0]-1;
    REP(i,1,n)d[i]=b[i]+d[i-1]-1;
    REP(i,0,n){
        int k=TS(i,0,n-1);
        ans=max(ans,min(c[i]-k-1,d[k]-i-1));
    }
    cout<<fixed<<setprecision(4)<<ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 444 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 75 ms 508 KB Output is correct
13 Correct 77 ms 532 KB Output is correct
14 Correct 81 ms 592 KB Output is correct
15 Correct 75 ms 604 KB Output is correct
16 Correct 79 ms 596 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 444 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 75 ms 508 KB Output is correct
13 Correct 77 ms 532 KB Output is correct
14 Correct 81 ms 592 KB Output is correct
15 Correct 75 ms 604 KB Output is correct
16 Correct 79 ms 596 KB Output is correct
17 Execution timed out 2059 ms 11324 KB Time limit exceeded
18 Halted 0 ms 0 KB -