oj.uz

답안 #721845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721845 2023-04-11T07:51:16 Z drdilyor Event Hopping (BOI22_events) C++17
25 / 100
 699 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
 
 
const int inf = 1e9 + 1e5;
struct event {
    int l, r, i;
};
 
int main() {
    int n, m;
    cin >> n >> m;
    vector<event> ev(n), og;
    map<int,int> comp;
    int _i = 0;
    for (auto& [s, e, i] : ev) {
        cin >> s >> e;
        comp[s] = comp[e] = 0;
        i = _i++;
    }
    int k = 0;
    for (auto& mp : comp)
        mp.second = k++;
    for (auto& [s, e, i] : ev)
        s = comp[s], e = comp[e];
 
    og = ev;
    sort(ev.begin(), ev.end(), [&](auto& a, auto& b) {
        return a.r == b.r ? a.l < b.l : a.r < b.r ;
    });
    //for (auto[a,b,c] : ev) cout << a << ' ' << b << ' ' << c <<'\n';
 
    vector ans(n, vector(n, inf));

    vector<int> mnl(k, inf);
    for (auto [l, r, i] :ev) {
        mnl[r] = min(mnl[r], l);
    }

    for (int ei = n-1; ei >= 0; ei--) {
        int res = 0;
        int lb = ev[ei].l, rb = ev[ei].r;
        for (int j = n-1; j >= 0; j--) {
            auto [l,r,_i] = ev[j];
            if (r > ev[ei].r) continue;
            if (r < lb) {
                int mn = inf;
                for (int i = lb; i <= rb; i++)
                    mn = min(mn, mnl[i]);
                lb = mn;
                if (r < lb) break;
                rb = r;
                res++;
            }
            ans[ei][j] = res + 1;
        }
    }

    while (m--) {
        int s, e;
        cin >> s >> e;
        s--;e--;
 
        if (s == e) {
            cout << "0\n";
            continue;
        }

        int si = 0, ei = 0;
        for (int j = 0; j < n; j++) {
            if (ev[j].i == s) si = j;
            if (ev[j].i == e) ei = j;
        }
 
        if (ans[ei][si] < inf) cout << ans[ei][si] << '\n';
        else cout << "impossible\n";
    }
 
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 339 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 4308 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 7 ms 4308 KB Output is correct
9 Correct 6 ms 4180 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 4308 KB Output is correct
13 Correct 5 ms 4436 KB Output is correct
14 Correct 5 ms 4320 KB Output is correct
15 Correct 5 ms 4308 KB Output is correct
16 Correct 6 ms 4308 KB Output is correct
17 Correct 5 ms 4308 KB Output is correct
18 Correct 5 ms 4180 KB Output is correct
19 Correct 669 ms 99892 KB Output is correct
20 Correct 678 ms 99892 KB Output is correct
21 Correct 699 ms 100264 KB Output is correct
22 Correct 656 ms 100296 KB Output is correct
23 Correct 692 ms 100632 KB Output is correct
24 Correct 661 ms 100576 KB Output is correct
25 Correct 663 ms 100324 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 4308 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 5 ms 4308 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 7 ms 4308 KB Output is correct
9 Correct 6 ms 4180 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 4308 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 5 ms 4308 KB Output is correct
16 Correct 6 ms 4384 KB Output is correct
17 Correct 5 ms 4308 KB Output is correct
18 Correct 5 ms 4192 KB Output is correct
19 Runtime error 345 ms 524288 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 356 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 339 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -