Submission #417980

# Submission time Handle Problem Language Result Execution time Memory
417980 2021-06-04T18:13:39 Z gromperen Lightning Rod (NOI18_lightningrod) C++14
70 / 100
2000 ms 262144 KB
#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;
	vector<int>x(n), y(n);
	for (int i = 0; i < n; ++i) {
		cin >> x[i] >> y[i];
	}

	vector<int> pre(n),suf(n);
	for (int i = 0; i < n; ++i) {
		pre[i] = x[i] + y[i];
		if (i > 0) pre[i] = max(pre[i-1], pre[i]);
	}
	for (int i = n-1; i >= 0; --i) {
		suf[i] = y[i] - x[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 time Memory Grader output
1 Correct 1923 ms 154868 KB Output is correct
2 Correct 1961 ms 262144 KB Output is correct
3 Correct 1934 ms 256840 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 49 ms 6788 KB Output is correct
15 Correct 53 ms 6684 KB Output is correct
16 Correct 51 ms 5908 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 2057 ms 156312 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1923 ms 154868 KB Output is correct
2 Correct 1961 ms 262144 KB Output is correct
3 Correct 1934 ms 256840 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 372 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 49 ms 6788 KB Output is correct
18 Correct 53 ms 6684 KB Output is correct
19 Correct 51 ms 5908 KB Output is correct
20 Execution timed out 2057 ms 156312 KB Time limit exceeded
21 Halted 0 ms 0 KB -