Submission #417982

#TimeUsernameProblemLanguageResultExecution timeMemory
417982gromperenLightning Rod (NOI18_lightningrod)C++17
80 / 100
2059 ms229364 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n; cin >> n;
	int ans = 0;
	int x, y;
	vector<int> pre(n),suf(n);
	for (int i = 0; i < n; ++i) {
		cin >> x>>y;
		pre[i] = x + y;
		if (i > 0) pre[i] = max(pre[i-1], pre[i]);
		suf[i] = y - x;
	}
	for (int i = n -1; i >= 0; --i) {
		if (i < n-1) suf[i] = max(suf[i+1],suf[i]);
	}
	for (int i = 0; i < n; ++i) {
		if (((i == 0) || pre[i] > pre[i-1]) && ((i == n-1) || suf[i] > suf[i+1])) {
			ans++;
		}
	}
	cout << ans << "\n";



	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...