Submission #131264

#	Time	Username	Problem	Language	Result	Execution time	Memory
131264		FedericoS	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2058 ms	152964 KiB

Main

#include <iostream>
#include <algorithm>
using namespace std;

int N;
int X[10000007];
int Y[10000007];
bool B[10000007];
int ans,a;

bool comp(int a, int b){
	return Y[a]>Y[b];
}

int main(){
	scanf("%d", &N);
	for(int i=0;i<N;i++)
		scanf("%d %d", &X[i], &Y[i]);

	a=-2e9-5;	
	for(int i=0;i<N;i++){
		if(a<X[i]+Y[i])
			a=X[i]+Y[i];
		else
			B[i]=true;
	}

	a=-2e9-5;
	for(int i=N-1;i>=0;i--){
		if(a<-X[i]+Y[i])
			a=-X[i]+Y[i];
		else
			B[i]=true;
	}

	for(int i=0;i<N;i++)
		ans+=!B[i];

	printf("%d\n", ans);


}

Compilation message (stderr)

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
lightningrod.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &X[i], &Y[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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