제출 #496847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
496847		SirCovidThe19th	Lightning Rod (NOI18_lightningrod)	C++17	100 / 100	1692 ms	88000 KiB

Main

#include <bits/stdc++.h>
using namespace std; 

#define FOR(i, x, y) for (int i = x; i < y; i++)
#define pii pair<int, int>
#define f first
#define s second

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); 
    int n; cin >> n; 
    bool covered[n] = {}; pii A[n]; int H = -1; 
    FOR(i, 0, n){
        cin >> A[i].f >> A[i].s;
        if (A[i].f + A[i].s <= H) covered[i] = 1; //covered by something before
        else H = A[i].f + A[i].s;
    }
    H = 2e9;
    for (int i = n - 1; ~i; i--){ 
        if (A[i].f - A[i].s >= H) covered[i] = 1; //covered by something after
        else H = A[i].f - A[i].s;
    }
    cout<<n - accumulate(covered, covered + n, 0)<<endl;
}

• Subtask 1: 4 / 4
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 26 / 26
• Subtask 6: 10 / 10
• Subtask 7: 20 / 20