| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 863849 | Abito | Balloons (CEOI11_bal) | C++17 | Compilation error | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
double a[N],x[N],R[N];
int n;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n;
for (int i=1;i<=n;i++) cin>>x[i]>>a[i];
set<pair<double,int>> s;
R[1]=a[1];
s.ep({R[1]+X[1],1});
for (int i=2;i<=n;i++){
double l=0,r=a[i],mid,ans;
int j=(*--s.end()).S;
for (int hhh=0;hhh<50;hhh++){
mid=(l+r)/2;
bool ok=((x[i]-x[j])*(x[i]-x[j])>=4*mid*R[j] || (x[i]-x[1])*(x[i]-x[1])>=4*mid*R[1]);
if (ok){
ans=mid;
l=mid;
}else r=mid;
}R[i]=ans;
s.ep({R[i]+x[i],i});
}for (int i=1;i<=n;i++) cout<<fixed<<setprecision(9)<<R[i]<<endl;
return 0;
}
Compilation message (stderr)
bal.cpp: In function 'int32_t main()':
bal.cpp:25:16: error: 'X' was not declared in this scope
25 | s.ep({R[1]+X[1],1});
| ^
bal.cpp:25:23: error: no matching function for call to 'std::set<std::pair<double, long long int> >::insert(<brace-enclosed initializer list>)'
25 | s.ep({R[1]+X[1],1});
| ^
In file included from /usr/include/c++/10/set:61,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
from bal.cpp:1:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
509 | insert(const value_type& __x)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:32: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const std::pair<double, long long int>&'}
509 | insert(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
518 | insert(value_type&& __x)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:27: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<std::pair<double, long long int> >::value_type&&' {aka 'std::pair<double, long long int>&&'}
518 | insert(value_type&& __x)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
546 | insert(const_iterator __position, const value_type& __x)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
551 | insert(const_iterator __position, value_type&& __x)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >]'
566 | insert(_InputIterator __first, _InputIterator __last)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note: template argument deduction/substitution failed:
bal.cpp:25:23: note: candidate expects 2 arguments, 1 provided
25 | s.ep({R[1]+X[1],1});
| ^
In file included from /usr/include/c++/10/set:61,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
from bal.cpp:1:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >]'
578 | insert(initializer_list<value_type> __l)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:43: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::initializer_list<std::pair<double, long long int> >'
578 | insert(initializer_list<value_type> __l)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type]'
598 | insert(node_type&& __nh)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:26: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<std::pair<double, long long int> >::node_type&&' {aka 'std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type&&'}
598 | insert(node_type&& __nh)
| ~~~~~~~~~~~~^~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type]'
603 | insert(const_iterator __hint, node_type&& __nh)
| ^~~~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate expects 2 arguments, 1 provided