Submission #519518

#	Time	Username	Problem	Language	Result	Execution time	Memory
519518		sumit_kk10	Lightning Rod (NOI18_lightningrod)	C++17	40 / 100	2029 ms	157436 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;

inline int readInt() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}

void solve(){
	int n = readInt();
	pair<int, int> a[n];
	for(int i = 0; i < n; ++i){
		a[i].S = readInt();
		a[i].F = readInt();
	}
	sort(a, a + n, greater<pair<int, int> >());
	pair<int, bool> dp[n];
	dp[0].F = 1;
	dp[0].S = 1;
	for(int i = 1; i < n; ++i){
		dp[i].F = dp[i - 1].F + 1;
		dp[i].S = 1;
		for(int j = i - 1; j >= 0; --j){
			if(dp[j].S == 1 and a[j].F - a[i].F >= abs(a[j].S - a[i].S)){
					dp[i].F = dp[i - 1].F;
					dp[i].S = 0;
			}
		}
	}
	cout << dp[n - 1].F << '\n';
}
 
int main(){
	fast;
	int t = 1;
	// cin >> t;
	while(t--)
		solve();
}

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