Submission #921637

# Submission time Handle Problem Language Result Execution time Memory
921637 2024-02-04T08:37:27 Z vjudge1 Lightning Rod (NOI18_lightningrod) C++17
0 / 100
585 ms 262144 KB
#include <bits/stdc++.h>
#define F first 
#define S second
#define ent '\n'
#define int long long
#define pb push_back

typedef long double ld;
typedef long long ll;
using namespace std;

const int maxn = 1e6+12;
const int T = 0;
const int mod = 1e9+7;

int n,m,k,x,y,l,r;
int p[maxn],pref[maxn],fact[maxn];

void solve(){
	cin>>n;
	int a[n+2],b[n+2];
	int cnt=0;
	vector<pair<int,int>>v;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
		cnt+=(b[i]==1);
		v.pb({b[i],a[i]});
	}
	if(cnt==n){
		cout<<n;
		return;
	}
//	abs(x[i] - x[j]) <= abs(y[i] - y[j]);
	int ans=0;
	map<int,int>mp; 
	for(int i=n;i>=1;i--){
		if(!mp[i]){
			ans++;
			for(int j=i-1;j>=1;j--){
				if(abs(v[i-1].F - v[j-1].F) >= abs(v[i-1].S - v[j-1].S))mp[j-1]=1;
			}
		}
	}
	cout<<ans;
}	
//BEKSULTAN TOP
signed main(){	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	if(T)cin>>t;
	while(t--)solve();
} 
# Verdict Execution time Memory Grader output
1 Runtime error 585 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 565 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 585 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -