Submission #519511

#	Time	Username	Problem	Language	Result	Execution time	Memory
519511		sumit_kk10	Lightning Rod (NOI18_lightningrod)	C++17	11 / 100	2058 ms	188356 KiB

Main

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ll long long
#define F first 
#define S second
using namespace std;
const int N = 1e7 + 5, MOD = 1e9 + 7;
int n;
pair<int, int> a[N];
 
void solve(){
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> a[i].S >> a[i].F;
	sort(a, a + n, greater<pair<int, int> >());
	int pre = 0, ans = 1, i = 1;
	while(i < n){
		if(a[pre].F - a[i].F < abs(a[i].S - a[pre].S)){
			++ans;
			pre = i;
		}
		++i;
	}
	cout << ans << '\n';
}
 
int main(){
	fast;
	int t = 1;
	// cin >> t;
	while(t--)
		solve();
}

• Subtask 1: 4 / 4
• Subtask 2: 7 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 26
• Subtask 6: 0 / 10
• Subtask 7: 0 / 20