oj.uz

답안 #721678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721678 2023-04-11T06:30:54 Z drdilyor Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 9480 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 ;
    });


    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;
        }

        int res = 0;
        bool found = 0;
        int left = ev[ei].l;
        set<int> st;
        for (int j = ei-1; j >= 0; j--) {
            auto [l,r,_i] = ev[j];
            if (r < left) {
                if (st.empty()) break;
                left = *st.begin();
                if (r < left) break;
                st.clear();
                res++;
            }
            if (j == si) {
                res++;
                found = 1;
                break;
            }
            st.insert(l);
            continue;
        }


        if (found) cout << res << '\n';
        else cout << "impossible\n";
    }

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1579 ms 7308 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Execution timed out 1566 ms 932 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 5 ms 448 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 426 ms 7340 KB Output is correct
20 Correct 244 ms 7244 KB Output is correct
21 Correct 598 ms 9480 KB Output is correct
22 Incorrect 259 ms 9040 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1584 ms 7288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1579 ms 7308 KB Time limit exceeded
3 Halted 0 ms 0 KB -