oj.uz

Submission #657513

# Submission time Handle Problem Language Result Execution time Memory
657513 2022-11-10T02:09:42 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
25 / 100
 6000 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]) {
            for(auto v : g[u]) {
                if(v == nxrt[u] || v == pvrt[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)));
                    }
                }
                
            }
            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 47 ms 15304 KB Output is correct
2 Correct 109 ms 22472 KB Output is correct
3 Correct 102 ms 21932 KB Output is correct
4 Correct 110 ms 21940 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 110 ms 21824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 15320 KB Output is correct
2 Correct 115 ms 22524 KB Output is correct
3 Correct 111 ms 22032 KB Output is correct
4 Correct 112 ms 21972 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 112 ms 21900 KB Output is correct
7 Correct 107 ms 21824 KB Output is correct
8 Correct 103 ms 21832 KB Output is correct
9 Correct 114 ms 21888 KB Output is correct
10 Correct 107 ms 22048 KB Output is correct
11 Correct 104 ms 21976 KB Output is correct
12 Correct 110 ms 22032 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 15320 KB Output is correct
2 Correct 115 ms 22524 KB Output is correct
3 Correct 111 ms 22032 KB Output is correct
4 Correct 112 ms 21972 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 112 ms 21900 KB Output is correct
7 Correct 107 ms 21824 KB Output is correct
8 Correct 103 ms 21832 KB Output is correct
9 Correct 114 ms 21888 KB Output is correct
10 Correct 107 ms 22048 KB Output is correct
11 Correct 104 ms 21976 KB Output is correct
12 Correct 110 ms 22032 KB Output is correct
13 Correct 48 ms 15376 KB Output is correct
14 Correct 116 ms 22476 KB Output is correct
15 Correct 108 ms 21964 KB Output is correct
16 Correct 128 ms 21956 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 111 ms 21908 KB Output is correct
19 Correct 105 ms 21880 KB Output is correct
20 Correct 109 ms 21868 KB Output is correct
21 Correct 104 ms 21788 KB Output is correct
22 Correct 128 ms 22156 KB Output is correct
23 Correct 107 ms 21968 KB Output is correct
24 Correct 106 ms 21904 KB Output is correct
25 Correct 2558 ms 66136 KB Output is correct
26 Correct 2680 ms 71376 KB Output is correct
27 Correct 2337 ms 66892 KB Output is correct
28 Correct 2143 ms 70976 KB Output is correct
29 Correct 2925 ms 61368 KB Output is correct
30 Correct 2965 ms 64992 KB Output is correct
31 Correct 2611 ms 71316 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 15320 KB Output is correct
2 Correct 115 ms 22524 KB Output is correct
3 Correct 111 ms 22032 KB Output is correct
4 Correct 112 ms 21972 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 112 ms 21900 KB Output is correct
7 Correct 107 ms 21824 KB Output is correct
8 Correct 103 ms 21832 KB Output is correct
9 Correct 114 ms 21888 KB Output is correct
10 Correct 107 ms 22048 KB Output is correct
11 Correct 104 ms 21976 KB Output is correct
12 Correct 110 ms 22032 KB Output is correct
13 Correct 48 ms 15376 KB Output is correct
14 Correct 116 ms 22476 KB Output is correct
15 Correct 108 ms 21964 KB Output is correct
16 Correct 128 ms 21956 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 111 ms 21908 KB Output is correct
19 Correct 105 ms 21880 KB Output is correct
20 Correct 109 ms 21868 KB Output is correct
21 Correct 104 ms 21788 KB Output is correct
22 Correct 128 ms 22156 KB Output is correct
23 Correct 107 ms 21968 KB Output is correct
24 Correct 106 ms 21904 KB Output is correct
25 Correct 2558 ms 66136 KB Output is correct
26 Correct 2680 ms 71376 KB Output is correct
27 Correct 2337 ms 66892 KB Output is correct
28 Correct 2143 ms 70976 KB Output is correct
29 Correct 2925 ms 61368 KB Output is correct
30 Correct 2965 ms 64992 KB Output is correct
31 Correct 2611 ms 71316 KB Output is correct
32 Correct 50 ms 15316 KB Output is correct
33 Correct 131 ms 22444 KB Output is correct
34 Correct 118 ms 22132 KB Output is correct
35 Correct 112 ms 22040 KB Output is correct
36 Correct 9 ms 14420 KB Output is correct
37 Correct 117 ms 21840 KB Output is correct
38 Correct 104 ms 21836 KB Output is correct
39 Correct 107 ms 21840 KB Output is correct
40 Correct 99 ms 21812 KB Output is correct
41 Correct 109 ms 22156 KB Output is correct
42 Correct 103 ms 21972 KB Output is correct
43 Correct 106 ms 21916 KB Output is correct
44 Correct 2606 ms 65976 KB Output is correct
45 Correct 2437 ms 71288 KB Output is correct
46 Correct 2398 ms 66928 KB Output is correct
47 Correct 2132 ms 70836 KB Output is correct
48 Correct 2932 ms 61488 KB Output is correct
49 Correct 2958 ms 65048 KB Output is correct
50 Correct 2655 ms 71380 KB Output is correct
51 Correct 3180 ms 79996 KB Output is correct
52 Correct 3117 ms 94604 KB Output is correct
53 Correct 2715 ms 78436 KB Output is correct
54 Correct 2064 ms 63964 KB Output is correct
55 Execution timed out 6083 ms 80896 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 15304 KB Output is correct
2 Correct 109 ms 22472 KB Output is correct
3 Correct 102 ms 21932 KB Output is correct
4 Correct 110 ms 21940 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 110 ms 21824 KB Output is correct
7 Correct 55 ms 15320 KB Output is correct
8 Correct 115 ms 22524 KB Output is correct
9 Correct 111 ms 22032 KB Output is correct
10 Correct 112 ms 21972 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 112 ms 21900 KB Output is correct
13 Correct 107 ms 21824 KB Output is correct
14 Correct 103 ms 21832 KB Output is correct
15 Correct 114 ms 21888 KB Output is correct
16 Correct 107 ms 22048 KB Output is correct
17 Correct 104 ms 21976 KB Output is correct
18 Correct 110 ms 22032 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 49 ms 15284 KB Output is correct
23 Correct 106 ms 22448 KB Output is correct
24 Correct 104 ms 22020 KB Output is correct
25 Correct 125 ms 21964 KB Output is correct
26 Correct 8 ms 14508 KB Output is correct
27 Correct 110 ms 21820 KB Output is correct
28 Correct 104 ms 21952 KB Output is correct
29 Correct 113 ms 21856 KB Output is correct
30 Correct 99 ms 21848 KB Output is correct
31 Correct 102 ms 22072 KB Output is correct
32 Correct 105 ms 21936 KB Output is correct
33 Correct 106 ms 21900 KB Output is correct
34 Correct 2567 ms 66200 KB Output is correct
35 Correct 2618 ms 62492 KB Output is correct
36 Correct 2637 ms 62764 KB Output is correct
37 Incorrect 2415 ms 67716 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 15304 KB Output is correct
2 Correct 109 ms 22472 KB Output is correct
3 Correct 102 ms 21932 KB Output is correct
4 Correct 110 ms 21940 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 110 ms 21824 KB Output is correct
7 Correct 55 ms 15320 KB Output is correct
8 Correct 115 ms 22524 KB Output is correct
9 Correct 111 ms 22032 KB Output is correct
10 Correct 112 ms 21972 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 112 ms 21900 KB Output is correct
13 Correct 107 ms 21824 KB Output is correct
14 Correct 103 ms 21832 KB Output is correct
15 Correct 114 ms 21888 KB Output is correct
16 Correct 107 ms 22048 KB Output is correct
17 Correct 104 ms 21976 KB Output is correct
18 Correct 110 ms 22032 KB Output is correct
19 Correct 48 ms 15376 KB Output is correct
20 Correct 116 ms 22476 KB Output is correct
21 Correct 108 ms 21964 KB Output is correct
22 Correct 128 ms 21956 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 111 ms 21908 KB Output is correct
25 Correct 105 ms 21880 KB Output is correct
26 Correct 109 ms 21868 KB Output is correct
27 Correct 104 ms 21788 KB Output is correct
28 Correct 128 ms 22156 KB Output is correct
29 Correct 107 ms 21968 KB Output is correct
30 Correct 106 ms 21904 KB Output is correct
31 Correct 2558 ms 66136 KB Output is correct
32 Correct 2680 ms 71376 KB Output is correct
33 Correct 2337 ms 66892 KB Output is correct
34 Correct 2143 ms 70976 KB Output is correct
35 Correct 2925 ms 61368 KB Output is correct
36 Correct 2965 ms 64992 KB Output is correct
37 Correct 2611 ms 71316 KB Output is correct
38 Correct 8 ms 14420 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 7 ms 14420 KB Output is correct
41 Correct 49 ms 15284 KB Output is correct
42 Correct 106 ms 22448 KB Output is correct
43 Correct 104 ms 22020 KB Output is correct
44 Correct 125 ms 21964 KB Output is correct
45 Correct 8 ms 14508 KB Output is correct
46 Correct 110 ms 21820 KB Output is correct
47 Correct 104 ms 21952 KB Output is correct
48 Correct 113 ms 21856 KB Output is correct
49 Correct 99 ms 21848 KB Output is correct
50 Correct 102 ms 22072 KB Output is correct
51 Correct 105 ms 21936 KB Output is correct
52 Correct 106 ms 21900 KB Output is correct
53 Correct 2567 ms 66200 KB Output is correct
54 Correct 2618 ms 62492 KB Output is correct
55 Correct 2637 ms 62764 KB Output is correct
56 Incorrect 2415 ms 67716 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 15304 KB Output is correct
2 Correct 109 ms 22472 KB Output is correct
3 Correct 102 ms 21932 KB Output is correct
4 Correct 110 ms 21940 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 110 ms 21824 KB Output is correct
7 Correct 55 ms 15320 KB Output is correct
8 Correct 115 ms 22524 KB Output is correct
9 Correct 111 ms 22032 KB Output is correct
10 Correct 112 ms 21972 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 112 ms 21900 KB Output is correct
13 Correct 107 ms 21824 KB Output is correct
14 Correct 103 ms 21832 KB Output is correct
15 Correct 114 ms 21888 KB Output is correct
16 Correct 107 ms 22048 KB Output is correct
17 Correct 104 ms 21976 KB Output is correct
18 Correct 110 ms 22032 KB Output is correct
19 Correct 48 ms 15376 KB Output is correct
20 Correct 116 ms 22476 KB Output is correct
21 Correct 108 ms 21964 KB Output is correct
22 Correct 128 ms 21956 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 111 ms 21908 KB Output is correct
25 Correct 105 ms 21880 KB Output is correct
26 Correct 109 ms 21868 KB Output is correct
27 Correct 104 ms 21788 KB Output is correct
28 Correct 128 ms 22156 KB Output is correct
29 Correct 107 ms 21968 KB Output is correct
30 Correct 106 ms 21904 KB Output is correct
31 Correct 2558 ms 66136 KB Output is correct
32 Correct 2680 ms 71376 KB Output is correct
33 Correct 2337 ms 66892 KB Output is correct
34 Correct 2143 ms 70976 KB Output is correct
35 Correct 2925 ms 61368 KB Output is correct
36 Correct 2965 ms 64992 KB Output is correct
37 Correct 2611 ms 71316 KB Output is correct
38 Correct 50 ms 15316 KB Output is correct
39 Correct 131 ms 22444 KB Output is correct
40 Correct 118 ms 22132 KB Output is correct
41 Correct 112 ms 22040 KB Output is correct
42 Correct 9 ms 14420 KB Output is correct
43 Correct 117 ms 21840 KB Output is correct
44 Correct 104 ms 21836 KB Output is correct
45 Correct 107 ms 21840 KB Output is correct
46 Correct 99 ms 21812 KB Output is correct
47 Correct 109 ms 22156 KB Output is correct
48 Correct 103 ms 21972 KB Output is correct
49 Correct 106 ms 21916 KB Output is correct
50 Correct 2606 ms 65976 KB Output is correct
51 Correct 2437 ms 71288 KB Output is correct
52 Correct 2398 ms 66928 KB Output is correct
53 Correct 2132 ms 70836 KB Output is correct
54 Correct 2932 ms 61488 KB Output is correct
55 Correct 2958 ms 65048 KB Output is correct
56 Correct 2655 ms 71380 KB Output is correct
57 Correct 3180 ms 79996 KB Output is correct
58 Correct 3117 ms 94604 KB Output is correct
59 Correct 2715 ms 78436 KB Output is correct
60 Correct 2064 ms 63964 KB Output is correct
61 Execution timed out 6083 ms 80896 KB Time limit exceeded
62 Halted 0 ms 0 KB -