oj.uz

Submission #313297

# Submission time Handle Problem Language Result Execution time Memory
313297 2020-10-15T17:07:42 Z kaplanbar Lightning Rod (NOI18_lightningrod) C++14
80 / 100
 2000 ms 233656 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e7+1;
int n;
pair<int,int> a[N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for(int i = 0; i < n; i++) {
      cin >> a[i].first >> a[i].second;
    } 
    vector<bool> v(n, 0);
    int mx = -2e9;
    for(int i = 0; i < n; i++) {
      int val = a[i].first + a[i].second;
      if(mx >= val) {
        v[i] = 1;
      }
      mx = max(mx, val);
    }
    mx = -2e9;
    for(int i = n - 1; i >= 0; i--) {
      int val = a[i].second - a[i].first;
      if(mx >= val) {
        v[i] = 1;
      }
      mx = max(mx, val);
    }
    int ans = 0;
    for(int i = 0; i < n; i++) ans += 1^v[i];
    cout << ans;
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1730 ms 190456 KB Output is correct
2 Correct 1684 ms 189728 KB Output is correct
3 Correct 1680 ms 184528 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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 1 ms 384 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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 1 ms 384 KB Output is correct
14 Correct 46 ms 5460 KB Output is correct
15 Correct 47 ms 5244 KB Output is correct
16 Correct 45 ms 4600 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1861 ms 176104 KB Output is correct
2 Correct 1748 ms 175720 KB Output is correct
3 Correct 1730 ms 171576 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1730 ms 190456 KB Output is correct
2 Correct 1684 ms 189728 KB Output is correct
3 Correct 1680 ms 184528 KB Output is correct
4 Correct 1 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 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 46 ms 5460 KB Output is correct
18 Correct 47 ms 5244 KB Output is correct
19 Correct 45 ms 4600 KB Output is correct
20 Correct 1861 ms 176104 KB Output is correct
21 Correct 1748 ms 175720 KB Output is correct
22 Correct 1730 ms 171576 KB Output is correct
23 Execution timed out 2063 ms 233656 KB Time limit exceeded
24 Halted 0 ms 0 KB -