제출 #423875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423875		faresbasbs	Lightning Rod (NOI18_lightningrod)	C++14	100 / 100	633 ms	262144 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[10000000], Y[10000000];

int main(){
	int N = readInt();
	stack<pair<int,int>> st;
	for(int i = 0; i < N; i++) {
		X[i] = readInt();
		Y[i] = readInt();
		while(true){
			if(st.size() && X[i]-st.top().first <= Y[i]-st.top().second){
				st.pop();
			}else if(st.size() && st.top().first-X[i] >= Y[i]-st.top().second){
				break;
			}else{
				st.push({X[i],Y[i]});
				break;
			}
		}
	}
	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