제출 #205115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
205115		quocnguyen1012	Lightning Rod (NOI18_lightningrod)	C++14	100 / 100	540 ms	187040 KiB

Main

#include <bits/stdc++.h>
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;
}
 
int x,y;
stack<pair<int,int> > chosen;
 
int main(){
	int n=readInt();
	for (int i = 0; i < n; i++) {
		x = readInt();
		y = readInt();
        if (!chosen.empty() && x-chosen.top().first<=chosen.top().second-y) continue;
        while (!chosen.empty() && x-chosen.top().first<=y-chosen.top().second){
            chosen.pop();
        }
        chosen.push(make_pair(x,y));
    }
	cout<<chosen.size();
}

• 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