Submission #743063

#	Time	Username	Problem	Language	Result	Execution time	Memory
743063		Joo	Lightning Rod (NOI18_lightningrod)	C++17	80 / 100	2011 ms	115888 KiB

Main

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

const int MXN = 1e7 + 10;

int x[MXN], y[MXN];

inline bool isContain(int i, int j)
{
    return (abs(x[i] - x[j]) <= y[i] - y[j]);
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    stack<int> st;
    for (int i = 1; i <= n; i++)
    {
        cin >> x[i] >> y[i];
        while (!st.empty() and isContain(i, st.top()))
            st.pop();
        if (st.empty() or !isContain(st.top(), i))
            st.push(i);
    }
    cout << st.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: 0 / 20