제출 #1264150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1264150		sohamsen15	Lightning Rod (NOI18_lightningrod)	C++20	80 / 100	1012 ms	156368 KiB

Main

#include <iostream>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, ans = 0, x, y; cin >> n; if (n == 1) { cout << 1; return 0; }
    int a[n], b[n], maxal[n], minbr[n];
    for (int i = 0; i < n; i++) { cin >> x >> y; a[i] = x + y, b[i] = x - y; }
    maxal[0] = a[0]; for (int i = 1; i < n; i++) maxal[i] = max(maxal[i - 1], a[i]);
    minbr[n - 1] = b[n - 1]; for (int i = n - 2; i >= 0; i--) minbr[i] = min(minbr[i + 1], b[i]);
    ans += (b[0] < minbr[1]) + (a[n - 1] > maxal[n - 2]);
    for (int i = 1; i < n - 1; i++) ans += (b[i] < minbr[i + 1] && a[i] > maxal[i - 1]);
    cout << ans;
}

• 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: 0 / 20