oj.uz

Submission #658703

# Submission time Handle Problem Language Result Execution time Memory
658703 2022-11-14T12:59:25 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 3242 ms 94596 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]) && idrt[u] == idrt[v]) continue;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        pq.push(mp(d[v][t1],mp(v,t1)));
                    }

                    if(idrt[v] != idrt[u]) {
                        set<int> stt1;
                        d1 = dlol[u]+1;
                        while(true) {
                            int t1 = d1%szrt[idrt[v]];
                            if(stt1.count(t1)) break;
                            stt1.insert(t1);
                            // 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(d[v][t1] > d1 && t1 != thrt[v]) {
                                d[v][t1] = d1;
                                pq.push(mp(d[v][t1],mp(v,t1)));
                            }
                            d1+= szrt[idrt[u]];
                        }
                    }
                }
                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] && idrt[u] == idrt[v])) && 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] && idrt[u] == idrt[v])) && 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;
}

Compilation message

watchmen.cpp: In function 'int32_t main()':
watchmen.cpp:80:97: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   80 |                     if(t1 == thrt[v] || (thrt[u] == (thrt[v]+1)%szrt[idrt[u]] && t1 == thrt[u]) && idrt[u] == idrt[v]) continue;
      |                                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15740 KB Output is correct
2 Correct 153 ms 22908 KB Output is correct
3 Correct 143 ms 22504 KB Output is correct
4 Correct 142 ms 22428 KB Output is correct
5 Correct 11 ms 14504 KB Output is correct
6 Correct 144 ms 22288 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15716 KB Output is correct
2 Correct 146 ms 22896 KB Output is correct
3 Correct 122 ms 22360 KB Output is correct
4 Correct 156 ms 22468 KB Output is correct
5 Correct 11 ms 14468 KB Output is correct
6 Correct 156 ms 22216 KB Output is correct
7 Correct 131 ms 22256 KB Output is correct
8 Correct 119 ms 22296 KB Output is correct
9 Correct 116 ms 22188 KB Output is correct
10 Correct 115 ms 22496 KB Output is correct
11 Correct 111 ms 22348 KB Output is correct
12 Correct 226 ms 22268 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15716 KB Output is correct
2 Correct 146 ms 22896 KB Output is correct
3 Correct 122 ms 22360 KB Output is correct
4 Correct 156 ms 22468 KB Output is correct
5 Correct 11 ms 14468 KB Output is correct
6 Correct 156 ms 22216 KB Output is correct
7 Correct 131 ms 22256 KB Output is correct
8 Correct 119 ms 22296 KB Output is correct
9 Correct 116 ms 22188 KB Output is correct
10 Correct 115 ms 22496 KB Output is correct
11 Correct 111 ms 22348 KB Output is correct
12 Correct 226 ms 22268 KB Output is correct
13 Correct 44 ms 15708 KB Output is correct
14 Correct 127 ms 22988 KB Output is correct
15 Correct 123 ms 22416 KB Output is correct
16 Correct 125 ms 22348 KB Output is correct
17 Correct 10 ms 14444 KB Output is correct
18 Correct 109 ms 22284 KB Output is correct
19 Correct 135 ms 22348 KB Output is correct
20 Correct 136 ms 22272 KB Output is correct
21 Correct 116 ms 22256 KB Output is correct
22 Correct 113 ms 22476 KB Output is correct
23 Correct 105 ms 22372 KB Output is correct
24 Correct 201 ms 22240 KB Output is correct
25 Correct 2734 ms 66640 KB Output is correct
26 Correct 2557 ms 71840 KB Output is correct
27 Correct 2503 ms 67640 KB Output is correct
28 Correct 2229 ms 71540 KB Output is correct
29 Correct 2950 ms 62152 KB Output is correct
30 Correct 2651 ms 65824 KB Output is correct
31 Correct 2802 ms 72224 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15716 KB Output is correct
2 Correct 146 ms 22896 KB Output is correct
3 Correct 122 ms 22360 KB Output is correct
4 Correct 156 ms 22468 KB Output is correct
5 Correct 11 ms 14468 KB Output is correct
6 Correct 156 ms 22216 KB Output is correct
7 Correct 131 ms 22256 KB Output is correct
8 Correct 119 ms 22296 KB Output is correct
9 Correct 116 ms 22188 KB Output is correct
10 Correct 115 ms 22496 KB Output is correct
11 Correct 111 ms 22348 KB Output is correct
12 Correct 226 ms 22268 KB Output is correct
13 Correct 44 ms 15708 KB Output is correct
14 Correct 127 ms 22988 KB Output is correct
15 Correct 123 ms 22416 KB Output is correct
16 Correct 125 ms 22348 KB Output is correct
17 Correct 10 ms 14444 KB Output is correct
18 Correct 109 ms 22284 KB Output is correct
19 Correct 135 ms 22348 KB Output is correct
20 Correct 136 ms 22272 KB Output is correct
21 Correct 116 ms 22256 KB Output is correct
22 Correct 113 ms 22476 KB Output is correct
23 Correct 105 ms 22372 KB Output is correct
24 Correct 201 ms 22240 KB Output is correct
25 Correct 2734 ms 66640 KB Output is correct
26 Correct 2557 ms 71840 KB Output is correct
27 Correct 2503 ms 67640 KB Output is correct
28 Correct 2229 ms 71540 KB Output is correct
29 Correct 2950 ms 62152 KB Output is correct
30 Correct 2651 ms 65824 KB Output is correct
31 Correct 2802 ms 72224 KB Output is correct
32 Correct 43 ms 15636 KB Output is correct
33 Correct 125 ms 22904 KB Output is correct
34 Correct 119 ms 22348 KB Output is correct
35 Correct 120 ms 22372 KB Output is correct
36 Correct 10 ms 14424 KB Output is correct
37 Correct 107 ms 22240 KB Output is correct
38 Correct 104 ms 22252 KB Output is correct
39 Correct 113 ms 22196 KB Output is correct
40 Correct 107 ms 22188 KB Output is correct
41 Correct 114 ms 22500 KB Output is correct
42 Correct 123 ms 22288 KB Output is correct
43 Correct 104 ms 22276 KB Output is correct
44 Correct 2802 ms 66724 KB Output is correct
45 Correct 2761 ms 71944 KB Output is correct
46 Correct 2668 ms 67296 KB Output is correct
47 Correct 2498 ms 71452 KB Output is correct
48 Correct 2822 ms 61528 KB Output is correct
49 Correct 2736 ms 64844 KB Output is correct
50 Correct 2769 ms 71300 KB Output is correct
51 Correct 3053 ms 80092 KB Output is correct
52 Correct 3242 ms 94596 KB Output is correct
53 Correct 2878 ms 78420 KB Output is correct
54 Correct 2087 ms 64028 KB Output is correct
55 Correct 3030 ms 80848 KB Output is correct
56 Correct 2817 ms 70748 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15740 KB Output is correct
2 Correct 153 ms 22908 KB Output is correct
3 Correct 143 ms 22504 KB Output is correct
4 Correct 142 ms 22428 KB Output is correct
5 Correct 11 ms 14504 KB Output is correct
6 Correct 144 ms 22288 KB Output is correct
7 Correct 46 ms 15716 KB Output is correct
8 Correct 146 ms 22896 KB Output is correct
9 Correct 122 ms 22360 KB Output is correct
10 Correct 156 ms 22468 KB Output is correct
11 Correct 11 ms 14468 KB Output is correct
12 Correct 156 ms 22216 KB Output is correct
13 Correct 131 ms 22256 KB Output is correct
14 Correct 119 ms 22296 KB Output is correct
15 Correct 116 ms 22188 KB Output is correct
16 Correct 115 ms 22496 KB Output is correct
17 Correct 111 ms 22348 KB Output is correct
18 Correct 226 ms 22268 KB Output is correct
19 Correct 8 ms 14384 KB Output is correct
20 Correct 9 ms 14372 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 41 ms 15316 KB Output is correct
23 Correct 112 ms 22604 KB Output is correct
24 Correct 119 ms 21988 KB Output is correct
25 Correct 115 ms 22040 KB Output is correct
26 Correct 9 ms 14512 KB Output is correct
27 Correct 108 ms 21832 KB Output is correct
28 Correct 105 ms 21832 KB Output is correct
29 Correct 102 ms 21832 KB Output is correct
30 Correct 107 ms 21884 KB Output is correct
31 Correct 105 ms 22092 KB Output is correct
32 Correct 100 ms 21976 KB Output is correct
33 Correct 103 ms 21832 KB Output is correct
34 Correct 2595 ms 66100 KB Output is correct
35 Correct 2611 ms 62600 KB Output is correct
36 Correct 2636 ms 62520 KB Output is correct
37 Incorrect 2453 ms 67664 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15740 KB Output is correct
2 Correct 153 ms 22908 KB Output is correct
3 Correct 143 ms 22504 KB Output is correct
4 Correct 142 ms 22428 KB Output is correct
5 Correct 11 ms 14504 KB Output is correct
6 Correct 144 ms 22288 KB Output is correct
7 Correct 46 ms 15716 KB Output is correct
8 Correct 146 ms 22896 KB Output is correct
9 Correct 122 ms 22360 KB Output is correct
10 Correct 156 ms 22468 KB Output is correct
11 Correct 11 ms 14468 KB Output is correct
12 Correct 156 ms 22216 KB Output is correct
13 Correct 131 ms 22256 KB Output is correct
14 Correct 119 ms 22296 KB Output is correct
15 Correct 116 ms 22188 KB Output is correct
16 Correct 115 ms 22496 KB Output is correct
17 Correct 111 ms 22348 KB Output is correct
18 Correct 226 ms 22268 KB Output is correct
19 Correct 44 ms 15708 KB Output is correct
20 Correct 127 ms 22988 KB Output is correct
21 Correct 123 ms 22416 KB Output is correct
22 Correct 125 ms 22348 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 109 ms 22284 KB Output is correct
25 Correct 135 ms 22348 KB Output is correct
26 Correct 136 ms 22272 KB Output is correct
27 Correct 116 ms 22256 KB Output is correct
28 Correct 113 ms 22476 KB Output is correct
29 Correct 105 ms 22372 KB Output is correct
30 Correct 201 ms 22240 KB Output is correct
31 Correct 2734 ms 66640 KB Output is correct
32 Correct 2557 ms 71840 KB Output is correct
33 Correct 2503 ms 67640 KB Output is correct
34 Correct 2229 ms 71540 KB Output is correct
35 Correct 2950 ms 62152 KB Output is correct
36 Correct 2651 ms 65824 KB Output is correct
37 Correct 2802 ms 72224 KB Output is correct
38 Correct 8 ms 14384 KB Output is correct
39 Correct 9 ms 14372 KB Output is correct
40 Correct 9 ms 14420 KB Output is correct
41 Correct 41 ms 15316 KB Output is correct
42 Correct 112 ms 22604 KB Output is correct
43 Correct 119 ms 21988 KB Output is correct
44 Correct 115 ms 22040 KB Output is correct
45 Correct 9 ms 14512 KB Output is correct
46 Correct 108 ms 21832 KB Output is correct
47 Correct 105 ms 21832 KB Output is correct
48 Correct 102 ms 21832 KB Output is correct
49 Correct 107 ms 21884 KB Output is correct
50 Correct 105 ms 22092 KB Output is correct
51 Correct 100 ms 21976 KB Output is correct
52 Correct 103 ms 21832 KB Output is correct
53 Correct 2595 ms 66100 KB Output is correct
54 Correct 2611 ms 62600 KB Output is correct
55 Correct 2636 ms 62520 KB Output is correct
56 Incorrect 2453 ms 67664 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 15740 KB Output is correct
2 Correct 153 ms 22908 KB Output is correct
3 Correct 143 ms 22504 KB Output is correct
4 Correct 142 ms 22428 KB Output is correct
5 Correct 11 ms 14504 KB Output is correct
6 Correct 144 ms 22288 KB Output is correct
7 Correct 46 ms 15716 KB Output is correct
8 Correct 146 ms 22896 KB Output is correct
9 Correct 122 ms 22360 KB Output is correct
10 Correct 156 ms 22468 KB Output is correct
11 Correct 11 ms 14468 KB Output is correct
12 Correct 156 ms 22216 KB Output is correct
13 Correct 131 ms 22256 KB Output is correct
14 Correct 119 ms 22296 KB Output is correct
15 Correct 116 ms 22188 KB Output is correct
16 Correct 115 ms 22496 KB Output is correct
17 Correct 111 ms 22348 KB Output is correct
18 Correct 226 ms 22268 KB Output is correct
19 Correct 44 ms 15708 KB Output is correct
20 Correct 127 ms 22988 KB Output is correct
21 Correct 123 ms 22416 KB Output is correct
22 Correct 125 ms 22348 KB Output is correct
23 Correct 10 ms 14444 KB Output is correct
24 Correct 109 ms 22284 KB Output is correct
25 Correct 135 ms 22348 KB Output is correct
26 Correct 136 ms 22272 KB Output is correct
27 Correct 116 ms 22256 KB Output is correct
28 Correct 113 ms 22476 KB Output is correct
29 Correct 105 ms 22372 KB Output is correct
30 Correct 201 ms 22240 KB Output is correct
31 Correct 2734 ms 66640 KB Output is correct
32 Correct 2557 ms 71840 KB Output is correct
33 Correct 2503 ms 67640 KB Output is correct
34 Correct 2229 ms 71540 KB Output is correct
35 Correct 2950 ms 62152 KB Output is correct
36 Correct 2651 ms 65824 KB Output is correct
37 Correct 2802 ms 72224 KB Output is correct
38 Correct 43 ms 15636 KB Output is correct
39 Correct 125 ms 22904 KB Output is correct
40 Correct 119 ms 22348 KB Output is correct
41 Correct 120 ms 22372 KB Output is correct
42 Correct 10 ms 14424 KB Output is correct
43 Correct 107 ms 22240 KB Output is correct
44 Correct 104 ms 22252 KB Output is correct
45 Correct 113 ms 22196 KB Output is correct
46 Correct 107 ms 22188 KB Output is correct
47 Correct 114 ms 22500 KB Output is correct
48 Correct 123 ms 22288 KB Output is correct
49 Correct 104 ms 22276 KB Output is correct
50 Correct 2802 ms 66724 KB Output is correct
51 Correct 2761 ms 71944 KB Output is correct
52 Correct 2668 ms 67296 KB Output is correct
53 Correct 2498 ms 71452 KB Output is correct
54 Correct 2822 ms 61528 KB Output is correct
55 Correct 2736 ms 64844 KB Output is correct
56 Correct 2769 ms 71300 KB Output is correct
57 Correct 3053 ms 80092 KB Output is correct
58 Correct 3242 ms 94596 KB Output is correct
59 Correct 2878 ms 78420 KB Output is correct
60 Correct 2087 ms 64028 KB Output is correct
61 Correct 3030 ms 80848 KB Output is correct
62 Correct 2817 ms 70748 KB Output is correct
63 Correct 8 ms 14384 KB Output is correct
64 Correct 9 ms 14372 KB Output is correct
65 Correct 9 ms 14420 KB Output is correct
66 Correct 41 ms 15316 KB Output is correct
67 Correct 112 ms 22604 KB Output is correct
68 Correct 119 ms 21988 KB Output is correct
69 Correct 115 ms 22040 KB Output is correct
70 Correct 9 ms 14512 KB Output is correct
71 Correct 108 ms 21832 KB Output is correct
72 Correct 105 ms 21832 KB Output is correct
73 Correct 102 ms 21832 KB Output is correct
74 Correct 107 ms 21884 KB Output is correct
75 Correct 105 ms 22092 KB Output is correct
76 Correct 100 ms 21976 KB Output is correct
77 Correct 103 ms 21832 KB Output is correct
78 Correct 2595 ms 66100 KB Output is correct
79 Correct 2611 ms 62600 KB Output is correct
80 Correct 2636 ms 62520 KB Output is correct
81 Incorrect 2453 ms 67664 KB Output isn't correct
82 Halted 0 ms 0 KB -