제출 #127103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127103		eriksuenderhauf	Balloons (CEOI11_bal)	C++11	100 / 100	308 ms	14072 KiB

bal

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
double x[MAXN], r[MAXN], ans[MAXN];

int main()
{
    int n;
    ni(n);
    stack<int> st;
    for (int i = 0; i < n; i++)
    {
        scanf("%lf %lf", &x[i], &r[i]);
        ans[i] = r[i];
        while (!st.empty())
        {
            int j = st.top();
            ans[i] = min(ans[i], (x[i] - x[j]) * (x[i] - x[j]) / (4. * ans[j]));
            if (ans[i] > ans[j])
                st.pop();
            else
                break;
        }
        st.push(i);
        printf("%.20f\n", ans[i]);
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bal.cpp: In function 'int main()':
bal.cpp:7:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
bal.cpp:35:5: note: in expansion of macro 'ni'
     ni(n);
     ^~
bal.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lf %lf", &x[i], &r[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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