oj.uz

답안 #515943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
515943 2022-01-20T07:25:45 Z Joo Lightning Rod (NOI18_lightningrod) C++17
100 / 100
 382 ms 80056 KB 
#include <bits/stdc++.h>
using namespace std;


inline void read(int& x) {
    x = 0;
    char ch = getchar_unlocked();
    while (ch&16){
		x = (x << 3) + (x << 1) + (ch&15);
		ch = getchar_unlocked();
	}
}

int main(void){
    int n; read(n);
    stack<pair<int, int>> st;

    for(int i = 1; i <= n; i++){
        int x, y; read(x), read(y);
        while(!st.empty() and x-st.top().first <= y-st.top().second) st.pop();
        if(st.empty() or (x-st.top().first > y-st.top().second and x-st.top().first > st.top().second-y)) st.push({x, y});
    }

    printf("%d\n", st.size());

    return 0;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:24:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::stack<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wformat=]
   24 |     printf("%d\n", st.size());
      |             ~^     ~~~~~~~~~
      |              |            |
      |              int          std::stack<std::pair<int, int> >::size_type {aka long unsigned int}
      |             %ld

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 80056 KB Output is correct
2 Correct 230 ms 79668 KB Output is correct
3 Correct 210 ms 77552 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 9 ms 1048 KB Output is correct
15 Correct 11 ms 1172 KB Output is correct
16 Correct 10 ms 1788 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 51520 KB Output is correct
2 Correct 283 ms 51492 KB Output is correct
3 Correct 211 ms 50160 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 80056 KB Output is correct
2 Correct 230 ms 79668 KB Output is correct
3 Correct 210 ms 77552 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 9 ms 1048 KB Output is correct
18 Correct 11 ms 1172 KB Output is correct
19 Correct 10 ms 1788 KB Output is correct
20 Correct 232 ms 51520 KB Output is correct
21 Correct 283 ms 51492 KB Output is correct
22 Correct 211 ms 50160 KB Output is correct
23 Correct 382 ms 740 KB Output is correct
24 Correct 343 ms 692 KB Output is correct
25 Correct 299 ms 3296 KB Output is correct