oj.uz

Submission #842492

# Submission time Handle Problem Language Result Execution time Memory
842492 2023-09-03T00:44:44 Z NoLove Balloons (CEOI11_bal) C++14
40 / 100
 2000 ms 4992 KB 
/**
 *    author : Lăng Trọng Đạt
 *    created: 2023-09-02
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;

const int INF = 2e9;
const double eps = 1e-6;
const int MAXN = 2e5 + 5;
int x[MAXN], r[MAXN],  id[MAXN]; // f[i]: final radius of balloon i
double f[MAXN];
int n;

inline double dist(double ngang, double doc) {
    return sqrt((double)ngang*ngang + doc*doc);
}

bool vaild(double radius, int pos, int adj) {
    double d =  dist(abs(pos - x[adj]), abs(radius - f[adj]));
    db(f[adj], radius, d, pos, x[adj])
    return f[adj] + radius <= d;
}

bool check(double radius, int pos, int i) {
    bool res = true;
    for (int j = i - 1; j > 0 && res; j--)
        res &= vaild(radius, pos, j);
    return res;
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    if (fopen("hi.inp", "r")) {
        freopen("hi.inp", "r", stdin);
//        freopen("hi.out", "w", stdout);
    }

    std::cin >> n;
    for (int i = 1; i <= n; i++) {
        std::cin >> x[i] >> r[i];
    }
    for (int i = 1; i <= n; i++) {
        double lo = 0, hi = r[i], res = 0;
        while ((hi - lo) > eps) {
            double mid = (lo + hi) / 2;
            if (check(mid, x[i], i)) {
                res = mid;
                lo = mid + eps;
            } else hi = mid - eps;
        }
        f[i] = res;
        cout << fixed << setprecision(10) << f[i] << "\n";
    }

}

Compilation message

bal.cpp: In function 'int32_t main()':
bal.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen("hi.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2392 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 2568 KB 2000 numbers

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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