Submission #313306

# Submission time Handle Problem Language Result Execution time Memory
313306 2020-10-15T17:14:34 Z kaplanbar Lightning Rod (NOI18_lightningrod) C++14
80 / 100
2000 ms 79864 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e7+1;
int n;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    vector<bool> v(n);
    vector<pair<int,int>> a(n);
    for(int i = 0; i < n; i++) {
      cin >> a[i].first >> a[i].second;
    }
    int mx = -2000000000;
    for(int i = 0; i < n; i++) {
      int val = a[i].first + a[i].second;
      if(mx >= val) {
        v[i] = 1;
      }
      else {
        mx = val;
      }
    }
    mx = -2000000000;
    for(int i = n - 1; i >= 0; i--) {
      int val = a[i].second - a[i].first;
      if(mx >= val) {
        v[i] = 1;
      }
      else {
        mx = val;
      }
    }
    int ans = 0;
    for(int i = 0; i < n; i++) ans += v[i];
    cout << n-ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1703 ms 77688 KB Output is correct
2 Correct 1708 ms 77304 KB Output is correct
3 Correct 1665 ms 75384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 43 ms 2048 KB Output is correct
15 Correct 45 ms 2048 KB Output is correct
16 Correct 41 ms 1920 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1731 ms 79864 KB Output is correct
2 Correct 1752 ms 79816 KB Output is correct
3 Correct 1685 ms 77816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1703 ms 77688 KB Output is correct
2 Correct 1708 ms 77304 KB Output is correct
3 Correct 1665 ms 75384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 43 ms 2048 KB Output is correct
18 Correct 45 ms 2048 KB Output is correct
19 Correct 41 ms 1920 KB Output is correct
20 Correct 1731 ms 79864 KB Output is correct
21 Correct 1752 ms 79816 KB Output is correct
22 Correct 1685 ms 77816 KB Output is correct
23 Execution timed out 2090 ms 72568 KB Time limit exceeded
24 Halted 0 ms 0 KB -