oj.uz

답안 #1116546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116546 2024-11-21T19:43:10 Z Pekiban Fire (BOI24_fire) C++17
100 / 100
 412 ms 74160 KB 
#include <bits/stdc++.h>
 
using namespace std;
#define pb push_back
 
const int N = 4e5+5, LOG = 18;
vector<long long> B;
map<int, int> go, f;
int up[N][LOG];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        int s, e;
        cin >> s >> e;
        // e++;
        if (s >= e)  e += m;
        B.pb(s); B.pb(e);
        go[s] = max(go[s], e);
    }
    sort(B.begin(), B.end());
    B.erase(unique(B.begin(), B.end()), B.end());
    for (int i = 0; i < B.size(); ++i)  f[B[i]] = i;
    for (int i = 0; i < B.size(); ++i)  up[i][0] = max({up[i][0], f[go[B[i]]], i});
    for (int i = 1; i < B.size(); ++i)  up[i][0] = max(up[i-1][0], up[i][0]);
    for (int j = 1; j < LOG; ++j) {
        for (int i = 0; i < B.size(); ++i)  up[i][j] = up[up[i][j-1]][j-1];
    }
    int ans = 1e9;
    for (int i = 0; i < B.size(); ++i) {
        int x = i, c = 0;
        for (int j = LOG-1; j >= 0; --j) {
            if (B[up[x][j]] <= B[i] + m - 1) {
                x = up[x][j], c += (1 << j);
            }
        }
        if (B[up[x][0]] >= B[i] + m)    ans = min(ans, c + 1);
    }
    cout << (ans > n ? -1 : ans) << '\n';
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i = 0; i < B.size(); ++i)  f[B[i]] = i;
      |                     ~~^~~~~~~~~~
Main.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int i = 0; i < B.size(); ++i)  up[i][0] = max({up[i][0], f[go[B[i]]], i});
      |                     ~~^~~~~~~~~~
Main.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = 1; i < B.size(); ++i)  up[i][0] = max(up[i-1][0], up[i][0]);
      |                     ~~^~~~~~~~~~
Main.cpp:29:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for (int i = 0; i < B.size(); ++i)  up[i][j] = up[up[i][j-1]][j-1];
      |                         ~~^~~~~~~~~~
Main.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < B.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 504 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 1 ms 760 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 436 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 504 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 1 ms 760 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 436 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 7 ms 2128 KB Output is correct
40 Correct 7 ms 2128 KB Output is correct
41 Correct 7 ms 2384 KB Output is correct
42 Correct 5 ms 1360 KB Output is correct
43 Correct 4 ms 1212 KB Output is correct
44 Correct 5 ms 1400 KB Output is correct
45 Correct 5 ms 1400 KB Output is correct
46 Correct 5 ms 1528 KB Output is correct
47 Correct 7 ms 2128 KB Output is correct
48 Correct 6 ms 2128 KB Output is correct
49 Correct 5 ms 2304 KB Output is correct
50 Correct 4 ms 1364 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 7 ms 2188 KB Output is correct
16 Correct 5 ms 1360 KB Output is correct
17 Correct 4 ms 1236 KB Output is correct
18 Correct 5 ms 1528 KB Output is correct
19 Correct 7 ms 2128 KB Output is correct
20 Correct 26 ms 7368 KB Output is correct
21 Correct 378 ms 73932 KB Output is correct
22 Correct 358 ms 74096 KB Output is correct
23 Correct 234 ms 40296 KB Output is correct
24 Correct 343 ms 73904 KB Output is correct
25 Correct 219 ms 33968 KB Output is correct
26 Correct 248 ms 41136 KB Output is correct
27 Correct 226 ms 41176 KB Output is correct
28 Correct 344 ms 72368 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 7 ms 2128 KB Output is correct
13 Correct 5 ms 1360 KB Output is correct
14 Correct 5 ms 1360 KB Output is correct
15 Correct 26 ms 7368 KB Output is correct
16 Correct 253 ms 40112 KB Output is correct
17 Correct 374 ms 74160 KB Output is correct
18 Correct 365 ms 74160 KB Output is correct
19 Correct 370 ms 74036 KB Output is correct
20 Correct 248 ms 40164 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 508 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 504 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 1 ms 760 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 592 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 436 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 7 ms 2128 KB Output is correct
40 Correct 7 ms 2128 KB Output is correct
41 Correct 7 ms 2384 KB Output is correct
42 Correct 5 ms 1360 KB Output is correct
43 Correct 4 ms 1212 KB Output is correct
44 Correct 5 ms 1400 KB Output is correct
45 Correct 5 ms 1400 KB Output is correct
46 Correct 5 ms 1528 KB Output is correct
47 Correct 7 ms 2128 KB Output is correct
48 Correct 6 ms 2128 KB Output is correct
49 Correct 5 ms 2304 KB Output is correct
50 Correct 4 ms 1364 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 2 ms 504 KB Output is correct
65 Correct 7 ms 2188 KB Output is correct
66 Correct 5 ms 1360 KB Output is correct
67 Correct 4 ms 1236 KB Output is correct
68 Correct 5 ms 1528 KB Output is correct
69 Correct 7 ms 2128 KB Output is correct
70 Correct 26 ms 7368 KB Output is correct
71 Correct 378 ms 73932 KB Output is correct
72 Correct 358 ms 74096 KB Output is correct
73 Correct 234 ms 40296 KB Output is correct
74 Correct 343 ms 73904 KB Output is correct
75 Correct 219 ms 33968 KB Output is correct
76 Correct 248 ms 41136 KB Output is correct
77 Correct 226 ms 41176 KB Output is correct
78 Correct 344 ms 72368 KB Output is correct
79 Correct 1 ms 336 KB Output is correct
80 Correct 1 ms 336 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 504 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 7 ms 2128 KB Output is correct
91 Correct 5 ms 1360 KB Output is correct
92 Correct 5 ms 1360 KB Output is correct
93 Correct 26 ms 7368 KB Output is correct
94 Correct 253 ms 40112 KB Output is correct
95 Correct 374 ms 74160 KB Output is correct
96 Correct 365 ms 74160 KB Output is correct
97 Correct 370 ms 74036 KB Output is correct
98 Correct 248 ms 40164 KB Output is correct
99 Correct 365 ms 73956 KB Output is correct
100 Correct 412 ms 74096 KB Output is correct
101 Correct 377 ms 73896 KB Output is correct
102 Correct 374 ms 73972 KB Output is correct
103 Correct 269 ms 41136 KB Output is correct
104 Correct 354 ms 70896 KB Output is correct
105 Correct 296 ms 72880 KB Output is correct