#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define F first
#define S second
#define pb push_back
using namespace std;
stack<pair<int, int > > st;
int check(pair<int, int > a, pair<int, int > b) {
int c = b.F - a.F;
if (a.S - b.S >= c) return 1;
if (b.S - a.S >= c) return 2;
return 0;
}
void solve() {
int n; cin >> n;
for (int i = 0; i < n; i++) {
int a, b; cin >> a >> b;
if (i == 0) {st.push({a, b}); continue ;}
while (!st.empty()) {
int x = check(st.top(), {a, b});
if (x == 2) st.pop();
else if (x == 1) break ;
else {st.push({a, b}); break ;}
}
}
cout << st.size();
}
signed main(){IOS solve(); return 0;}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1535 ms |
159120 KB |
Output is correct |
2 |
Correct |
1721 ms |
158824 KB |
Output is correct |
3 |
Correct |
1631 ms |
154476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1370 ms |
300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1535 ms |
159120 KB |
Output is correct |
2 |
Correct |
1721 ms |
158824 KB |
Output is correct |
3 |
Correct |
1631 ms |
154476 KB |
Output is correct |
4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |