oj.uz

Submission #985950

# Submission time Handle Problem Language Result Execution time Memory
985950 2024-05-19T11:49:37 Z anurag203 Mobile (BOI12_mobile) C++17
100 / 100
 732 ms 15964 KB 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define V vector<int>
#define VV vector<V>
#define Vll vector<ll>
#define VVll vector<Vll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define Vpii vector<pii>
#define VVpii vector<Vpii>
#define Vpll vector<pll> 
#define VVpll vector<Vpll>
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // find_by_order, order_of_key

#ifndef Anurag203
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}

template <class T, class vv> void _print(pair <T, vv> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class vv> void _print(map <T, vv> v);
template <class T> void _print(multiset <T> v);
template <class T> void _print(ordered_set <T> v);
template <class T, class vv> void _print(pair <T, vv> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class vv> void _print(map <T, vv> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(ordered_set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
/*----------------------------------------------------------------------------------------------------------------------------------------------------*/
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll powe(ll x,ll y, ll p=mod){ll res = 1; x = x % p;while (y > 0){ if (y & 1) res = (res * x) % p;y = y >> 1; x = (x * x) % p;} return res;}
bool revsort(ll a, ll b) {return a > b;}
ll inverse_modulo(ll a, ll p = mod) {return powe(a, p - 2, p);}
Vll fact; void fill_fact(ll p = mod) {fact.resize(200005, 1); rep(i, 1, 200005) { fact[i] = (fact[i - 1] * i) % p; }}
ll C(ll n,ll r,ll p=mod) {return ((fact[n]*inverse_modulo(fact[n-r]))%mod*inverse_modulo(fact[r]))%mod;}
void google(int t) {cout << "Case #" << t << ": ";}
Vll spf; void sieve(ll n = 200005) {spf.resize(n + 1, 1); ll i, j; for (ll i = 2; i <= n; i++) {if (spf[i] == 1) {spf[i] = i; for (j = i * i; j <= n; j += i){if (spf[j] == 1) spf[j] = i;}}}}
bool is_prime(ll x) {return (spf[x] == x);}
Vpll prime_factors(ll x) {Vpll ans; while (x != 1) {ll a = spf[x], cnt = 0; while (x % a == 0) x /= a, cnt++; ans.pb({a, cnt});}return ans;}
/*----------------------------------------------------------------------------------------------------------------------------------------------------*/
double n, l;
bool check(double mid, vector<pair<double, double>> &a)
{
    double mx = 0;
    for (auto e : a)
    {
        double x = (mid * mid) - (e.ss * e.ss);
        if (x < 0) continue;
        x = sqrt(x);
        if (e.ff - x <= mx) mx = max(mx, e.ff + x);
    }
    return mx >= l;
}
void solve()
{
    cin >> n >> l;
    vector<pair<double, double>> a(n);
    rep(i, 0, n) cin >> a[i].first >> a[i].second;

    double l = 0, r = 1e10, ans;
    rep(i, 0, 100)
    {
        double mid = (l + r) / 2;
        if (check(mid, a))
        {
            ans = mid;
            r = mid;
        }
        else l = mid;
    }
    cout << fixed << setprecision(10) << ans << endl;
}
int main() {
#ifndef Anurag203
    freopen("Error.txt", "w", stderr);
#endif
    fastio();
    // freopen("output.in", "r", stdin);
    // freopen("output.out", "w", stdout);

    int tt = 1;
    // cin>>tt;
    rep(ii, 1, tt + 1)
    {
        // google(ii);
        solve();
    }       
    return 0;
}

Compilation message

mobile.cpp: In function 'void sieve(long long int)':
mobile.cpp:66:62: warning: unused variable 'i' [-Wunused-variable]
   66 | Vll spf; void sieve(ll n = 200005) {spf.resize(n + 1, 1); ll i, j; for (ll i = 2; i <= n; i++) {if (spf[i] == 1) {spf[i] = i; for (j = i * i; j <= n; j += i){if (spf[j] == 1) spf[j] = i;}}}}
      |                                                              ^
mobile.cpp: In function 'int main()':
mobile.cpp:104:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |     freopen("Error.txt", "w", stderr);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 536 KB Output is correct
3 Correct 3 ms 360 KB Output is correct
4 Correct 3 ms 348 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 348 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1624 KB Output is correct
2 Correct 46 ms 1628 KB Output is correct
3 Correct 29 ms 1116 KB Output is correct
4 Correct 35 ms 1628 KB Output is correct
5 Correct 22 ms 1268 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 1628 KB Output is correct
2 Correct 32 ms 1368 KB Output is correct
3 Correct 36 ms 1628 KB Output is correct
4 Correct 37 ms 1628 KB Output is correct
5 Correct 40 ms 1624 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1628 KB Output is correct
2 Correct 50 ms 1628 KB Output is correct
3 Correct 45 ms 1628 KB Output is correct
4 Correct 47 ms 1884 KB Output is correct
5 Correct 39 ms 1628 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 1884 KB Output is correct
2 Correct 63 ms 1884 KB Output is correct
3 Correct 53 ms 1880 KB Output is correct
4 Correct 51 ms 1884 KB Output is correct
5 Correct 45 ms 1880 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 1880 KB Output is correct
2 Correct 66 ms 1884 KB Output is correct
3 Correct 53 ms 1880 KB Output is correct
4 Correct 47 ms 1884 KB Output is correct
5 Correct 45 ms 1884 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 8284 KB Output is correct
2 Correct 307 ms 8284 KB Output is correct
3 Correct 300 ms 8284 KB Output is correct
4 Correct 234 ms 8284 KB Output is correct
5 Correct 229 ms 8280 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 8284 KB Output is correct
2 Correct 430 ms 8284 KB Output is correct
3 Correct 263 ms 8280 KB Output is correct
4 Correct 242 ms 8280 KB Output is correct
5 Correct 219 ms 8284 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 9820 KB Output is correct
2 Correct 365 ms 9820 KB Output is correct
3 Correct 360 ms 9820 KB Output is correct
4 Correct 275 ms 9820 KB Output is correct
5 Correct 263 ms 9820 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 9820 KB Output is correct
2 Correct 503 ms 10072 KB Output is correct
3 Correct 309 ms 9816 KB Output is correct
4 Correct 277 ms 9820 KB Output is correct
5 Correct 268 ms 9820 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 11356 KB Output is correct
2 Correct 416 ms 11352 KB Output is correct
3 Correct 416 ms 11356 KB Output is correct
4 Correct 320 ms 11352 KB Output is correct
5 Correct 308 ms 11356 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 11356 KB Output is correct
2 Correct 542 ms 11356 KB Output is correct
3 Correct 372 ms 11352 KB Output is correct
4 Correct 321 ms 11356 KB Output is correct
5 Correct 308 ms 11356 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 12888 KB Output is correct
2 Correct 482 ms 12892 KB Output is correct
3 Correct 472 ms 12892 KB Output is correct
4 Correct 365 ms 12892 KB Output is correct
5 Correct 375 ms 12888 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 12892 KB Output is correct
2 Correct 610 ms 12888 KB Output is correct
3 Correct 428 ms 12892 KB Output is correct
4 Correct 377 ms 12892 KB Output is correct
5 Correct 352 ms 12892 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 542 ms 15960 KB Output is correct
2 Correct 598 ms 15960 KB Output is correct
3 Correct 596 ms 15960 KB Output is correct
4 Correct 485 ms 15964 KB Output is correct
5 Correct 471 ms 15960 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 15964 KB Output is correct
2 Correct 732 ms 15964 KB Output is correct
3 Correct 535 ms 15964 KB Output is correct
4 Correct 508 ms 15960 KB Output is correct
5 Correct 467 ms 15960 KB Output is correct