Submission #1095881

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095881		Omar_Elgedawy	Mobile (BOI12_mobile)	C++17	0 / 100	1087 ms	25260 KiB

mobile

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define ld long double
#define F first
#define S second
#define el '\n'
#define cout(x) for(auto v:x)cout<<v<<el
#define coutp(x) for(auto v:x)cout<<v.F<<' '<<v.S<<el
#define cin(x) for(auto &v:x)cin>>v;
#define pb(x) push_back(x)
#define all(x)  x.begin(),x.end()

const int N = 5e3 + 5, M = 1e2 + 5, Mod = 1e9 + 7;
int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};

int nxt()
{
    int x;
    cin >> x;
    return x;
}
ld dist(pair<ld,ld>a,pair<ld,ld>b)
{
    ld d=(a.F-b.F)*(a.F-b.F)-(a.S-b.S)*(a.S-b.S);
    return sqrtl(d);
}
ld midX(pair<ld,ld>a,pair<ld,ld>b)
{
    if(b.F==a.F)return a.F;
    return (b.F*b.F+b.S*b.S-a.F*a.F-a.S*a.S)/(2.0*(b.F-a.F));
}
void solve(int h)
{
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>>v;
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        v.push_back({x,y});
    }
    ld mx=1e9;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            ld mid=midX(v[i],v[j]);
            if(mid<0)mid=0;
            if(mid>m)mid=m;
            mx=max({dist({mid,0},v[i]),dist({mid,0},v[j])});
        }
    }
    cout<<fixed<<setprecision(4)<<mx<<el;
}

int32_t main()
{
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r" , stdin);
    // freopen("output.txt", "w", stdout);
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    // #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc = 1;
    // cin >> tc;
    for (int i = 1; i <= tc; i++)solve(i);
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5