Submission #1158190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158190		pacman	Candies (JOI18_candies)	C++20	Compilation error	0 ms	0 KiB

candies

#include <bits/stdc++.h>
#define int long long int

using namespace std;

const int maxn = 2e5 + 100;

int n, a[maxn], ans = 0;
set<pair<int ,int>> s;
set<int> active;


void in(){
	cin >> n;
	for(int i = 0 ;i < n; i++){
		cin >> a[i];
		s.insert(make_pair(a[i], i));
		active.insert(i);
	}
}


void Engine(){
	while(active.size() > 0){
		pair<int ,int> v = *s.rbegin();
		s.erase(s.rbegin());
		ans += v.first;
		cout << ans << "\n";
		if(active.size() == 1){
			break;
		}
		if(v.second == (*active.begin())){
			active.erase(*active.begin());
			s.erase(make_pair(a[*active.begin()], *active.begin()));
			active.erase(*active.begin());
			continue;
		}
		if(v.second == (*active.rbegin())){
			active.erase(*active.rbegin());
			s.erase(make_pair(a[*active.rbegin()], *active.rbegin()));
			active.erase(*active.rbegin());
			continue;
		}
		active.erase(v.second);
		auto ind = lower_bound(active.begin(), active.end(), v.second);
		auto nxt = ind;
		auto pre = prev(ind);
		active.erase(nxt), active.erase(pre);
		s.erase(make_pair(a[*nxt], *nxt));
		s.erase(make_pair(a[*pre], *pre));
		a[v.second] = a[*pre] + a[*nxt] - a[v.second];
		s.insert(make_pair(a[v.second], v.second));
		active.insert(v.second);
	}
}


int32_t main(){

	ios::sync_with_stdio(0) ,cout.tie(0) ,cin.tie(0);

	in();
	Engine();

	return 0;
}

Compilation message (stderr)

candies.cpp: In function 'void Engine()':
candies.cpp:26:24: error: no matching function for call to 'std::set<std::pair<long long int, long long int> >::erase(std::set<std::pair<long long int, long long int> >::reverse_iterator)'
   26 |                 s.erase(s.rbegin());
      |                 ~~~~~~~^~~~~~~~~~~~
In file included from /usr/include/c++/11/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:87,
                 from candies.cpp:1:
/usr/include/c++/11/bits/stl_set.h:654:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::erase(std::set<_Key, _Compare, _Alloc>::const_iterator) [with _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::const_iterator]'
  654 |       erase(const_iterator __position)
      |       ^~~~~
/usr/include/c++/11/bits/stl_set.h:654:28: note:   no known conversion for argument 1 from 'std::set<std::pair<long long int, long long int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, long long int> > >'} to 'std::set<std::pair<long long int, long long int> >::const_iterator' {aka 'std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::const_iterator'}
  654 |       erase(const_iterator __position)
      |             ~~~~~~~~~~~~~~~^~~~~~~~~~
/usr/include/c++/11/bits/stl_set.h:684:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::size_type std::set<_Key, _Compare, _Alloc>::erase(const key_type&) [with _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::size_type = long unsigned int; std::set<_Key, _Compare, _Alloc>::key_type = std::pair<long long int, long long int>]'
  684 |       erase(const key_type& __x)
      |       ^~~~~
/usr/include/c++/11/bits/stl_set.h:684:29: note:   no known conversion for argument 1 from 'std::set<std::pair<long long int, long long int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, long long int> > >'} to 'const key_type&' {aka 'const std::pair<long long int, long long int>&'}
  684 |       erase(const key_type& __x)
      |             ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/stl_set.h:706:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::erase(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::const_iterator) [with _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::const_iterator]'
  706 |       erase(const_iterator __first, const_iterator __last)
      |       ^~~~~
/usr/include/c++/11/bits/stl_set.h:706:7: note:   candidate expects 2 arguments, 1 provided