oj.uz

답안 #548728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548728 2022-04-14T10:52:43 Z jack715 Lightning Rod (NOI18_lightningrod) C++14
11 / 100
 1556 ms 262244 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

bool protect(pair<int, int>& a, pair<int, int>& b) {
    return (abs(a.ff-b.ff) <= a.ss-b.ss);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, a, b, ans = 1;
    cin >> n;
    stack<pair<int, int> > select;
    vector<pair<int, int> > nums(n), prot(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i].ff >> nums[i].ss;
        prot[i] = nums[i];
    }
    
    select.push(nums[0]);
    for (int i = 1; i < n; i++) {
        if (protect(prot[i-1], nums[i]))
            continue;
        while (!select.empty() && protect(nums[i], select.top())) {
            ans--;
            select.pop();
        }
        ans++;        
        select.push(nums[i]);
    }

    cout << ans << '\n';
    return 0;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:18:12: warning: unused variable 'a' [-Wunused-variable]
   18 |     int n, a, b, ans = 1;
      |            ^
lightningrod.cpp:18:15: warning: unused variable 'b' [-Wunused-variable]
   18 |     int n, a, b, ans = 1;
      |               ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1531 ms 262144 KB Output is correct
2 Correct 1554 ms 262144 KB Output is correct
3 Correct 1464 ms 262144 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1556 ms 262244 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1531 ms 262144 KB Output is correct
2 Correct 1554 ms 262144 KB Output is correct
3 Correct 1464 ms 262144 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -