Submission #169233

#	Time	Username	Problem	Language	Result	Execution time	Memory
169233		aggu_01000101	Lightning Rod (NOI18_lightningrod)	C++14	100 / 100	510 ms	262144 KiB

Main

    #include <iostream>
    #include <algorithm>
    #include <cmath>
    #include <unordered_map>
    #include <fstream>
    #include <stack>
    #include <vector>
    #include <set>
    #include <queue>
    #include <cstdlib>
    #include <cstring>
    #include <map>
    #define int long long
    using namespace std;
    inline int readInt() {
        int x = 0;
        char ch = getchar_unlocked();
        while (ch < '0' || ch > '9') ch = getchar_unlocked();
        while (ch >= '0' && ch <= '9'){
            x = (x << 3) + (x << 1) + ch - '0';
            ch = getchar_unlocked();
        }
        return x;
    }
    int32_t main(){
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
        int n = readInt();
        stack<pair<int, int>> st;
        for(int i =0 ;i<n;i++){
            int x = readInt(), y = readInt();
            bool toadd = true;
            bool cont = true;
            while(st.size() && cont){
                if(abs(x - st.top().first)<=(st.top().second - y)) toadd = cont = false;
                else if(abs(x - st.top().first)<=(y-st.top().second)) st.pop();
                else cont = false;
            }
            if(toadd) st.push(make_pair(x, y));
        }
        cout<<st.size()<<endl;
    }

• 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