oj.uz

답안 #721633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721633 2023-04-11T05:56:03 Z drdilyor Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 12360 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;
        for (int j = 0; j < n; j++) {
            if (ev[j].i == s) si = j;
            if (ev[j].i == e) ei = j;
        }
        vector memo(n+1, -1);
        auto dp = [&](auto& dp, int i)->int{
            int t = ev[i].r;
            if (i == ei) return 0;
            if (t > ev[ei].r) return inf;
            if (memo[i]!=-1) return memo[i];
            int res = inf;
            for (int j = i+1; j < n; j++) {
                if (ev[j].l <= t && t <= ev[j].r)
                    res = min(res, 1 + dp(dp, j));
            }
            return memo[i] = res;
        };
        int res = dp(dp, si);
        if (res < inf) 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 1566 ms 12308 KB Time limit exceeded
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 42 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 50 ms 448 KB Output is correct
8 Correct 43 ms 428 KB Output is correct
9 Correct 99 ms 340 KB Output is correct

Subtask #3
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 42 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 50 ms 448 KB Output is correct
8 Correct 43 ms 428 KB Output is correct
9 Correct 99 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 43 ms 340 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 9 ms 340 KB Output is correct
15 Correct 12 ms 340 KB Output is correct
16 Correct 46 ms 452 KB Output is correct
17 Correct 40 ms 340 KB Output is correct
18 Correct 97 ms 340 KB Output is correct
19 Execution timed out 1581 ms 852 KB Time limit exceeded
20 Halted 0 ms 0 KB -

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 42 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 50 ms 448 KB Output is correct
8 Correct 43 ms 428 KB Output is correct
9 Correct 99 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 43 ms 340 KB Output is correct
13 Correct 8 ms 340 KB Output is correct
14 Correct 9 ms 412 KB Output is correct
15 Correct 12 ms 340 KB Output is correct
16 Correct 46 ms 444 KB Output is correct
17 Correct 40 ms 340 KB Output is correct
18 Correct 97 ms 340 KB Output is correct
19 Execution timed out 1590 ms 12360 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1578 ms 12360 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 1566 ms 12308 KB Time limit exceeded
3 Halted 0 ms 0 KB -