답안 #854407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854407 2023-09-27T10:50:25 Z annabeth9680 Lightning Rod (NOI18_lightningrod) C++17
100 / 100
1402 ms 189284 KB
#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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1104 ms 189284 KB Output is correct
2 Correct 1132 ms 188964 KB Output is correct
3 Correct 1068 ms 184068 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 28 ms 3924 KB Output is correct
15 Correct 29 ms 3640 KB Output is correct
16 Correct 29 ms 5200 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1159 ms 146420 KB Output is correct
2 Correct 1102 ms 146052 KB Output is correct
3 Correct 1151 ms 143480 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1104 ms 189284 KB Output is correct
2 Correct 1132 ms 188964 KB Output is correct
3 Correct 1068 ms 184068 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 28 ms 3924 KB Output is correct
18 Correct 29 ms 3640 KB Output is correct
19 Correct 29 ms 5200 KB Output is correct
20 Correct 1159 ms 146420 KB Output is correct
21 Correct 1102 ms 146052 KB Output is correct
22 Correct 1151 ms 143480 KB Output is correct
23 Correct 1402 ms 175720 KB Output is correct
24 Correct 1318 ms 157304 KB Output is correct
25 Correct 1234 ms 142168 KB Output is correct