제출 #1145815

#제출 시각아이디문제언어결과실행 시간메모리
1145815SulABalloons (CEOI11_bal)C++20
10 / 100
85 ms7612 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("popcnt")
#define all(a) a.begin(), a.end()
#define popcount __builtin_popcount
using namespace std;
using namespace chrono;

int a[1000][100];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int n; cin>>n;
    long long x[n], r[n];
    double R[n];
    for (int i = 0; i < n; cin >> x[i] >> r[i++]);
    vector<pair<long long, double>> st;
    for (int j = 0; j < n; j++) {
        R[j] = r[j];
        while (!st.empty()) {
            auto [xi, Ri] = st.back();
            auto d = x[j] - xi;
            auto t = d*d/(4*Ri);
            if (t > R[j]) break;
            R[j] = t;
            st.pop_back();
        }
        st.emplace_back(x[j], R[j]);
    }
    cout<< fixed << setprecision(4);
    for (auto rad : R) cout << rad << "\n";
}

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

bal.cpp:2:30: warning: bad option '-fpopcnt' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("popcnt")
      |                              ^
bal.cpp:10:10: warning: bad option '-fpopcnt' to attribute 'optimize' [-Wattributes]
   10 | int main() {
      |          ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...