Submission #155201

#	Time	Username	Problem	Language	Result	Execution time	Memory
155201		dolphingarlic	Lightning Rod (NOI18_lightningrod)	C++14	7 / 100	2074 ms	137320 KiB

Main

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

int pos[MAXN], neg[MAXN];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int x, y;
        cin >> x >> y;
        pos[i] = x + y, neg[i] = x - y;
    }
    queue<pair<int, int>> mono;
    for (int i = N - 1; ~i; i--) {
        while (mono.size() && pos[i] >= mono.front().first) mono.pop();
        if (!mono.size() || mono.front().second > neg[i]) mono.push({pos[i], neg[i]});
    }
    cout << mono.size();
}

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