oj.uz

답안 #657501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
657501 2022-11-10T01:57:26 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
25 / 100
 6000 ms 111220 KB 
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()

const int inf = 1e9+10;
const int maxn = 3e5+10;

int n, m, k;
int szrt[maxn], idrt[maxn], thrt[maxn], isrt[maxn], dlol[maxn];
vector<int> g[maxn], d[maxn];

int32_t main() {
    // freopen("in.in", "r", stdin);

    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u,v; cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    cin >> k;
    for(int i = 1; i <= k; i++) {
        cin >> szrt[i];
        for(int j = 0; j < szrt[i]; j++) {
            int v; cin >> v;
            idrt[v] = i;
            isrt[v] = 1;
            thrt[v] = j;
        }
    }

    szrt[0] = 1;
    for(int i = 1; i <= n; i++) {
        dlol[i] = inf;
        if(isrt[i]) {
            for(int j = 0; j < szrt[idrt[i]]; j++) {
                d[i].pb(inf);
            }
        }
        else {
            d[i].pb(inf);
        }

    }

    d[1][0] = 0;
    priority_queue<pair<int,pair<int,int>>, vector<pair<int,pair<int,int>>>, greater<pair<int,pair<int,int>>>> pq;
    pq.push(mp(0,mp(1,0)));
    while(pq.size()) {
        int u = pq.top().sc.fr;
        int t = pq.top().sc.sc;
        int dist = pq.top().fr;
        pq.pop();

        if(t != -1 && dist != d[u][t]) continue;
        if(t == -1 && dist != dlol[u]) continue;

        if(t == -1) {
            for(auto v : g[u]) {
                if(isrt[v]) continue;
                int d1 = dlol[u]+1;
                int t1 = 0;
                if(d[v][t1] > d1) {
                    d[v][t1] = d1;
                    pq.push(mp(d[v][t1],mp(v,t1)));
                }
            }
            continue;
        }

        if(isrt[u]) {
            for(auto v : g[u]) {
                if(isrt[v]) {
                    int d1 = d[u][t]+1;
                    int t1 = d1%szrt[idrt[v]];
                    // Vou encontrar o guarda em v ou indo para v
                    // indo para v == u é depois de v e em t1 ele vai estar em u
                    if(t1 == thrt[v] || (thrt[u] == (thrt[v]+1)%szrt[idrt[u]] && t1 == thrt[u])) continue;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        pq.push(mp(d[v][t1],mp(v,t1)));
                    }
                }
                // else {
                //     int d1 = d[u][t]+1;
                //     int t1 = 0;
                //     if(d[v][t1] > d1) {
                //         d[v][t1] = d1;
                //         pq.push(mp(d[v][t1],mp(v,t1)));
                //     }
                // }
                if(dlol[u] > d[u][t]) {
                    dlol[u] = d[u][t];
                    pq.push(mp(dlol[u],mp(u,-1)));
                }
            }
        }
        else {
            for(auto v : g[u]) {
                if(isrt[v]) {
                    // d[u][t]+1+i = (thrt[v]+1) MOD
                    // i = trrt[v]-d[u][t] MOD
                    int i = ((thrt[v]-d[u][t])%szrt[idrt[v]]+szrt[idrt[v]])%szrt[idrt[v]];
                    int d1 = d[u][t]+1+i;
                    int t1 = d1%szrt[idrt[v]];
                    if(t1 == thrt[v]) continue;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        pq.push(mp(d[v][t1],mp(v,t1)));
                    }
                    d1 = d[u][t]+1;
                    t1 = d1%szrt[idrt[v]];
                    if(t1 == thrt[v]) continue;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        pq.push(mp(d[v][t1],mp(v,t1)));
                    }
                }
                else {
                    int d1 = d[u][t]+1;
                    int t1 = 0;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        pq.push(mp(d[v][t1],mp(v,t1)));
                    }
                }
            }
        }
    }

    if(d[n][0] == inf) cout << "impossible" << endl;
    else cout << d[n][0] << endl;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 15308 KB Output is correct
2 Correct 110 ms 21928 KB Output is correct
3 Correct 118 ms 21972 KB Output is correct
4 Correct 135 ms 22028 KB Output is correct
5 Correct 10 ms 14404 KB Output is correct
6 Correct 114 ms 21868 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 15356 KB Output is correct
2 Correct 119 ms 21944 KB Output is correct
3 Correct 114 ms 21976 KB Output is correct
4 Correct 144 ms 22028 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 102 ms 21828 KB Output is correct
7 Correct 108 ms 21884 KB Output is correct
8 Correct 126 ms 21852 KB Output is correct
9 Correct 103 ms 21816 KB Output is correct
10 Correct 115 ms 22108 KB Output is correct
11 Correct 113 ms 21932 KB Output is correct
12 Correct 105 ms 21904 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 15356 KB Output is correct
2 Correct 119 ms 21944 KB Output is correct
3 Correct 114 ms 21976 KB Output is correct
4 Correct 144 ms 22028 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 102 ms 21828 KB Output is correct
7 Correct 108 ms 21884 KB Output is correct
8 Correct 126 ms 21852 KB Output is correct
9 Correct 103 ms 21816 KB Output is correct
10 Correct 115 ms 22108 KB Output is correct
11 Correct 113 ms 21932 KB Output is correct
12 Correct 105 ms 21904 KB Output is correct
13 Correct 73 ms 15868 KB Output is correct
14 Correct 135 ms 22456 KB Output is correct
15 Correct 121 ms 21964 KB Output is correct
16 Correct 149 ms 22024 KB Output is correct
17 Correct 9 ms 14456 KB Output is correct
18 Correct 131 ms 21904 KB Output is correct
19 Correct 106 ms 21856 KB Output is correct
20 Correct 106 ms 21868 KB Output is correct
21 Correct 106 ms 21808 KB Output is correct
22 Correct 114 ms 22188 KB Output is correct
23 Correct 107 ms 21836 KB Output is correct
24 Correct 109 ms 21836 KB Output is correct
25 Correct 2532 ms 65572 KB Output is correct
26 Correct 2608 ms 70324 KB Output is correct
27 Correct 2488 ms 66004 KB Output is correct
28 Correct 2164 ms 69880 KB Output is correct
29 Correct 3643 ms 61024 KB Output is correct
30 Correct 4259 ms 80856 KB Output is correct
31 Correct 2681 ms 87596 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 15356 KB Output is correct
2 Correct 119 ms 21944 KB Output is correct
3 Correct 114 ms 21976 KB Output is correct
4 Correct 144 ms 22028 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 102 ms 21828 KB Output is correct
7 Correct 108 ms 21884 KB Output is correct
8 Correct 126 ms 21852 KB Output is correct
9 Correct 103 ms 21816 KB Output is correct
10 Correct 115 ms 22108 KB Output is correct
11 Correct 113 ms 21932 KB Output is correct
12 Correct 105 ms 21904 KB Output is correct
13 Correct 73 ms 15868 KB Output is correct
14 Correct 135 ms 22456 KB Output is correct
15 Correct 121 ms 21964 KB Output is correct
16 Correct 149 ms 22024 KB Output is correct
17 Correct 9 ms 14456 KB Output is correct
18 Correct 131 ms 21904 KB Output is correct
19 Correct 106 ms 21856 KB Output is correct
20 Correct 106 ms 21868 KB Output is correct
21 Correct 106 ms 21808 KB Output is correct
22 Correct 114 ms 22188 KB Output is correct
23 Correct 107 ms 21836 KB Output is correct
24 Correct 109 ms 21836 KB Output is correct
25 Correct 2532 ms 65572 KB Output is correct
26 Correct 2608 ms 70324 KB Output is correct
27 Correct 2488 ms 66004 KB Output is correct
28 Correct 2164 ms 69880 KB Output is correct
29 Correct 3643 ms 61024 KB Output is correct
30 Correct 4259 ms 80856 KB Output is correct
31 Correct 2681 ms 87596 KB Output is correct
32 Correct 76 ms 15944 KB Output is correct
33 Correct 111 ms 23156 KB Output is correct
34 Correct 108 ms 22640 KB Output is correct
35 Correct 159 ms 22544 KB Output is correct
36 Correct 9 ms 14488 KB Output is correct
37 Correct 110 ms 22532 KB Output is correct
38 Correct 107 ms 22528 KB Output is correct
39 Correct 108 ms 22600 KB Output is correct
40 Correct 104 ms 22504 KB Output is correct
41 Correct 108 ms 22748 KB Output is correct
42 Correct 109 ms 22584 KB Output is correct
43 Correct 109 ms 22548 KB Output is correct
44 Correct 2558 ms 83096 KB Output is correct
45 Correct 2543 ms 88348 KB Output is correct
46 Correct 2441 ms 82536 KB Output is correct
47 Correct 2072 ms 87216 KB Output is correct
48 Correct 3549 ms 77948 KB Output is correct
49 Correct 3929 ms 81544 KB Output is correct
50 Correct 2690 ms 88128 KB Output is correct
51 Correct 3016 ms 96252 KB Output is correct
52 Correct 3067 ms 111220 KB Output is correct
53 Correct 2819 ms 95936 KB Output is correct
54 Correct 2321 ms 80640 KB Output is correct
55 Execution timed out 6096 ms 96640 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 15308 KB Output is correct
2 Correct 110 ms 21928 KB Output is correct
3 Correct 118 ms 21972 KB Output is correct
4 Correct 135 ms 22028 KB Output is correct
5 Correct 10 ms 14404 KB Output is correct
6 Correct 114 ms 21868 KB Output is correct
7 Correct 73 ms 15356 KB Output is correct
8 Correct 119 ms 21944 KB Output is correct
9 Correct 114 ms 21976 KB Output is correct
10 Correct 144 ms 22028 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 102 ms 21828 KB Output is correct
13 Correct 108 ms 21884 KB Output is correct
14 Correct 126 ms 21852 KB Output is correct
15 Correct 103 ms 21816 KB Output is correct
16 Correct 115 ms 22108 KB Output is correct
17 Correct 113 ms 21932 KB Output is correct
18 Correct 105 ms 21904 KB Output is correct
19 Correct 10 ms 14396 KB Output is correct
20 Correct 8 ms 14404 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 89 ms 15940 KB Output is correct
23 Correct 154 ms 22612 KB Output is correct
24 Correct 145 ms 22184 KB Output is correct
25 Correct 166 ms 22280 KB Output is correct
26 Correct 12 ms 14420 KB Output is correct
27 Correct 114 ms 22112 KB Output is correct
28 Correct 148 ms 22036 KB Output is correct
29 Correct 139 ms 22096 KB Output is correct
30 Correct 127 ms 22044 KB Output is correct
31 Correct 114 ms 22364 KB Output is correct
32 Correct 159 ms 22192 KB Output is correct
33 Correct 107 ms 22160 KB Output is correct
34 Correct 2899 ms 65860 KB Output is correct
35 Correct 3385 ms 62132 KB Output is correct
36 Correct 2878 ms 62172 KB Output is correct
37 Incorrect 2605 ms 67372 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 15308 KB Output is correct
2 Correct 110 ms 21928 KB Output is correct
3 Correct 118 ms 21972 KB Output is correct
4 Correct 135 ms 22028 KB Output is correct
5 Correct 10 ms 14404 KB Output is correct
6 Correct 114 ms 21868 KB Output is correct
7 Correct 73 ms 15356 KB Output is correct
8 Correct 119 ms 21944 KB Output is correct
9 Correct 114 ms 21976 KB Output is correct
10 Correct 144 ms 22028 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 102 ms 21828 KB Output is correct
13 Correct 108 ms 21884 KB Output is correct
14 Correct 126 ms 21852 KB Output is correct
15 Correct 103 ms 21816 KB Output is correct
16 Correct 115 ms 22108 KB Output is correct
17 Correct 113 ms 21932 KB Output is correct
18 Correct 105 ms 21904 KB Output is correct
19 Correct 73 ms 15868 KB Output is correct
20 Correct 135 ms 22456 KB Output is correct
21 Correct 121 ms 21964 KB Output is correct
22 Correct 149 ms 22024 KB Output is correct
23 Correct 9 ms 14456 KB Output is correct
24 Correct 131 ms 21904 KB Output is correct
25 Correct 106 ms 21856 KB Output is correct
26 Correct 106 ms 21868 KB Output is correct
27 Correct 106 ms 21808 KB Output is correct
28 Correct 114 ms 22188 KB Output is correct
29 Correct 107 ms 21836 KB Output is correct
30 Correct 109 ms 21836 KB Output is correct
31 Correct 2532 ms 65572 KB Output is correct
32 Correct 2608 ms 70324 KB Output is correct
33 Correct 2488 ms 66004 KB Output is correct
34 Correct 2164 ms 69880 KB Output is correct
35 Correct 3643 ms 61024 KB Output is correct
36 Correct 4259 ms 80856 KB Output is correct
37 Correct 2681 ms 87596 KB Output is correct
38 Correct 10 ms 14396 KB Output is correct
39 Correct 8 ms 14404 KB Output is correct
40 Correct 9 ms 14420 KB Output is correct
41 Correct 89 ms 15940 KB Output is correct
42 Correct 154 ms 22612 KB Output is correct
43 Correct 145 ms 22184 KB Output is correct
44 Correct 166 ms 22280 KB Output is correct
45 Correct 12 ms 14420 KB Output is correct
46 Correct 114 ms 22112 KB Output is correct
47 Correct 148 ms 22036 KB Output is correct
48 Correct 139 ms 22096 KB Output is correct
49 Correct 127 ms 22044 KB Output is correct
50 Correct 114 ms 22364 KB Output is correct
51 Correct 159 ms 22192 KB Output is correct
52 Correct 107 ms 22160 KB Output is correct
53 Correct 2899 ms 65860 KB Output is correct
54 Correct 3385 ms 62132 KB Output is correct
55 Correct 2878 ms 62172 KB Output is correct
56 Incorrect 2605 ms 67372 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 15308 KB Output is correct
2 Correct 110 ms 21928 KB Output is correct
3 Correct 118 ms 21972 KB Output is correct
4 Correct 135 ms 22028 KB Output is correct
5 Correct 10 ms 14404 KB Output is correct
6 Correct 114 ms 21868 KB Output is correct
7 Correct 73 ms 15356 KB Output is correct
8 Correct 119 ms 21944 KB Output is correct
9 Correct 114 ms 21976 KB Output is correct
10 Correct 144 ms 22028 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 102 ms 21828 KB Output is correct
13 Correct 108 ms 21884 KB Output is correct
14 Correct 126 ms 21852 KB Output is correct
15 Correct 103 ms 21816 KB Output is correct
16 Correct 115 ms 22108 KB Output is correct
17 Correct 113 ms 21932 KB Output is correct
18 Correct 105 ms 21904 KB Output is correct
19 Correct 73 ms 15868 KB Output is correct
20 Correct 135 ms 22456 KB Output is correct
21 Correct 121 ms 21964 KB Output is correct
22 Correct 149 ms 22024 KB Output is correct
23 Correct 9 ms 14456 KB Output is correct
24 Correct 131 ms 21904 KB Output is correct
25 Correct 106 ms 21856 KB Output is correct
26 Correct 106 ms 21868 KB Output is correct
27 Correct 106 ms 21808 KB Output is correct
28 Correct 114 ms 22188 KB Output is correct
29 Correct 107 ms 21836 KB Output is correct
30 Correct 109 ms 21836 KB Output is correct
31 Correct 2532 ms 65572 KB Output is correct
32 Correct 2608 ms 70324 KB Output is correct
33 Correct 2488 ms 66004 KB Output is correct
34 Correct 2164 ms 69880 KB Output is correct
35 Correct 3643 ms 61024 KB Output is correct
36 Correct 4259 ms 80856 KB Output is correct
37 Correct 2681 ms 87596 KB Output is correct
38 Correct 76 ms 15944 KB Output is correct
39 Correct 111 ms 23156 KB Output is correct
40 Correct 108 ms 22640 KB Output is correct
41 Correct 159 ms 22544 KB Output is correct
42 Correct 9 ms 14488 KB Output is correct
43 Correct 110 ms 22532 KB Output is correct
44 Correct 107 ms 22528 KB Output is correct
45 Correct 108 ms 22600 KB Output is correct
46 Correct 104 ms 22504 KB Output is correct
47 Correct 108 ms 22748 KB Output is correct
48 Correct 109 ms 22584 KB Output is correct
49 Correct 109 ms 22548 KB Output is correct
50 Correct 2558 ms 83096 KB Output is correct
51 Correct 2543 ms 88348 KB Output is correct
52 Correct 2441 ms 82536 KB Output is correct
53 Correct 2072 ms 87216 KB Output is correct
54 Correct 3549 ms 77948 KB Output is correct
55 Correct 3929 ms 81544 KB Output is correct
56 Correct 2690 ms 88128 KB Output is correct
57 Correct 3016 ms 96252 KB Output is correct
58 Correct 3067 ms 111220 KB Output is correct
59 Correct 2819 ms 95936 KB Output is correct
60 Correct 2321 ms 80640 KB Output is correct
61 Execution timed out 6096 ms 96640 KB Time limit exceeded
62 Halted 0 ms 0 KB -