제출 #1202344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202344		SSKMF	Balloons (CEOI11_bal)	C++20	50 / 100	2094 ms	1948 KiB

bal

#include <bits/stdc++.h>
using namespace std;

pair <int , long double> candidati[200001];

inline long double Necesar (pair <int , long double>& anterior , const int actual)
{
    return 1LL * (actual - anterior.first) * (actual - anterior.first) / (4 * anterior.second);
}

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

    int lungime;
    cin >> lungime;

    cout << fixed << setprecision(3);

    for (int indice = 1 ; indice <= lungime ; indice++)
    {
        int locatie , limita;
        cin >> locatie >> limita;

        while (candidati[0].first > 1 && Necesar(candidati[candidati[0].first - 1] , locatie) <= Necesar(candidati[candidati[0].first] , locatie))
            { candidati[0].first--; }

        long double raza = limita;
        for (int i = 1 ; i <= candidati[0].first ; i++)
            { raza = min(raza , Necesar(candidati[i] , locatie)); }

        candidati[++candidati[0].first] = {locatie , raza};
        cout << raza << '\n';
    }

    return 0;
}

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