Submission #445477

#TimeUsernameProblemLanguageResultExecution timeMemory
445477Nihal_9936Balloons (CEOI11_bal)C++17
100 / 100
216 ms7108 KiB
#include <bits/stdc++.h> using namespace std; template<typename T1, typename T2>istream& operator>>(istream& in, pair<T1, T2>& a) { return in >> a.first >> a.second; } template<typename T1, typename T2>ostream& operator<<(ostream& out, pair<T1, T2> a) { return out << a.first << " " << a.second;} template<typename T> void print(T t) { cout << t <<' '; } template<typename T, typename... Args> void print(T t, Args... args) { print(t);print(args...); } string operator*=(string& s, int cnt) { string t = s;for (size_t i = 1; i < cnt; i++)s += t;return s; } string operator*(string s, int cnt) { return s *= cnt; } #define int long long #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define all(x) (x).begin(),(x).end() #define allr(x) (x).rbegin(),(x).rend() #define uniq(v) (v).erase(unique(all(v)),(v).end()) #define len(x) (int)((x).size()) #define elif else if #define add insert #define append push_back #define pop pop_back #define str string #define in : #define fr first #define sc second #define pii pair<int,int> #define vi vector<int> #define vii vector<pii> #define mi map<int,int> #define mii map<pii,int> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>b;i--) #define el '\n' #define printl(arg) cout << arg << endl // #define print(arg) cout << arg #define inputa(arg) for (auto& e : arg) cin >> e #define printa(arg) for (auto& e : arg) print(e); #define printr(arg) { printl(arg);return; } #define printd(arg) printf("%0.3lf\n", arg) const int mod=1e9+7; // const int INF=1e18; const int MAX_N=4e5+2; int n,m,k,x,y,z,t,q,counter; // vector<vector<vector<int>>> dp(101 , vector<vector<int>>(101, vector<int>(101))); // vector<vector<int>>dp(5001, vi(5001)),ndp(5001,vi(5001)); // vi fac; // map<int,int> d; void code(){ cin>>n; double R,x; vector<double> ans; deque<vector<double>>dq; rep(i,0,n){ cin>>x>>R; if(len(dq)==0){ dq.append({x,R}); ans.append(R); }else{ double ck_r=R; while(len(dq)){ double x1=(dq.back())[0],r1=(dq.back())[1]; double r2=((x1-x)*(x1-x))/(4*r1); ck_r=min(ck_r,r2); if(r2>=ck_r){ if(ck_r>=r1){ dq.pop(); continue; }else{ ans.append(ck_r); dq.append({x,ck_r}); break; } }else{ if(r2>=r1){ dq.pop(); }else{ ans.append(ck_r); dq.append({x,ck_r}); break; } } } if(len(ans)==i){ ans.append(ck_r); dq.append({x,ck_r}); } } } for(auto& i in ans){ printd(i); } } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen("spainting.in", "r", stdin); // freopen("spainting.out", "w", stdout); int t = 1; // cin>>t; while(t--) code(); return 0; }

Compilation message (stderr)

bal.cpp: In function 'std::string operator*=(std::string&, int)':
bal.cpp:11:75: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 | string operator*=(string& s, int cnt) { string t = s;for (size_t i = 1; i < cnt; i++)s += t;return s; }
      |                                                                         ~~^~~~~
#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...