oj.uz

Submission #56127

# Submission time Handle Problem Language Result Execution time Memory
56127 2018-07-10T05:12:54 Z 노영훈(#1580) Mobile (BOI12_mobile) C++11
0 / 100
 1000 ms 16728 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef pair<ll, ll> pll;
const int MX=500010, inf=2e9;
const ll linf=2e18;

int n;
ll l;
pll P[MX];

ll sq(ll x){ return x*x; }

lf itst(pll a, pll b){
    lf dm=a.first-b.first, db=a.second-b.second;
    return -db/dm;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>l;
    for(int i=1; i<=n; i++){
        ll x, y; cin>>x>>y;
        P[i]={-2*x,x*x+y*y};
    }
    sort(P+1, P+n+1, [](pll &a, pll &b){
        if(a.first==b.first) return a.second>b.second;
        return a.first>b.first;
    });
    vector<pll> stk; // m, b
    for(int i=1; i<=n; i++){
        pll now=P[i];
        while(!stk.empty()){
            pll prv=stk.back(); stk.pop_back();
            if(now.first==prv.first) continue;
            if(!stk.empty() && itst(stk.back(), prv)>=itst(prv, now)) continue;
            else { stk.push_back(prv); break; }
        }
        stk.push_back(P[i]);
    }
    lf x=0, ans=linf;
    for(int i=1; i<(int)stk.size(); i++){
        lf now=itst(stk[i], stk[i-1]);
        if(now<x) continue;
        now=min(now, (lf)l);
        ans=min(ans, stk[i].first*now+stk[i].second+now*now);
    }
    cout<<sqrtl(ans);
    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 1956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 4160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 4160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 16728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 183 ms 16728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 105 ms 16728 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 16728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 94 ms 16728 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 16728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 108 ms 16728 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 16728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 98 ms 16728 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 16728 KB Time limit exceeded
2 Halted 0 ms 0 KB -