Submission #893611

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
893611	2023-12-27T07:30:16 Z	thunopro	Event Hopping 2 (JOI21_event2)	C++14	7 / 100	45 ms	5972 KB

event2

#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow(a,n/2) ;
	if ( n % 2 ) return (1ll*res*res%mod*a%mod) ; 
	else return 1ll*res*res%mod ; 
}

int n , k ; 
pii a [maxn] ; 

void mapping () 
{
	vi v ;
	for ( int i = 1 ; i <= n ; i ++ ) v . pb (a[i].fi) , v . pb (a[i].se) ;
	sort (v.begin(),v.end()) ; 
	v.resize(unique(v.begin(),v.end())-v.begin()) ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		a [i].fi = _lower (v,a[i].fi) ; 
		a [i].se = _lower (v,a[i].se) ; 
	}
}

bool check_sub1 () 
{
	for ( int i = 1 ; i < n ; i ++ ) if ( a[i].fi > a[i+1].fi ) return false ; 
	return true ; 
}

int bit [maxn] ; 
int dp [maxn] ; 
void update ( int x , int y ) 
{
	while ( x ) chkmax (bit[x],y) , x -= (x&-x) ; 
}
int get ( int x ) 
{
	int res = 0 ; 
	while ( x < maxn ) chkmax (res,bit[x]) , x += (x&-x) ; 
	return res ; 
}
void sub1 () 
{
	for ( int i = n ; i >= 1 ; i -- ) 
	{
		dp [i] = get (a[i].se) + 1 ;
		update (a[i].fi,dp[i]) ; 
	}

	if ( *max_element(dp+1,dp+n+1) < k ) 
	{
		cout << - 1 ; re 
	}
	int cur = 0 ; 
	vi res ;  
	
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( a[i].fi >= cur && dp [i] + (int)res.size () >= k )
		{
			cur = a[i].se ; 
			res . pb (i) ;  
		}
		if ( res.size () == k ) break ;
	}
	
	for ( auto x : res ) cout << x << "\n" ; 
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> k ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i].fi >> a[i].se ; 
	mapping () ;

	if ( check_sub1 () ) sub1 () ; 

}

Compilation message

event2.cpp: In function 'void sub1()':
event2.cpp:103:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  103 |   if ( res.size () == k ) break ;
      |        ~~~~~~~~~~~~^~~~
event2.cpp: In function 'void rf()':
event2.cpp:35:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
event2.cpp:36:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  freopen ("bai1.out","w",stdout) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	37 ms	4160 KB	Output is correct
5	Correct	37 ms	4168 KB	Output is correct
6	Correct	36 ms	5948 KB	Output is correct
7	Correct	41 ms	5948 KB	Output is correct
8	Correct	37 ms	5928 KB	Output is correct
9	Correct	37 ms	5972 KB	Output is correct
10	Correct	37 ms	5824 KB	Output is correct
11	Correct	36 ms	5824 KB	Output is correct
12	Correct	36 ms	5592 KB	Output is correct
13	Correct	36 ms	5596 KB	Output is correct
14	Correct	36 ms	5588 KB	Output is correct
15	Correct	36 ms	5584 KB	Output is correct
16	Correct	36 ms	5596 KB	Output is correct
17	Correct	36 ms	5596 KB	Output is correct
18	Correct	36 ms	5568 KB	Output is correct
19	Correct	41 ms	5700 KB	Output is correct
20	Correct	37 ms	5592 KB	Output is correct
21	Correct	38 ms	5584 KB	Output is correct
22	Correct	40 ms	5544 KB	Output is correct
23	Correct	40 ms	5592 KB	Output is correct
24	Correct	43 ms	5728 KB	Output is correct
25	Correct	43 ms	5588 KB	Output is correct
26	Correct	42 ms	5688 KB	Output is correct
27	Correct	42 ms	5588 KB	Output is correct
28	Correct	31 ms	5592 KB	Output is correct
29	Correct	32 ms	5588 KB	Output is correct
30	Correct	36 ms	5596 KB	Output is correct
31	Correct	37 ms	5588 KB	Output is correct
32	Correct	45 ms	5688 KB	Output is correct
33	Correct	43 ms	5596 KB	Output is correct
34	Correct	34 ms	5680 KB	Output is correct
35	Correct	35 ms	5596 KB	Output is correct
36	Correct	35 ms	5844 KB	Output is correct
37	Correct	33 ms	5596 KB	Output is correct
38	Correct	32 ms	5596 KB	Output is correct
39	Correct	32 ms	5572 KB	Output is correct
40	Correct	32 ms	5596 KB	Output is correct
41	Correct	33 ms	5700 KB	Output is correct
42	Correct	40 ms	5584 KB	Output is correct
43	Correct	43 ms	5696 KB	Output is correct
44	Correct	41 ms	5592 KB	Output is correct
45	Correct	41 ms	5592 KB	Output is correct
46	Correct	43 ms	5584 KB	Output is correct

Subtask #2
0 / 1.0

#	Verdict	Memory	Grader output
1	Correct	2396 KB	Output is correct
2	Correct	2396 KB	Output is correct
3	Incorrect	2396 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #3
0 / 31.0

#	Verdict	Memory	Grader output
1	Correct	2396 KB	Output is correct
2	Correct	2396 KB	Output is correct
3	Incorrect	2396 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #4
0 / 61.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	37 ms	4160 KB	Output is correct
5	Correct	37 ms	4168 KB	Output is correct
6	Correct	36 ms	5948 KB	Output is correct
7	Correct	41 ms	5948 KB	Output is correct
8	Correct	37 ms	5928 KB	Output is correct
9	Correct	37 ms	5972 KB	Output is correct
10	Correct	37 ms	5824 KB	Output is correct
11	Correct	36 ms	5824 KB	Output is correct
12	Correct	36 ms	5592 KB	Output is correct
13	Correct	36 ms	5596 KB	Output is correct
14	Correct	36 ms	5588 KB	Output is correct
15	Correct	36 ms	5584 KB	Output is correct
16	Correct	36 ms	5596 KB	Output is correct
17	Correct	36 ms	5596 KB	Output is correct
18	Correct	36 ms	5568 KB	Output is correct
19	Correct	41 ms	5700 KB	Output is correct
20	Correct	37 ms	5592 KB	Output is correct
21	Correct	38 ms	5584 KB	Output is correct
22	Correct	40 ms	5544 KB	Output is correct
23	Correct	40 ms	5592 KB	Output is correct
24	Correct	43 ms	5728 KB	Output is correct
25	Correct	43 ms	5588 KB	Output is correct
26	Correct	42 ms	5688 KB	Output is correct
27	Correct	42 ms	5588 KB	Output is correct
28	Correct	31 ms	5592 KB	Output is correct
29	Correct	32 ms	5588 KB	Output is correct
30	Correct	36 ms	5596 KB	Output is correct
31	Correct	37 ms	5588 KB	Output is correct
32	Correct	45 ms	5688 KB	Output is correct
33	Correct	43 ms	5596 KB	Output is correct
34	Correct	34 ms	5680 KB	Output is correct
35	Correct	35 ms	5596 KB	Output is correct
36	Correct	35 ms	5844 KB	Output is correct
37	Correct	33 ms	5596 KB	Output is correct
38	Correct	32 ms	5596 KB	Output is correct
39	Correct	32 ms	5572 KB	Output is correct
40	Correct	32 ms	5596 KB	Output is correct
41	Correct	33 ms	5700 KB	Output is correct
42	Correct	40 ms	5584 KB	Output is correct
43	Correct	43 ms	5696 KB	Output is correct
44	Correct	41 ms	5592 KB	Output is correct
45	Correct	41 ms	5592 KB	Output is correct
46	Correct	43 ms	5584 KB	Output is correct
47	Correct	0 ms	2396 KB	Output is correct
48	Correct	0 ms	2396 KB	Output is correct
49	Incorrect	0 ms	2396 KB	Output isn't correct
50	Halted	0 ms	0 KB	-

Submission #893611

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 0 / 1.0

Subtask #3 0 / 31.0

Subtask #4 0 / 61.0

Subtask #1
7.0 / 7.0

Subtask #2
0 / 1.0

Subtask #3
0 / 31.0

Subtask #4
0 / 61.0