Submission #1123569

#	Time	Username	Problem	Language	Result	Execution time	Memory
1123569		gdragon	Balloons (CEOI11_bal)	C++20	20 / 100	325 ms	6556 KiB

bal

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
int n;
int x[N], radius[N];
long double ans[N];
void read() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> x[i] >> radius[i];
}
void solve() {
    // for(int i = 1; i <= n; i++) {
    //     ans[i] = radius[i];
    //     for(int j = i - 1; j >= 1; j--) {
    //         long long delta = x[i] - x[j];
    //         long double res = (long double)delta * delta / (long double)(4.0 * ans[j]);
    //         ans[i] = min(ans[i], res);
    //     }
    // }
    int opt = 1;
    long double mn = 1;
    ans[1] = radius[1];
    for(int i = 2; i <= n; i++) {
        mn = (long double)(x[i] - x[opt]) * (x[i] - x[opt]) / (4.0 * ans[opt]);
        long double mn1 = (long double)(x[i] - x[i - 1]) * (x[i] - x[i - 1]) / (4.0 * ans[i - 1]);
        if (mn1 < mn) {
            mn = mn1;
            opt = i - 1;
        }
        if (radius[i] <= mn) ans[i] = radius[i];
        else {
            ans[i] = mn;
        }
    }
    cout << fixed << setprecision(3);
    for(int i = 1; i <= n; i++) cout << ans[i] << endl;
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

Compilation message (stderr)

bal.cpp: In function 'int main()':
bal.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bal.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10