제출 #1297190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1297190		chaitanyamehta	Lightning Rod (NOI18_lightningrod)	C++20	0 / 100	1115 ms	443672 KiB

Main

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

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

    int N;
    cin >> N;

    vector<int64> A(N), B(N);
    vector<int64> X(N), Y(N);

    for (int i = 0; i < N; ++i) {
        cin >> X[i] >> Y[i];
        A[i] = X[i] + Y[i];
        B[i] = Y[i] - X[i];
    }

    // prefix max B
    vector<int64> prefB(N);
    prefB[0] = B[0];
    for (int i = 1; i < N; ++i)
        prefB[i] = max(prefB[i-1], B[i]);

    // suffix max A
    vector<int64> suffA(N);
    suffA[N-1] = A[N-1];
    for (int i = N-2; i >= 0; --i)
        suffA[i] = max(suffA[i+1], A[i]);

    long long rods = 0;

    for (int i = 0; i < N; ++i) {
        bool coveredLeft  = (i > 0 && prefB[i-1] >= B[i]);
        bool coveredRight = (i+1 < N && suffA[i+1] >= A[i]);
        if (!coveredLeft && !coveredRight)
            rods++;
    }

    cout << rods << "\n";
}

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