제출 #654648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654648		horiseun	Lightning Rod (NOI18_lightningrod)	C++11	100 / 100	1725 ms	175444 KiB

Main

#include <iostream>
#include <stack>
#include <tuple>
#include <algorithm>
using namespace std;

#define f first
#define s second

int n, x, y, cx, cy;
stack<pair<int, int>> s;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        bool inc = true;
        while (s.size()) {
            tie(cx, cy) = s.top();
            if (x - cx <= cy - y) {
                inc = false;
                break;
            }
            if (x - cx <= y - cy) s.pop();
            else break;
        }
        if (inc) s.push({x, y});
    }

    cout << s.size() << "\n";


}

• 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