Submission #1029383

#TimeUsernameProblemLanguageResultExecution timeMemory
1029383fatemetmhrBalloons (CEOI11_bal)C++17
0 / 100
107 ms6740 KiB
//in the neme of god #include <bits/stdc++.h> using namespace std; const int MAX_N = 2e5 + 10; float n, x[MAX_N], r[MAX_N], ans[MAX_N], tmp; stack <int> st; int main(){ ios_base::sync_with_stdio(0), cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> x[i] >> r[i]; } for (int i = 0; i < n; i++) { tmp = 1e9; while (st.size() && ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()])) < tmp &&((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()])) < r[i]) { tmp = ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()])); st.pop(); } ans[i] = min(tmp, r[i]); st.push(i); } for (int i = 0; i < n; i++) cout << ans[i] << '\n'; }
#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...