답안 #1062066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062066	2024-08-16T18:16:26 Z	Jarif_Rahman	Fire (BOI24_fire)	C++17	14 / 100	2000 ms	13748 KB

Main

#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m; cin >> n >> m;
    vector<pair<int, int>> A(n);
    for(auto &[x, y]: A){
        cin >> x >> y;
        if(x > y) y+=m;
    }
    sort(A.begin(), A.end());

    map<int, vector<int>> L, R;
    for(int i = 0; i < n; i++){
        L[A[i].first].push_back(i);
        if(A[i].second < m) R[A[i].second].push_back(i);
    }

    vector<int> nxt(n, -1);
    set<pair<int, int>> st;
    while(!L.empty() || !R.empty()){
        if(R.empty() || (!L.empty() && L.begin()->first <= R.begin()->first)){
            auto [t, a] = *L.begin();
            L.erase(L.begin());
            for(int i: a) st.insert({A[i].second, i});
        }
        else{
            auto [t, a] = *R.begin();
            R.erase(R.begin());
            for(int i: a){
                st.erase({A[i].second, i});
                int mx = A[i].second, j = -1;
                for(auto [_, k]: st){
                    if(A[k].first > A[i].first && A[k].second > mx) mx = A[k].second, j = k;
                }
                nxt[i] = j;
            }
        }
    }

    vector<int> cnt(n, 0), mx(n, 0);
    int ans = 1e9;
    for(int i = n-1; i >= 0; i--){
        if(nxt[i] == -1){
            if(A[i].second >= m) cnt[i] = 1, mx[i] = A[i].second-m;
        }
        else if(cnt[nxt[i]] != 0){
            cnt[i] = cnt[nxt[i]]+1;
            mx[i] = mx[nxt[i]];
            if(mx[i] >= A[i].first) ans = min(ans, cnt[i]);
        }
    }

    if(ans > n) ans = -1;
    cout << ans << "\n";
}

Subtask #1
14.0 / 14.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	456 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	344 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	348 KB	Output is correct
22	Correct	452 KB	Output is correct
23	Correct	460 KB	Output is correct

Subtask #2
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	456 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	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	452 KB	Output is correct
23	Correct	0 ms	460 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Incorrect	1 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #3
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	456 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	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	452 KB	Output is correct
23	Correct	0 ms	460 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Incorrect	1 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #4
0 / 13.0

#	결과	실행 시간	메모리	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	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	424 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	4 ms	1628 KB	Output is correct
16	Correct	4 ms	1628 KB	Output is correct
17	Correct	27 ms	1372 KB	Output is correct
18	Correct	3 ms	1628 KB	Output is correct
19	Correct	3 ms	1628 KB	Output is correct
20	Execution timed out	2017 ms	13748 KB	Time limit exceeded
21	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	1 ms	348 KB	Output is correct
6	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1624 KB	Output is correct
13	Correct	3 ms	1628 KB	Output is correct
14	Correct	3 ms	1448 KB	Output is correct
15	Execution timed out	2095 ms	13576 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-

Subtask #6
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	456 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	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	452 KB	Output is correct
23	Correct	0 ms	460 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Incorrect	1 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

답안 #1062066

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 0 / 17.0

Subtask #3 0 / 9.0

Subtask #4 0 / 13.0

Subtask #5 0 / 21.0

Subtask #6 0 / 26.0

Subtask #1
14.0 / 14.0

Subtask #2
0 / 17.0

Subtask #3
0 / 9.0

Subtask #4
0 / 13.0

Subtask #5
0 / 21.0

Subtask #6
0 / 26.0