답안 #765420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
765420	2023-06-24T12:36:37 Z	lollipop	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	160 ms	18012 KB

Main

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int N = 2e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;
bool sortby( pair < int , int > a , pair < int , int > b ){
	 if( a.f < b.f ) return true ;
	 if( a.f > b.f ) return false ;
	 if( a.s > b.s ) return true ;
	 return false ; 
}
void solve(){
     int n ; cin >> n ;
     vector < pair < int , int > > v ;
     FOR( i , n ){
     	int x , e ; 
     	cin >> x >> e ;
     	int X = x - e ;
     	int Y = x + e ;
     	v.pb( { X , Y } ) ; 
	 }
     sort( v.begin() , v.end() , sortby ) ;
     int cnt = 0 ;
     int hg = -inf ;
     for( auto x : v ){
     	if( x.s > hg ){
     		hg = x.s ; cnt ++ ;
		 }
	 }
	 cout << cnt <<"\n" ;
}
signed main() {
   ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 //  freopen("laserin.txt" , "r" , stdin ) ;
 //  freopen("laserout.txt" , "w" , stdout) ; 
   int t = 1 ; // cin >> t ;
   while( t -- ){
   	 solve() ;
   }

}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	34 ms	4276 KB	Output is correct
3	Correct	50 ms	7300 KB	Output is correct
4	Correct	124 ms	12120 KB	Output is correct
5	Correct	66 ms	14012 KB	Output is correct
6	Correct	143 ms	17416 KB	Output is correct
7	Correct	149 ms	17924 KB	Output is correct
8	Correct	137 ms	17940 KB	Output is correct
9	Correct	97 ms	18012 KB	Output is correct

Subtask #2
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #3
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct

Subtask #4
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	34 ms	4276 KB	Output is correct
3	Correct	50 ms	7300 KB	Output is correct
4	Correct	124 ms	12120 KB	Output is correct
5	Correct	66 ms	14012 KB	Output is correct
6	Correct	143 ms	17416 KB	Output is correct
7	Correct	149 ms	17924 KB	Output is correct
8	Correct	137 ms	17940 KB	Output is correct
9	Correct	97 ms	18012 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	324 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	356 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	93 ms	13892 KB	Output is correct
37	Correct	120 ms	15172 KB	Output is correct
38	Correct	153 ms	17836 KB	Output is correct
39	Correct	131 ms	14908 KB	Output is correct
40	Correct	140 ms	17792 KB	Output is correct
41	Correct	137 ms	17824 KB	Output is correct
42	Correct	136 ms	17964 KB	Output is correct
43	Correct	160 ms	16840 KB	Output is correct
44	Correct	138 ms	17940 KB	Output is correct
45	Correct	119 ms	13392 KB	Output is correct

답안 #765420

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 23.0 / 23.0

Subtask #3 36.0 / 36.0

Subtask #4 31.0 / 31.0

Subtask #1
10.0 / 10.0

Subtask #2
23.0 / 23.0

Subtask #3
36.0 / 36.0

Subtask #4
31.0 / 31.0