oj.uz

Submission #1116656

# Submission time Handle Problem Language Result Execution time Memory
1116656 2024-11-22T06:01:14 Z who Balloons (CEOI11_bal) C++17
100 / 100
 105 ms 11232 KB 
#include <bits/stdc++.h>

using namespace std;

#define task "balloons"
#define etr "\n"
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pli pair<long long,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define bg begin
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define lwb lower_bound
#define upb upper_bound
#define range(x, l, r) x+l, x+1+r
#define all(x) (x).bg(), (x).end()
#define compact(x) x.resize(unique(all(x)) - (x).bg())
#define sq(x) ((x)*(x))

auto start = chrono::high_resolution_clock::now();

void start_timer()
{
    start = chrono::high_resolution_clock::now();
}

ld elapsed()
{
    auto current = chrono::high_resolution_clock::now();
    ld duration = chrono::duration_cast<chrono::nanoseconds>(current - start).count();
    return duration / 1e9;
}
void freop()
{
	freopen(task".inp", "r", stdin);
	freopen(task".out", "w", stdout);
}

template<class U, class V> istream& operator >> (istream& in, pair<U, V>& p)
{
	in >> p.fi >> p.se;
	return in;
}

template<class U, class V> ostream& operator << (ostream& out, pair<U, V> p)
{
	out << "{" << p.fi << ' ' << p.se << "}";
	return out;
}

template<class T> ostream& operator << (ostream& out, vector<T>& v)
{
    out << "{";
	for (int i=0; i<v.size(); i++)
    {
        out << v[i];
        if (i != v.size() - 1) out << ", ";
    }

    out << "}";
	return out;
}
const int N=2e5, M=1e5, mod=1e9+7;

int n;
ll x[N+5], r[N+5];
long double ans[N+5];

ld calc(int i, int j)
{
    return sq(x[i] - x[j]) / (4 * ans[j]);
}

void process()
{
    cin >> n;
    for (int i=1; i<=n; i++) cin >> x[i] >> r[i];

    vector<int> st;
    st.reserve(n);

    for (int i=1; i<=n; i++)
    {
        ld val = r[i];
        while (!st.empty() && min(val, calc(i, st.back())) >= ans[st.back()])
        {
            val = min(val, calc(i, st.back()));
            st.pob();

        }

        if (!st.empty()) val = min(val, calc(i, st.back()));
        ans[i] = val;

        st.pb(i);

        cout << setprecision(3) << fixed << ans[i] << etr;
    }

}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	//freop();

	int t=1; //cin >> t;
	while (t--) process();

	return 0;
}

Compilation message

bal.cpp: In function 'void freop()':
bal.cpp:41:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  freopen(task".inp", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bal.cpp:42:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |  freopen(task".out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB 2 numbers

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 4944 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5448 KB 50000 numbers
2 Correct 24 ms 6224 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 6216 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6472 KB 115362 numbers
2 Correct 58 ms 7240 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 7248 KB 154271 numbers
2 Correct 94 ms 11232 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8268 KB 200000 numbers
2 Correct 105 ms 11036 KB 199945 numbers