oj.uz

Submission #1101205

# Submission time Handle Problem Language Result Execution time Memory
1101205 2024-10-15T18:00:02 Z zyadhany Mobile (BOI12_mobile) C++17
0 / 100
 1000 ms 48312 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,ll>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "-1\n"; return;}

const int MODE = 1e9 + 7;

using namespace std;


void solve(int tc) {
    ll n, len;

    cin >> n >> len;

    vp X(n);
    for (int i = 0; i < n; i++)
        cin >> X[i].first >> X[i].second;    

    double l = 0, r = 1.5e9;
    double err = 1e-3;
    while (r - l > err)
    {
        double mid = (l + r) / 2;
        bool isit = 0;

        ll a, b; a = b = 0;

        vector<pair<double, double>> Z;

        for (int i = 0; i < n; i++)
        {
            if (X[i].second > mid) continue;
            double diff = sqrt(mid * mid - X[i].second * X[i].second);
            double a = X[i].first - diff;
            double b = X[i].first + diff;
            Z.push_back({a, b});
        }
        
        sortx(Z);
        for (int i = 1; i < Z.size(); i++)
        {
            if (Z[i].first > Z[i - 1].second) isit = 1;
            Z[i].second = max(Z[i].second, Z[i - 1].second);
        }
        if (Z.empty() || Z[0].first > 0 || Z.back().second < len) isit = 1;

        if (isit) l = mid;
        else r = mid - err;
    }
    
    cout << fixed << setprecision(4) << l << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int size = 1;

    //freopen("loan.in", "r", stdin);
    //freopen("loan.out", "w", stdout);
    
    //cin >> size;
    for (int i = 1; i <= size; i++) solve(i);
}

Compilation message

mobile.cpp: In function 'void solve(int)':
mobile.cpp:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 1; i < Z.size(); i++)
      |                         ~~^~~~~~~~~~
mobile.cpp:44:12: warning: variable 'a' set but not used [-Wunused-but-set-variable]
   44 |         ll a, b; a = b = 0;
      |            ^

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 736 KB Output is correct
2 Incorrect 8 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 5348 KB Output is correct
2 Correct 248 ms 5232 KB Output is correct
3 Correct 274 ms 5224 KB Output is correct
4 Incorrect 439 ms 5620 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 5684 KB Output is correct
2 Correct 320 ms 5680 KB Output is correct
3 Incorrect 322 ms 5700 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 748 ms 24356 KB Output is correct
2 Execution timed out 1064 ms 24320 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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