oj.uz

답안 #658638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658638 2022-11-13T23:01:31 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 3386 ms 95156 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], nxrt[maxn], pvrt[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);
            }
            int u = i;
            for(auto v : g[u]) {
                if(isrt[v] && idrt[u] == idrt[v] && thrt[v] == (thrt[u]+1)%szrt[idrt[u]]) {
                    nxrt[u] = v;
                }
                if(isrt[v] && idrt[u] == idrt[v] && thrt[u] == (thrt[v]+1)%szrt[idrt[u]]) {
                    pvrt[u] = v;
                }
            }
        }
        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]) {
                    int d1 = dlol[u]+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 = 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]) {
            int v,d1,t1;
            v = nxrt[u];
            d1 = d[u][t]+1;
            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])) && d[v][t1] > d1) {
                d[v][t1] = d1;
                pq.push(mp(d[v][t1],mp(v,t1)));
            }

            v = pvrt[u];
            d1 = d[u][t]+1;
            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])) && 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)));
            }

            v = u;
            d1 = d[u][t]+1;
            t1 = d1%szrt[idrt[v]];
            if(!(t1 == thrt[v]) && d[v][t1] > d1) {
                d[v][t1] = d1;
                pq.push(mp(d[v][t1],mp(v,t1)));
            }
        }
        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 42 ms 15828 KB Output is correct
2 Correct 124 ms 23036 KB Output is correct
3 Correct 123 ms 22524 KB Output is correct
4 Correct 137 ms 22468 KB Output is correct
5 Correct 10 ms 14400 KB Output is correct
6 Correct 106 ms 22320 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 15796 KB Output is correct
2 Correct 119 ms 23096 KB Output is correct
3 Correct 139 ms 22488 KB Output is correct
4 Correct 109 ms 22548 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 116 ms 22324 KB Output is correct
7 Correct 123 ms 22404 KB Output is correct
8 Correct 127 ms 22404 KB Output is correct
9 Correct 101 ms 22364 KB Output is correct
10 Correct 103 ms 22564 KB Output is correct
11 Correct 111 ms 22476 KB Output is correct
12 Correct 124 ms 22392 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 15796 KB Output is correct
2 Correct 119 ms 23096 KB Output is correct
3 Correct 139 ms 22488 KB Output is correct
4 Correct 109 ms 22548 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 116 ms 22324 KB Output is correct
7 Correct 123 ms 22404 KB Output is correct
8 Correct 127 ms 22404 KB Output is correct
9 Correct 101 ms 22364 KB Output is correct
10 Correct 103 ms 22564 KB Output is correct
11 Correct 111 ms 22476 KB Output is correct
12 Correct 124 ms 22392 KB Output is correct
13 Correct 44 ms 15820 KB Output is correct
14 Correct 112 ms 22988 KB Output is correct
15 Correct 106 ms 22508 KB Output is correct
16 Correct 107 ms 22448 KB Output is correct
17 Correct 10 ms 14420 KB Output is correct
18 Correct 111 ms 22400 KB Output is correct
19 Correct 116 ms 22296 KB Output is correct
20 Correct 101 ms 22476 KB Output is correct
21 Correct 114 ms 22332 KB Output is correct
22 Correct 105 ms 22564 KB Output is correct
23 Correct 120 ms 22500 KB Output is correct
24 Correct 124 ms 22408 KB Output is correct
25 Correct 2624 ms 66448 KB Output is correct
26 Correct 2500 ms 71828 KB Output is correct
27 Correct 2328 ms 67400 KB Output is correct
28 Correct 2129 ms 71420 KB Output is correct
29 Correct 2446 ms 61984 KB Output is correct
30 Correct 2396 ms 65476 KB Output is correct
31 Correct 2677 ms 71952 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 15796 KB Output is correct
2 Correct 119 ms 23096 KB Output is correct
3 Correct 139 ms 22488 KB Output is correct
4 Correct 109 ms 22548 KB Output is correct
5 Correct 10 ms 14420 KB Output is correct
6 Correct 116 ms 22324 KB Output is correct
7 Correct 123 ms 22404 KB Output is correct
8 Correct 127 ms 22404 KB Output is correct
9 Correct 101 ms 22364 KB Output is correct
10 Correct 103 ms 22564 KB Output is correct
11 Correct 111 ms 22476 KB Output is correct
12 Correct 124 ms 22392 KB Output is correct
13 Correct 44 ms 15820 KB Output is correct
14 Correct 112 ms 22988 KB Output is correct
15 Correct 106 ms 22508 KB Output is correct
16 Correct 107 ms 22448 KB Output is correct
17 Correct 10 ms 14420 KB Output is correct
18 Correct 111 ms 22400 KB Output is correct
19 Correct 116 ms 22296 KB Output is correct
20 Correct 101 ms 22476 KB Output is correct
21 Correct 114 ms 22332 KB Output is correct
22 Correct 105 ms 22564 KB Output is correct
23 Correct 120 ms 22500 KB Output is correct
24 Correct 124 ms 22408 KB Output is correct
25 Correct 2624 ms 66448 KB Output is correct
26 Correct 2500 ms 71828 KB Output is correct
27 Correct 2328 ms 67400 KB Output is correct
28 Correct 2129 ms 71420 KB Output is correct
29 Correct 2446 ms 61984 KB Output is correct
30 Correct 2396 ms 65476 KB Output is correct
31 Correct 2677 ms 71952 KB Output is correct
32 Correct 41 ms 15848 KB Output is correct
33 Correct 151 ms 23028 KB Output is correct
34 Correct 104 ms 22464 KB Output is correct
35 Correct 108 ms 22464 KB Output is correct
36 Correct 9 ms 14400 KB Output is correct
37 Correct 107 ms 22476 KB Output is correct
38 Correct 114 ms 22432 KB Output is correct
39 Correct 99 ms 22348 KB Output is correct
40 Correct 125 ms 22416 KB Output is correct
41 Correct 109 ms 22624 KB Output is correct
42 Correct 110 ms 22472 KB Output is correct
43 Correct 109 ms 22568 KB Output is correct
44 Correct 2580 ms 66580 KB Output is correct
45 Correct 2450 ms 71744 KB Output is correct
46 Correct 2480 ms 67064 KB Output is correct
47 Correct 2160 ms 71412 KB Output is correct
48 Correct 2468 ms 61948 KB Output is correct
49 Correct 2361 ms 65408 KB Output is correct
50 Correct 2816 ms 71924 KB Output is correct
51 Correct 3184 ms 80432 KB Output is correct
52 Correct 3386 ms 95156 KB Output is correct
53 Correct 3002 ms 78972 KB Output is correct
54 Correct 2080 ms 64668 KB Output is correct
55 Correct 3044 ms 81480 KB Output is correct
56 Correct 2798 ms 71172 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 15828 KB Output is correct
2 Correct 124 ms 23036 KB Output is correct
3 Correct 123 ms 22524 KB Output is correct
4 Correct 137 ms 22468 KB Output is correct
5 Correct 10 ms 14400 KB Output is correct
6 Correct 106 ms 22320 KB Output is correct
7 Correct 45 ms 15796 KB Output is correct
8 Correct 119 ms 23096 KB Output is correct
9 Correct 139 ms 22488 KB Output is correct
10 Correct 109 ms 22548 KB Output is correct
11 Correct 10 ms 14420 KB Output is correct
12 Correct 116 ms 22324 KB Output is correct
13 Correct 123 ms 22404 KB Output is correct
14 Correct 127 ms 22404 KB Output is correct
15 Correct 101 ms 22364 KB Output is correct
16 Correct 103 ms 22564 KB Output is correct
17 Correct 111 ms 22476 KB Output is correct
18 Correct 124 ms 22392 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14400 KB Output is correct
21 Correct 7 ms 14368 KB Output is correct
22 Correct 41 ms 15828 KB Output is correct
23 Correct 131 ms 23012 KB Output is correct
24 Correct 126 ms 22464 KB Output is correct
25 Correct 120 ms 22492 KB Output is correct
26 Correct 10 ms 14420 KB Output is correct
27 Correct 113 ms 22352 KB Output is correct
28 Correct 118 ms 22396 KB Output is correct
29 Correct 105 ms 22372 KB Output is correct
30 Correct 118 ms 22348 KB Output is correct
31 Correct 119 ms 22620 KB Output is correct
32 Correct 138 ms 22712 KB Output is correct
33 Correct 128 ms 22376 KB Output is correct
34 Correct 2566 ms 66028 KB Output is correct
35 Correct 2652 ms 62460 KB Output is correct
36 Correct 2755 ms 62520 KB Output is correct
37 Incorrect 2420 ms 67580 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 15828 KB Output is correct
2 Correct 124 ms 23036 KB Output is correct
3 Correct 123 ms 22524 KB Output is correct
4 Correct 137 ms 22468 KB Output is correct
5 Correct 10 ms 14400 KB Output is correct
6 Correct 106 ms 22320 KB Output is correct
7 Correct 45 ms 15796 KB Output is correct
8 Correct 119 ms 23096 KB Output is correct
9 Correct 139 ms 22488 KB Output is correct
10 Correct 109 ms 22548 KB Output is correct
11 Correct 10 ms 14420 KB Output is correct
12 Correct 116 ms 22324 KB Output is correct
13 Correct 123 ms 22404 KB Output is correct
14 Correct 127 ms 22404 KB Output is correct
15 Correct 101 ms 22364 KB Output is correct
16 Correct 103 ms 22564 KB Output is correct
17 Correct 111 ms 22476 KB Output is correct
18 Correct 124 ms 22392 KB Output is correct
19 Correct 44 ms 15820 KB Output is correct
20 Correct 112 ms 22988 KB Output is correct
21 Correct 106 ms 22508 KB Output is correct
22 Correct 107 ms 22448 KB Output is correct
23 Correct 10 ms 14420 KB Output is correct
24 Correct 111 ms 22400 KB Output is correct
25 Correct 116 ms 22296 KB Output is correct
26 Correct 101 ms 22476 KB Output is correct
27 Correct 114 ms 22332 KB Output is correct
28 Correct 105 ms 22564 KB Output is correct
29 Correct 120 ms 22500 KB Output is correct
30 Correct 124 ms 22408 KB Output is correct
31 Correct 2624 ms 66448 KB Output is correct
32 Correct 2500 ms 71828 KB Output is correct
33 Correct 2328 ms 67400 KB Output is correct
34 Correct 2129 ms 71420 KB Output is correct
35 Correct 2446 ms 61984 KB Output is correct
36 Correct 2396 ms 65476 KB Output is correct
37 Correct 2677 ms 71952 KB Output is correct
38 Correct 9 ms 14420 KB Output is correct
39 Correct 8 ms 14400 KB Output is correct
40 Correct 7 ms 14368 KB Output is correct
41 Correct 41 ms 15828 KB Output is correct
42 Correct 131 ms 23012 KB Output is correct
43 Correct 126 ms 22464 KB Output is correct
44 Correct 120 ms 22492 KB Output is correct
45 Correct 10 ms 14420 KB Output is correct
46 Correct 113 ms 22352 KB Output is correct
47 Correct 118 ms 22396 KB Output is correct
48 Correct 105 ms 22372 KB Output is correct
49 Correct 118 ms 22348 KB Output is correct
50 Correct 119 ms 22620 KB Output is correct
51 Correct 138 ms 22712 KB Output is correct
52 Correct 128 ms 22376 KB Output is correct
53 Correct 2566 ms 66028 KB Output is correct
54 Correct 2652 ms 62460 KB Output is correct
55 Correct 2755 ms 62520 KB Output is correct
56 Incorrect 2420 ms 67580 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 15828 KB Output is correct
2 Correct 124 ms 23036 KB Output is correct
3 Correct 123 ms 22524 KB Output is correct
4 Correct 137 ms 22468 KB Output is correct
5 Correct 10 ms 14400 KB Output is correct
6 Correct 106 ms 22320 KB Output is correct
7 Correct 45 ms 15796 KB Output is correct
8 Correct 119 ms 23096 KB Output is correct
9 Correct 139 ms 22488 KB Output is correct
10 Correct 109 ms 22548 KB Output is correct
11 Correct 10 ms 14420 KB Output is correct
12 Correct 116 ms 22324 KB Output is correct
13 Correct 123 ms 22404 KB Output is correct
14 Correct 127 ms 22404 KB Output is correct
15 Correct 101 ms 22364 KB Output is correct
16 Correct 103 ms 22564 KB Output is correct
17 Correct 111 ms 22476 KB Output is correct
18 Correct 124 ms 22392 KB Output is correct
19 Correct 44 ms 15820 KB Output is correct
20 Correct 112 ms 22988 KB Output is correct
21 Correct 106 ms 22508 KB Output is correct
22 Correct 107 ms 22448 KB Output is correct
23 Correct 10 ms 14420 KB Output is correct
24 Correct 111 ms 22400 KB Output is correct
25 Correct 116 ms 22296 KB Output is correct
26 Correct 101 ms 22476 KB Output is correct
27 Correct 114 ms 22332 KB Output is correct
28 Correct 105 ms 22564 KB Output is correct
29 Correct 120 ms 22500 KB Output is correct
30 Correct 124 ms 22408 KB Output is correct
31 Correct 2624 ms 66448 KB Output is correct
32 Correct 2500 ms 71828 KB Output is correct
33 Correct 2328 ms 67400 KB Output is correct
34 Correct 2129 ms 71420 KB Output is correct
35 Correct 2446 ms 61984 KB Output is correct
36 Correct 2396 ms 65476 KB Output is correct
37 Correct 2677 ms 71952 KB Output is correct
38 Correct 41 ms 15848 KB Output is correct
39 Correct 151 ms 23028 KB Output is correct
40 Correct 104 ms 22464 KB Output is correct
41 Correct 108 ms 22464 KB Output is correct
42 Correct 9 ms 14400 KB Output is correct
43 Correct 107 ms 22476 KB Output is correct
44 Correct 114 ms 22432 KB Output is correct
45 Correct 99 ms 22348 KB Output is correct
46 Correct 125 ms 22416 KB Output is correct
47 Correct 109 ms 22624 KB Output is correct
48 Correct 110 ms 22472 KB Output is correct
49 Correct 109 ms 22568 KB Output is correct
50 Correct 2580 ms 66580 KB Output is correct
51 Correct 2450 ms 71744 KB Output is correct
52 Correct 2480 ms 67064 KB Output is correct
53 Correct 2160 ms 71412 KB Output is correct
54 Correct 2468 ms 61948 KB Output is correct
55 Correct 2361 ms 65408 KB Output is correct
56 Correct 2816 ms 71924 KB Output is correct
57 Correct 3184 ms 80432 KB Output is correct
58 Correct 3386 ms 95156 KB Output is correct
59 Correct 3002 ms 78972 KB Output is correct
60 Correct 2080 ms 64668 KB Output is correct
61 Correct 3044 ms 81480 KB Output is correct
62 Correct 2798 ms 71172 KB Output is correct
63 Correct 9 ms 14420 KB Output is correct
64 Correct 8 ms 14400 KB Output is correct
65 Correct 7 ms 14368 KB Output is correct
66 Correct 41 ms 15828 KB Output is correct
67 Correct 131 ms 23012 KB Output is correct
68 Correct 126 ms 22464 KB Output is correct
69 Correct 120 ms 22492 KB Output is correct
70 Correct 10 ms 14420 KB Output is correct
71 Correct 113 ms 22352 KB Output is correct
72 Correct 118 ms 22396 KB Output is correct
73 Correct 105 ms 22372 KB Output is correct
74 Correct 118 ms 22348 KB Output is correct
75 Correct 119 ms 22620 KB Output is correct
76 Correct 138 ms 22712 KB Output is correct
77 Correct 128 ms 22376 KB Output is correct
78 Correct 2566 ms 66028 KB Output is correct
79 Correct 2652 ms 62460 KB Output is correct
80 Correct 2755 ms 62520 KB Output is correct
81 Incorrect 2420 ms 67580 KB Output isn't correct
82 Halted 0 ms 0 KB -