Submission #205181

#TimeUsernameProblemLanguageResultExecution timeMemory
205181rulerBalloons (CEOI11_bal)C++14
100 / 100
218 ms9988 KiB
// IOI 2021 #include <bits/stdc++.h> using namespace std; #define endl '\n' #define ends ' ' #define die(x) return cout << x << endl, 0 #define all(v) v.begin(), v.end() #define sz(x) (int)(x.size()) void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); } #define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__) typedef long long ll; typedef pair<int, int> pii; const ll INF = 1e9; const ll MOD = 1e9 + 7; //////////////////////////////////////////////////////////////////// const int N = 2e5 + 3; typedef long double ld; int X[N]; ld R[N]; stack<int> S; ld GetRad(int dis, ld r) { return 1LL * dis * dis / r / 4; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) cin >> X[i] >> R[i]; for (int i = 0; i < n; i++) { while (!S.empty()) { int l = S.top(); ld r = GetRad(X[i] - X[l], R[l]); if (r < R[i]) R[i] = r; if (R[i] > R[l]) S.pop(); else break; } S.push(i); cout << fixed << setprecision(3) << R[i] << endl; } return 0; }
#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...