oj.uz

Submission #658637

# Submission time Handle Problem Language Result Execution time Memory
658637 2022-11-13T22:59:22 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 2914 ms 99988 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)));
            }
        }
        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

# Verdict Execution time Memory Grader output
1 Correct 40 ms 15948 KB Output is correct
2 Correct 106 ms 23616 KB Output is correct
3 Correct 104 ms 23236 KB Output is correct
4 Correct 108 ms 23088 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 101 ms 23024 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15948 KB Output is correct
2 Correct 105 ms 23672 KB Output is correct
3 Correct 104 ms 23136 KB Output is correct
4 Correct 109 ms 23188 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 107 ms 23048 KB Output is correct
7 Correct 101 ms 23044 KB Output is correct
8 Correct 98 ms 23012 KB Output is correct
9 Correct 111 ms 23032 KB Output is correct
10 Correct 101 ms 23284 KB Output is correct
11 Correct 98 ms 23068 KB Output is correct
12 Correct 102 ms 23048 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15948 KB Output is correct
2 Correct 105 ms 23672 KB Output is correct
3 Correct 104 ms 23136 KB Output is correct
4 Correct 109 ms 23188 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 107 ms 23048 KB Output is correct
7 Correct 101 ms 23044 KB Output is correct
8 Correct 98 ms 23012 KB Output is correct
9 Correct 111 ms 23032 KB Output is correct
10 Correct 101 ms 23284 KB Output is correct
11 Correct 98 ms 23068 KB Output is correct
12 Correct 102 ms 23048 KB Output is correct
13 Correct 43 ms 15884 KB Output is correct
14 Correct 123 ms 23616 KB Output is correct
15 Correct 104 ms 23136 KB Output is correct
16 Correct 117 ms 23188 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 103 ms 23044 KB Output is correct
19 Correct 103 ms 23032 KB Output is correct
20 Correct 112 ms 23108 KB Output is correct
21 Correct 96 ms 22972 KB Output is correct
22 Correct 101 ms 23252 KB Output is correct
23 Correct 102 ms 23092 KB Output is correct
24 Correct 99 ms 23040 KB Output is correct
25 Correct 2568 ms 81964 KB Output is correct
26 Correct 2451 ms 87272 KB Output is correct
27 Correct 2367 ms 82996 KB Output is correct
28 Correct 2049 ms 86780 KB Output is correct
29 Correct 2377 ms 77576 KB Output is correct
30 Correct 2438 ms 81404 KB Output is correct
31 Correct 2725 ms 80988 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15948 KB Output is correct
2 Correct 105 ms 23672 KB Output is correct
3 Correct 104 ms 23136 KB Output is correct
4 Correct 109 ms 23188 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 107 ms 23048 KB Output is correct
7 Correct 101 ms 23044 KB Output is correct
8 Correct 98 ms 23012 KB Output is correct
9 Correct 111 ms 23032 KB Output is correct
10 Correct 101 ms 23284 KB Output is correct
11 Correct 98 ms 23068 KB Output is correct
12 Correct 102 ms 23048 KB Output is correct
13 Correct 43 ms 15884 KB Output is correct
14 Correct 123 ms 23616 KB Output is correct
15 Correct 104 ms 23136 KB Output is correct
16 Correct 117 ms 23188 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 103 ms 23044 KB Output is correct
19 Correct 103 ms 23032 KB Output is correct
20 Correct 112 ms 23108 KB Output is correct
21 Correct 96 ms 22972 KB Output is correct
22 Correct 101 ms 23252 KB Output is correct
23 Correct 102 ms 23092 KB Output is correct
24 Correct 99 ms 23040 KB Output is correct
25 Correct 2568 ms 81964 KB Output is correct
26 Correct 2451 ms 87272 KB Output is correct
27 Correct 2367 ms 82996 KB Output is correct
28 Correct 2049 ms 86780 KB Output is correct
29 Correct 2377 ms 77576 KB Output is correct
30 Correct 2438 ms 81404 KB Output is correct
31 Correct 2725 ms 80988 KB Output is correct
32 Correct 43 ms 15876 KB Output is correct
33 Correct 113 ms 23616 KB Output is correct
34 Correct 107 ms 23184 KB Output is correct
35 Correct 109 ms 23112 KB Output is correct
36 Correct 8 ms 14400 KB Output is correct
37 Correct 109 ms 23128 KB Output is correct
38 Correct 101 ms 22984 KB Output is correct
39 Correct 101 ms 23064 KB Output is correct
40 Correct 119 ms 22976 KB Output is correct
41 Correct 104 ms 23216 KB Output is correct
42 Correct 106 ms 23132 KB Output is correct
43 Correct 100 ms 22988 KB Output is correct
44 Correct 2554 ms 70804 KB Output is correct
45 Correct 2464 ms 75280 KB Output is correct
46 Correct 2466 ms 86048 KB Output is correct
47 Correct 2109 ms 79624 KB Output is correct
48 Correct 2408 ms 80892 KB Output is correct
49 Correct 2359 ms 69648 KB Output is correct
50 Correct 2621 ms 76104 KB Output is correct
51 Correct 2887 ms 84824 KB Output is correct
52 Correct 2914 ms 99188 KB Output is correct
53 Correct 2595 ms 82044 KB Output is correct
54 Correct 2053 ms 70916 KB Output is correct
55 Correct 2885 ms 99988 KB Output is correct
56 Correct 2792 ms 74944 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 15948 KB Output is correct
2 Correct 106 ms 23616 KB Output is correct
3 Correct 104 ms 23236 KB Output is correct
4 Correct 108 ms 23088 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 101 ms 23024 KB Output is correct
7 Correct 44 ms 15948 KB Output is correct
8 Correct 105 ms 23672 KB Output is correct
9 Correct 104 ms 23136 KB Output is correct
10 Correct 109 ms 23188 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 107 ms 23048 KB Output is correct
13 Correct 101 ms 23044 KB Output is correct
14 Correct 98 ms 23012 KB Output is correct
15 Correct 111 ms 23032 KB Output is correct
16 Correct 101 ms 23284 KB Output is correct
17 Correct 98 ms 23068 KB Output is correct
18 Correct 102 ms 23048 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 41 ms 15936 KB Output is correct
23 Correct 103 ms 23656 KB Output is correct
24 Correct 102 ms 23140 KB Output is correct
25 Correct 105 ms 23180 KB Output is correct
26 Correct 8 ms 14396 KB Output is correct
27 Correct 108 ms 23056 KB Output is correct
28 Correct 105 ms 23056 KB Output is correct
29 Correct 103 ms 22988 KB Output is correct
30 Correct 97 ms 22936 KB Output is correct
31 Correct 103 ms 23240 KB Output is correct
32 Correct 108 ms 23176 KB Output is correct
33 Correct 99 ms 22976 KB Output is correct
34 Correct 2526 ms 84256 KB Output is correct
35 Correct 2630 ms 79560 KB Output is correct
36 Correct 2615 ms 81188 KB Output is correct
37 Incorrect 2352 ms 86092 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 15948 KB Output is correct
2 Correct 106 ms 23616 KB Output is correct
3 Correct 104 ms 23236 KB Output is correct
4 Correct 108 ms 23088 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 101 ms 23024 KB Output is correct
7 Correct 44 ms 15948 KB Output is correct
8 Correct 105 ms 23672 KB Output is correct
9 Correct 104 ms 23136 KB Output is correct
10 Correct 109 ms 23188 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 107 ms 23048 KB Output is correct
13 Correct 101 ms 23044 KB Output is correct
14 Correct 98 ms 23012 KB Output is correct
15 Correct 111 ms 23032 KB Output is correct
16 Correct 101 ms 23284 KB Output is correct
17 Correct 98 ms 23068 KB Output is correct
18 Correct 102 ms 23048 KB Output is correct
19 Correct 43 ms 15884 KB Output is correct
20 Correct 123 ms 23616 KB Output is correct
21 Correct 104 ms 23136 KB Output is correct
22 Correct 117 ms 23188 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 103 ms 23044 KB Output is correct
25 Correct 103 ms 23032 KB Output is correct
26 Correct 112 ms 23108 KB Output is correct
27 Correct 96 ms 22972 KB Output is correct
28 Correct 101 ms 23252 KB Output is correct
29 Correct 102 ms 23092 KB Output is correct
30 Correct 99 ms 23040 KB Output is correct
31 Correct 2568 ms 81964 KB Output is correct
32 Correct 2451 ms 87272 KB Output is correct
33 Correct 2367 ms 82996 KB Output is correct
34 Correct 2049 ms 86780 KB Output is correct
35 Correct 2377 ms 77576 KB Output is correct
36 Correct 2438 ms 81404 KB Output is correct
37 Correct 2725 ms 80988 KB Output is correct
38 Correct 7 ms 14420 KB Output is correct
39 Correct 7 ms 14420 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 41 ms 15936 KB Output is correct
42 Correct 103 ms 23656 KB Output is correct
43 Correct 102 ms 23140 KB Output is correct
44 Correct 105 ms 23180 KB Output is correct
45 Correct 8 ms 14396 KB Output is correct
46 Correct 108 ms 23056 KB Output is correct
47 Correct 105 ms 23056 KB Output is correct
48 Correct 103 ms 22988 KB Output is correct
49 Correct 97 ms 22936 KB Output is correct
50 Correct 103 ms 23240 KB Output is correct
51 Correct 108 ms 23176 KB Output is correct
52 Correct 99 ms 22976 KB Output is correct
53 Correct 2526 ms 84256 KB Output is correct
54 Correct 2630 ms 79560 KB Output is correct
55 Correct 2615 ms 81188 KB Output is correct
56 Incorrect 2352 ms 86092 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 15948 KB Output is correct
2 Correct 106 ms 23616 KB Output is correct
3 Correct 104 ms 23236 KB Output is correct
4 Correct 108 ms 23088 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 101 ms 23024 KB Output is correct
7 Correct 44 ms 15948 KB Output is correct
8 Correct 105 ms 23672 KB Output is correct
9 Correct 104 ms 23136 KB Output is correct
10 Correct 109 ms 23188 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 107 ms 23048 KB Output is correct
13 Correct 101 ms 23044 KB Output is correct
14 Correct 98 ms 23012 KB Output is correct
15 Correct 111 ms 23032 KB Output is correct
16 Correct 101 ms 23284 KB Output is correct
17 Correct 98 ms 23068 KB Output is correct
18 Correct 102 ms 23048 KB Output is correct
19 Correct 43 ms 15884 KB Output is correct
20 Correct 123 ms 23616 KB Output is correct
21 Correct 104 ms 23136 KB Output is correct
22 Correct 117 ms 23188 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 103 ms 23044 KB Output is correct
25 Correct 103 ms 23032 KB Output is correct
26 Correct 112 ms 23108 KB Output is correct
27 Correct 96 ms 22972 KB Output is correct
28 Correct 101 ms 23252 KB Output is correct
29 Correct 102 ms 23092 KB Output is correct
30 Correct 99 ms 23040 KB Output is correct
31 Correct 2568 ms 81964 KB Output is correct
32 Correct 2451 ms 87272 KB Output is correct
33 Correct 2367 ms 82996 KB Output is correct
34 Correct 2049 ms 86780 KB Output is correct
35 Correct 2377 ms 77576 KB Output is correct
36 Correct 2438 ms 81404 KB Output is correct
37 Correct 2725 ms 80988 KB Output is correct
38 Correct 43 ms 15876 KB Output is correct
39 Correct 113 ms 23616 KB Output is correct
40 Correct 107 ms 23184 KB Output is correct
41 Correct 109 ms 23112 KB Output is correct
42 Correct 8 ms 14400 KB Output is correct
43 Correct 109 ms 23128 KB Output is correct
44 Correct 101 ms 22984 KB Output is correct
45 Correct 101 ms 23064 KB Output is correct
46 Correct 119 ms 22976 KB Output is correct
47 Correct 104 ms 23216 KB Output is correct
48 Correct 106 ms 23132 KB Output is correct
49 Correct 100 ms 22988 KB Output is correct
50 Correct 2554 ms 70804 KB Output is correct
51 Correct 2464 ms 75280 KB Output is correct
52 Correct 2466 ms 86048 KB Output is correct
53 Correct 2109 ms 79624 KB Output is correct
54 Correct 2408 ms 80892 KB Output is correct
55 Correct 2359 ms 69648 KB Output is correct
56 Correct 2621 ms 76104 KB Output is correct
57 Correct 2887 ms 84824 KB Output is correct
58 Correct 2914 ms 99188 KB Output is correct
59 Correct 2595 ms 82044 KB Output is correct
60 Correct 2053 ms 70916 KB Output is correct
61 Correct 2885 ms 99988 KB Output is correct
62 Correct 2792 ms 74944 KB Output is correct
63 Correct 7 ms 14420 KB Output is correct
64 Correct 7 ms 14420 KB Output is correct
65 Correct 8 ms 14420 KB Output is correct
66 Correct 41 ms 15936 KB Output is correct
67 Correct 103 ms 23656 KB Output is correct
68 Correct 102 ms 23140 KB Output is correct
69 Correct 105 ms 23180 KB Output is correct
70 Correct 8 ms 14396 KB Output is correct
71 Correct 108 ms 23056 KB Output is correct
72 Correct 105 ms 23056 KB Output is correct
73 Correct 103 ms 22988 KB Output is correct
74 Correct 97 ms 22936 KB Output is correct
75 Correct 103 ms 23240 KB Output is correct
76 Correct 108 ms 23176 KB Output is correct
77 Correct 99 ms 22976 KB Output is correct
78 Correct 2526 ms 84256 KB Output is correct
79 Correct 2630 ms 79560 KB Output is correct
80 Correct 2615 ms 81188 KB Output is correct
81 Incorrect 2352 ms 86092 KB Output isn't correct
82 Halted 0 ms 0 KB -