oj.uz

Submission #919683

# Submission time Handle Problem Language Result Execution time Memory
919683 2024-02-01T12:28:48 Z buzdi Balloons (CEOI11_bal) C++14
100 / 100
 1574 ms 12952 KB 
//#include <fstream>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <vector>
#include <cassert>
#include <map>
#include <iomanip>
#define ll long long

using namespace std;

const int NMAX = 2e5;

struct Point
{
    long double x, y;
    void Read()
    {
        cin >> x >> y;
    }
};

int n;
Point a[NMAX + 1];
long double answer[NMAX + 1];
Point st[NMAX + 1];
int indst;

long double Square(long double x)
{
    return x * x;
}

long double Radius(Point p1, Point p2)
{
    return Square(p2.x - p1.x) / (4.0 * p1.y);
}

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

    cin >> n;
    for (int i = 1; i <= n; i++)
        a[i].Read();

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= indst; j++)
            a[i].y = min(a[i].y, Radius(st[j], a[i]));
        while (indst > 0 && st[indst].y <= a[i].y)
            indst--;
        st[++indst] = a[i];
    }

    for (int i = 1; i <= n; i++)
        cout << fixed << setprecision(3) << a[i].y << '\n';

    return 0;
}

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 1 ms 2396 KB 2 numbers

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2644 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 631 ms 7252 KB 50000 numbers
2 Correct 307 ms 5712 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1006 ms 9608 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1443 ms 9808 KB 115362 numbers
2 Correct 746 ms 9652 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1574 ms 10328 KB 154271 numbers
2 Correct 1239 ms 12952 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 590 ms 9316 KB 200000 numbers
2 Correct 1246 ms 12684 KB 199945 numbers