제출 #854407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854407		annabeth9680	Lightning Rod (NOI18_lightningrod)	C++17	100 / 100	1402 ms	189284 KiB

Main

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e7+11;
int P[MAXN][2];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N; cin >> N;
    int ans = 0;
    for(int i = 0;i<N;++i){ 
        int x,y; cin >> x >> y;
        while(ans > 0 && abs(P[ans-1][0]-x) <= y-P[ans-1][1]) ans--;
        if(ans > 0 && abs(P[ans-1][0]-x) <= P[ans-1][1]-y) continue; 
        P[ans][0] = x, P[ans][1] = y; ans++;
    }
    cout << ans << "\n";
    return 0;
}

• 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