제출 #692713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
692713		zeroesandones	Lightning Rod (NOI18_lightningrod)	C++17	100 / 100	1726 ms	225040 KiB

Main

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

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

void solve()
{
    int n;
    cin >> n;

    int x[n], y[n];
    FOR(i, 0, n) {
        cin >> x[i] >> y[i];
    }

    stack<pair<int, int>> s;
    for(int i = 0; i < n; ++i) {
        bool add = true;
        while(!s.empty()) {
            auto [nx, ny] = s.top();
            if(x[i] - nx <= ny - y[i]) {
                add = false;
                break;
            }

            if(x[i] - nx <= y[i] - ny)
                s.pop();
            else
                break;
        }
        if(add)
            s.push({x[i], y[i]});
    }

    cout << s.size() << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

• 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