oj.uz

Submission #657516

# Submission time Handle Problem Language Result Execution time Memory
657516 2022-11-10T02:12:39 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 3072 ms 94604 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 42 ms 15248 KB Output is correct
2 Correct 113 ms 22528 KB Output is correct
3 Correct 115 ms 21984 KB Output is correct
4 Correct 114 ms 22036 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 109 ms 21908 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15252 KB Output is correct
2 Correct 120 ms 22544 KB Output is correct
3 Correct 106 ms 21940 KB Output is correct
4 Correct 111 ms 22076 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 103 ms 21792 KB Output is correct
7 Correct 114 ms 21880 KB Output is correct
8 Correct 97 ms 21808 KB Output is correct
9 Correct 112 ms 21820 KB Output is correct
10 Correct 100 ms 22052 KB Output is correct
11 Correct 102 ms 21884 KB Output is correct
12 Correct 106 ms 21936 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15252 KB Output is correct
2 Correct 120 ms 22544 KB Output is correct
3 Correct 106 ms 21940 KB Output is correct
4 Correct 111 ms 22076 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 103 ms 21792 KB Output is correct
7 Correct 114 ms 21880 KB Output is correct
8 Correct 97 ms 21808 KB Output is correct
9 Correct 112 ms 21820 KB Output is correct
10 Correct 100 ms 22052 KB Output is correct
11 Correct 102 ms 21884 KB Output is correct
12 Correct 106 ms 21936 KB Output is correct
13 Correct 42 ms 15376 KB Output is correct
14 Correct 102 ms 22460 KB Output is correct
15 Correct 109 ms 21996 KB Output is correct
16 Correct 109 ms 21952 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 118 ms 21860 KB Output is correct
19 Correct 101 ms 21888 KB Output is correct
20 Correct 107 ms 21896 KB Output is correct
21 Correct 103 ms 21792 KB Output is correct
22 Correct 123 ms 22104 KB Output is correct
23 Correct 108 ms 21972 KB Output is correct
24 Correct 107 ms 21836 KB Output is correct
25 Correct 2580 ms 65984 KB Output is correct
26 Correct 2523 ms 71228 KB Output is correct
27 Correct 2416 ms 67044 KB Output is correct
28 Correct 2122 ms 70868 KB Output is correct
29 Correct 2432 ms 61472 KB Output is correct
30 Correct 2450 ms 64996 KB Output is correct
31 Correct 2764 ms 71240 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15252 KB Output is correct
2 Correct 120 ms 22544 KB Output is correct
3 Correct 106 ms 21940 KB Output is correct
4 Correct 111 ms 22076 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 103 ms 21792 KB Output is correct
7 Correct 114 ms 21880 KB Output is correct
8 Correct 97 ms 21808 KB Output is correct
9 Correct 112 ms 21820 KB Output is correct
10 Correct 100 ms 22052 KB Output is correct
11 Correct 102 ms 21884 KB Output is correct
12 Correct 106 ms 21936 KB Output is correct
13 Correct 42 ms 15376 KB Output is correct
14 Correct 102 ms 22460 KB Output is correct
15 Correct 109 ms 21996 KB Output is correct
16 Correct 109 ms 21952 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 118 ms 21860 KB Output is correct
19 Correct 101 ms 21888 KB Output is correct
20 Correct 107 ms 21896 KB Output is correct
21 Correct 103 ms 21792 KB Output is correct
22 Correct 123 ms 22104 KB Output is correct
23 Correct 108 ms 21972 KB Output is correct
24 Correct 107 ms 21836 KB Output is correct
25 Correct 2580 ms 65984 KB Output is correct
26 Correct 2523 ms 71228 KB Output is correct
27 Correct 2416 ms 67044 KB Output is correct
28 Correct 2122 ms 70868 KB Output is correct
29 Correct 2432 ms 61472 KB Output is correct
30 Correct 2450 ms 64996 KB Output is correct
31 Correct 2764 ms 71240 KB Output is correct
32 Correct 57 ms 15272 KB Output is correct
33 Correct 116 ms 22444 KB Output is correct
34 Correct 103 ms 21972 KB Output is correct
35 Correct 124 ms 22120 KB Output is correct
36 Correct 8 ms 14420 KB Output is correct
37 Correct 154 ms 21788 KB Output is correct
38 Correct 107 ms 21884 KB Output is correct
39 Correct 103 ms 21912 KB Output is correct
40 Correct 101 ms 21816 KB Output is correct
41 Correct 113 ms 22196 KB Output is correct
42 Correct 100 ms 21912 KB Output is correct
43 Correct 105 ms 22012 KB Output is correct
44 Correct 2568 ms 66032 KB Output is correct
45 Correct 2525 ms 71240 KB Output is correct
46 Correct 2352 ms 66940 KB Output is correct
47 Correct 2170 ms 70724 KB Output is correct
48 Correct 2480 ms 61472 KB Output is correct
49 Correct 2665 ms 64840 KB Output is correct
50 Correct 2780 ms 71300 KB Output is correct
51 Correct 3072 ms 80016 KB Output is correct
52 Correct 2963 ms 94604 KB Output is correct
53 Correct 2597 ms 78448 KB Output is correct
54 Correct 2024 ms 63864 KB Output is correct
55 Correct 2869 ms 80912 KB Output is correct
56 Correct 2768 ms 70632 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15248 KB Output is correct
2 Correct 113 ms 22528 KB Output is correct
3 Correct 115 ms 21984 KB Output is correct
4 Correct 114 ms 22036 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 109 ms 21908 KB Output is correct
7 Correct 42 ms 15252 KB Output is correct
8 Correct 120 ms 22544 KB Output is correct
9 Correct 106 ms 21940 KB Output is correct
10 Correct 111 ms 22076 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 103 ms 21792 KB Output is correct
13 Correct 114 ms 21880 KB Output is correct
14 Correct 97 ms 21808 KB Output is correct
15 Correct 112 ms 21820 KB Output is correct
16 Correct 100 ms 22052 KB Output is correct
17 Correct 102 ms 21884 KB Output is correct
18 Correct 106 ms 21936 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14440 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 41 ms 15368 KB Output is correct
23 Correct 128 ms 22520 KB Output is correct
24 Correct 116 ms 21976 KB Output is correct
25 Correct 115 ms 22116 KB Output is correct
26 Correct 8 ms 14416 KB Output is correct
27 Correct 110 ms 21824 KB Output is correct
28 Correct 99 ms 21836 KB Output is correct
29 Correct 104 ms 21956 KB Output is correct
30 Correct 99 ms 21872 KB Output is correct
31 Correct 108 ms 22100 KB Output is correct
32 Correct 125 ms 22168 KB Output is correct
33 Correct 102 ms 21916 KB Output is correct
34 Correct 2533 ms 66124 KB Output is correct
35 Correct 2572 ms 62632 KB Output is correct
36 Correct 2639 ms 62556 KB Output is correct
37 Incorrect 2405 ms 67500 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15248 KB Output is correct
2 Correct 113 ms 22528 KB Output is correct
3 Correct 115 ms 21984 KB Output is correct
4 Correct 114 ms 22036 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 109 ms 21908 KB Output is correct
7 Correct 42 ms 15252 KB Output is correct
8 Correct 120 ms 22544 KB Output is correct
9 Correct 106 ms 21940 KB Output is correct
10 Correct 111 ms 22076 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 103 ms 21792 KB Output is correct
13 Correct 114 ms 21880 KB Output is correct
14 Correct 97 ms 21808 KB Output is correct
15 Correct 112 ms 21820 KB Output is correct
16 Correct 100 ms 22052 KB Output is correct
17 Correct 102 ms 21884 KB Output is correct
18 Correct 106 ms 21936 KB Output is correct
19 Correct 42 ms 15376 KB Output is correct
20 Correct 102 ms 22460 KB Output is correct
21 Correct 109 ms 21996 KB Output is correct
22 Correct 109 ms 21952 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 118 ms 21860 KB Output is correct
25 Correct 101 ms 21888 KB Output is correct
26 Correct 107 ms 21896 KB Output is correct
27 Correct 103 ms 21792 KB Output is correct
28 Correct 123 ms 22104 KB Output is correct
29 Correct 108 ms 21972 KB Output is correct
30 Correct 107 ms 21836 KB Output is correct
31 Correct 2580 ms 65984 KB Output is correct
32 Correct 2523 ms 71228 KB Output is correct
33 Correct 2416 ms 67044 KB Output is correct
34 Correct 2122 ms 70868 KB Output is correct
35 Correct 2432 ms 61472 KB Output is correct
36 Correct 2450 ms 64996 KB Output is correct
37 Correct 2764 ms 71240 KB Output is correct
38 Correct 8 ms 14420 KB Output is correct
39 Correct 8 ms 14440 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 41 ms 15368 KB Output is correct
42 Correct 128 ms 22520 KB Output is correct
43 Correct 116 ms 21976 KB Output is correct
44 Correct 115 ms 22116 KB Output is correct
45 Correct 8 ms 14416 KB Output is correct
46 Correct 110 ms 21824 KB Output is correct
47 Correct 99 ms 21836 KB Output is correct
48 Correct 104 ms 21956 KB Output is correct
49 Correct 99 ms 21872 KB Output is correct
50 Correct 108 ms 22100 KB Output is correct
51 Correct 125 ms 22168 KB Output is correct
52 Correct 102 ms 21916 KB Output is correct
53 Correct 2533 ms 66124 KB Output is correct
54 Correct 2572 ms 62632 KB Output is correct
55 Correct 2639 ms 62556 KB Output is correct
56 Incorrect 2405 ms 67500 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 15248 KB Output is correct
2 Correct 113 ms 22528 KB Output is correct
3 Correct 115 ms 21984 KB Output is correct
4 Correct 114 ms 22036 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 109 ms 21908 KB Output is correct
7 Correct 42 ms 15252 KB Output is correct
8 Correct 120 ms 22544 KB Output is correct
9 Correct 106 ms 21940 KB Output is correct
10 Correct 111 ms 22076 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 103 ms 21792 KB Output is correct
13 Correct 114 ms 21880 KB Output is correct
14 Correct 97 ms 21808 KB Output is correct
15 Correct 112 ms 21820 KB Output is correct
16 Correct 100 ms 22052 KB Output is correct
17 Correct 102 ms 21884 KB Output is correct
18 Correct 106 ms 21936 KB Output is correct
19 Correct 42 ms 15376 KB Output is correct
20 Correct 102 ms 22460 KB Output is correct
21 Correct 109 ms 21996 KB Output is correct
22 Correct 109 ms 21952 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 118 ms 21860 KB Output is correct
25 Correct 101 ms 21888 KB Output is correct
26 Correct 107 ms 21896 KB Output is correct
27 Correct 103 ms 21792 KB Output is correct
28 Correct 123 ms 22104 KB Output is correct
29 Correct 108 ms 21972 KB Output is correct
30 Correct 107 ms 21836 KB Output is correct
31 Correct 2580 ms 65984 KB Output is correct
32 Correct 2523 ms 71228 KB Output is correct
33 Correct 2416 ms 67044 KB Output is correct
34 Correct 2122 ms 70868 KB Output is correct
35 Correct 2432 ms 61472 KB Output is correct
36 Correct 2450 ms 64996 KB Output is correct
37 Correct 2764 ms 71240 KB Output is correct
38 Correct 57 ms 15272 KB Output is correct
39 Correct 116 ms 22444 KB Output is correct
40 Correct 103 ms 21972 KB Output is correct
41 Correct 124 ms 22120 KB Output is correct
42 Correct 8 ms 14420 KB Output is correct
43 Correct 154 ms 21788 KB Output is correct
44 Correct 107 ms 21884 KB Output is correct
45 Correct 103 ms 21912 KB Output is correct
46 Correct 101 ms 21816 KB Output is correct
47 Correct 113 ms 22196 KB Output is correct
48 Correct 100 ms 21912 KB Output is correct
49 Correct 105 ms 22012 KB Output is correct
50 Correct 2568 ms 66032 KB Output is correct
51 Correct 2525 ms 71240 KB Output is correct
52 Correct 2352 ms 66940 KB Output is correct
53 Correct 2170 ms 70724 KB Output is correct
54 Correct 2480 ms 61472 KB Output is correct
55 Correct 2665 ms 64840 KB Output is correct
56 Correct 2780 ms 71300 KB Output is correct
57 Correct 3072 ms 80016 KB Output is correct
58 Correct 2963 ms 94604 KB Output is correct
59 Correct 2597 ms 78448 KB Output is correct
60 Correct 2024 ms 63864 KB Output is correct
61 Correct 2869 ms 80912 KB Output is correct
62 Correct 2768 ms 70632 KB Output is correct
63 Correct 8 ms 14420 KB Output is correct
64 Correct 8 ms 14440 KB Output is correct
65 Correct 8 ms 14420 KB Output is correct
66 Correct 41 ms 15368 KB Output is correct
67 Correct 128 ms 22520 KB Output is correct
68 Correct 116 ms 21976 KB Output is correct
69 Correct 115 ms 22116 KB Output is correct
70 Correct 8 ms 14416 KB Output is correct
71 Correct 110 ms 21824 KB Output is correct
72 Correct 99 ms 21836 KB Output is correct
73 Correct 104 ms 21956 KB Output is correct
74 Correct 99 ms 21872 KB Output is correct
75 Correct 108 ms 22100 KB Output is correct
76 Correct 125 ms 22168 KB Output is correct
77 Correct 102 ms 21916 KB Output is correct
78 Correct 2533 ms 66124 KB Output is correct
79 Correct 2572 ms 62632 KB Output is correct
80 Correct 2639 ms 62556 KB Output is correct
81 Incorrect 2405 ms 67500 KB Output isn't correct
82 Halted 0 ms 0 KB -