제출 #169230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169230		aggu_01000101	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2076 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;
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    stack<pair<int, int>> st;
    for(int i =0 ;i<n;i++){
        int x, y;
        cin>>x>>y;
        while(!st.empty()){
            if(abs(x - st.top().first)<=(st.top().second - y)) goto nopush;
            if(abs(x - st.top().first)<=(y-st.top().second)) st.pop();
            else goto push;
        }
        push:
        st.push(make_pair(x, y));
        nopush:
        continue;
    }
    cout<<st.size()<<endl;
}

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