Submission #479985

# Submission time Handle Problem Language Result Execution time Memory
479985 2021-10-14T06:42:17 Z kym Event Hopping 2 (JOI21_event2) C++14
Compilation error
0 ms 0 KB
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = -1;
int k;
void out(set<ti3>ans) {
	set<int> s;
	for(auto i:ans)s.insert(g2(i));
	dbv(s);
	vector<int>v;
	for(auto i:s)v.pb(i);
	FOR(i,0,k-1)cout<<v[i]<<'\n';
	exit(0);
}

int32_t main() 
{
	IAMSPEED
	int n;cin>>n>>k;
	vector<ti3> v;
	FOR(i,1,n) {
		int a,b,c;cin>>a>>b;c=i;
		v.pb(ti3(a,b,c));
	}
	sort(all(v),[](ti3 a, ti3 b) {
		if(g1(a)!=g1(b)) return g1(a)<g1(b);
		else return g0(a)>g0(b);
	});
	set<ti3>s;
	int st=-1;
	DEC(i,v.size()-1,0) {
		if(g1(v[i])<=st){
			s.insert(i);
			st=g0(v[i]);
		}
	
		
	}
	for(auto x:v) {
		if(g0(x)>=e) {
			s.insert(x);
			e=g1(x);
		}
	}
	//out(s);
	if((int)s.size()<k)return cout<<-1,0;
	sort(all(v),[](ti3 a, ti3 b) {
		return g2(a)<g2(b);
	});
	FOR(i,0,v.size()-1) {
		db(i);
		ti3 c=v[i];
		if(s.find(c)!=s.end())continue;
		set<ti3>os=s;
		int lf=g0(c),rg=g1(c);
		auto it=s.lower_bound(ti3(lf,oo,oo));
		while(it!=s.begin()){
			it=prev(it);
			ti3 x=*it;
			if(g1(x)>lf&&g2(x)<g2(c))goto riedusg;
			if(g1(x)>lf){
				it=next(it);
				s.erase(x);
			} else break;
				
		}
		it=s.lower_bound(ti3(lf,-oo,-oo));
		while(it!=s.end()) {
			ti3 x=*it;
			if(g0(x)<rg&&g2(x)<g2(c))goto riedusg;
			if(g0(x)<rg){
				it=next(it);
				s.erase(x);
			} else {
				break;
			}
		}
		s.insert(c);
		if((int)s.size()<k)out(os);
		continue;
		riedusg:;
		s=os;
	}
	out(s);
}

Compilation message

event2.cpp: In function 'int32_t main()':
event2.cpp:73:14: error: no matching function for call to 'std::set<std::tuple<long long int, long long int, long long int> >::insert(long long int&)'
   73 |    s.insert(i);
      |              ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from event2.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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::tuple<long long int, long long int, 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 'long long int' to 'const value_type&' {aka 'const std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::tuple<long long int, long long int, 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 'long long int' to 'std::set<std::tuple<long long int, long long int, long long int> >::value_type&&' {aka 'std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::tuple<long long int, long long int, long long int>, std::tuple<long long int, long long int, long long int>, std::_Identity<std::tuple<long long int, long long int, long long int> >, std::less<std::tuple<long long int, long long int, long long int> >, std::allocator<std::tuple<long long int, long long int, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::tuple<long long int, long long int, 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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, 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:
event2.cpp:73:14: note:   candidate expects 2 arguments, 1 provided
   73 |    s.insert(i);
      |              ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from event2.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::tuple<long long int, long long int, long long int>; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; _Alloc = std::allocator<std::tuple<long long int, long long int, 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 'long long int' to 'std::initializer_list<std::tuple<long long int, long long int, long long int> >'
  578 |       insert(initializer_list<value_type> __l)
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
event2.cpp:80:13: error: 'e' was not declared in this scope
   80 |   if(g0(x)>=e) {
      |             ^