답안 #949686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949686 2024-03-19T15:13:27 Z Kavelmydex Mobile (BOI12_mobile) C++17
0 / 100
1000 ms 18872 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()
 
const int N = 4e5+10, OO = 1e18, mod = 1e9, mx = 2e6;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(double &a, double b){a = max(a,b);}
void cmn(double &a, double b){a = min(a,b);}

int n,l; 
bool in(int x){return 0<=x && x<=l;}
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> l;
    vector <pi> v;
    For(i,n){
        int x,y; cin >> x >> y;
        y = abs(y);
        v.pb({x,y});
    }   
    double ans = 0, mn = OO, mn2 = OO;
    For(i,n){
        cmn(mn, sqrt(v[i].f*v[i].f + v[i].s*v[i].s));
        int x = abs(v[i].f-l);
        cmn(mn2, sqrt(x * x + v[i].s * v[i].s));
    }
    cmx(ans, max(mn2,mn));
    vector <pi> u,q;
    For(i,n){
        bool ok = 0;
        for(auto [x,y]: u){
            int X = abs(x-v[i].f);
            if(X * X + y * y <= v[i].s * v[i].s){
                ok = 1;
            }
        }
        if(ok){
            u.pb(v[i]);
        } else {
            u.clear();
            u.pb(v[i]);
            if( i ){
                double cost = OO; pi p;
                for(auto [x,y]: q){
                    double X = abs(x-v[i].f);
                    double d = ( X*X + v[i].s * v[i].s - y * y ) / ( 2*X ), val = sqrt(d * d + y * y);
                    if(val < cost){
                        cost = val;
                        p = {x,y};
                    }
                } q.clear();
                if(in(p.f) || in(v[i].f)) 
                    cmx(ans, cost); 
            }
        }
        q.pb(v[i]);
    }
    cout << fixed << setprecision(4) << ans << endl;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 2528 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 2520 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2520 KB Output is correct
2 Incorrect 21 ms 2520 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 2520 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 2516 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 9424 KB Output is correct
2 Correct 767 ms 10184 KB Output is correct
3 Execution timed out 1064 ms 11280 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1062 ms 9156 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 17588 KB Output is correct
2 Execution timed out 1046 ms 18752 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1058 ms 18872 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 18356 KB Output is correct
2 Execution timed out 1030 ms 16824 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1050 ms 17960 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 18100 KB Output is correct
2 Execution timed out 1058 ms 18244 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1006 ms 17080 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 17336 KB Output is correct
2 Execution timed out 1086 ms 17588 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1032 ms 17100 KB Time limit exceeded
2 Halted 0 ms 0 KB -