oj.uz

Submission #1008838

# Submission time Handle Problem Language Result Execution time Memory
1008838 2024-06-26T23:28:03 Z whatthemomooofun1729 Mobile (BOI12_mobile) C++17
95 / 100
 1000 ms 27472 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

int N, L;
vc<pii> p;

bool checkie(ld x) {
    ld right = 0;
    for (int i = 0; i < N; ++i) {
        if (x < abs(p[i].ss)) continue;
        ld thingy = sqrtl(x * x - (ld)p[i].ss * p[i].ss);
        ld x2 = (ld)p[i].ff + thingy, x1 = (ld)p[i].ff - thingy;
        //debug(x1, x2);
        if (x1 > right) continue;
        ckmax(right, x2);
    }
    //debug(right);
    return right >= L;
}

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> L;
    p.rsz(N);
    for (int i = 0; i < N; ++i) {
        cin >> p[i].ff >> p[i].ss;
    }
    ld l = 0.00, r = (ld)1e11;
    for (int i = 0; i < 150; ++i) {
        ld mid = (ld)((ld)(l + r)/(ld)2.00);
        if (checkie(mid)) {
            r = mid;
        } else l = mid;
    }
    cout << fixed << setprecision(6) << r;
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

mobile.cpp: In function 'void setIO(const string&)':
mobile.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mobile.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
3 Correct 0 ms 348 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 344 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 4 ms 500 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 348 KB Output is correct

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 500 KB Output is correct
2 Correct 4 ms 496 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 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 95 ms 860 KB Output is correct
2 Correct 69 ms 860 KB Output is correct
3 Correct 36 ms 856 KB Output is correct
4 Correct 31 ms 860 KB Output is correct
5 Correct 20 ms 860 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 860 KB Output is correct
2 Correct 30 ms 860 KB Output is correct
3 Correct 33 ms 860 KB Output is correct
4 Correct 34 ms 856 KB Output is correct
5 Correct 35 ms 1116 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1112 KB Output is correct
2 Correct 70 ms 1116 KB Output is correct
3 Correct 54 ms 1116 KB Output is correct
4 Correct 36 ms 1116 KB Output is correct
5 Correct 35 ms 1112 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1116 KB Output is correct
2 Correct 100 ms 1116 KB Output is correct
3 Correct 68 ms 1116 KB Output is correct
4 Correct 42 ms 1116 KB Output is correct
5 Correct 42 ms 1112 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 1116 KB Output is correct
2 Correct 83 ms 1112 KB Output is correct
3 Correct 62 ms 1116 KB Output is correct
4 Correct 36 ms 1112 KB Output is correct
5 Correct 51 ms 1116 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 4184 KB Output is correct
2 Correct 426 ms 4188 KB Output is correct
3 Correct 451 ms 4188 KB Output is correct
4 Correct 179 ms 4184 KB Output is correct
5 Correct 203 ms 4184 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 4188 KB Output is correct
2 Correct 741 ms 4188 KB Output is correct
3 Correct 343 ms 4188 KB Output is correct
4 Correct 175 ms 4184 KB Output is correct
5 Correct 191 ms 4440 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 565 ms 4956 KB Output is correct
2 Correct 486 ms 4952 KB Output is correct
3 Correct 499 ms 4952 KB Output is correct
4 Correct 226 ms 4952 KB Output is correct
5 Correct 230 ms 4952 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 4952 KB Output is correct
2 Correct 839 ms 4952 KB Output is correct
3 Correct 405 ms 11936 KB Output is correct
4 Correct 215 ms 16724 KB Output is correct
5 Correct 219 ms 13648 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 647 ms 5720 KB Output is correct
2 Correct 503 ms 5724 KB Output is correct
3 Correct 586 ms 5724 KB Output is correct
4 Correct 266 ms 5724 KB Output is correct
5 Correct 272 ms 5724 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 5724 KB Output is correct
2 Correct 933 ms 5724 KB Output is correct
3 Correct 505 ms 14244 KB Output is correct
4 Correct 276 ms 19120 KB Output is correct
5 Correct 313 ms 15956 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 713 ms 6488 KB Output is correct
2 Correct 667 ms 6488 KB Output is correct
3 Correct 662 ms 6488 KB Output is correct
4 Correct 274 ms 6488 KB Output is correct
5 Correct 304 ms 6492 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 6492 KB Output is correct
2 Correct 997 ms 6488 KB Output is correct
3 Correct 512 ms 16048 KB Output is correct
4 Correct 339 ms 22072 KB Output is correct
5 Correct 285 ms 18260 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 878 ms 8280 KB Output is correct
2 Correct 832 ms 8284 KB Output is correct
3 Correct 893 ms 22740 KB Output is correct
4 Correct 343 ms 27472 KB Output is correct
5 Correct 371 ms 21716 KB Output is correct

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 775 ms 8280 KB Output is correct
2 Execution timed out 1055 ms 8284 KB Time limit exceeded
3 Halted 0 ms 0 KB -