oj.uz

Submission #658702

# Submission time Handle Problem Language Result Execution time Memory
658702 2022-11-14T12:58:46 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 3533 ms 95344 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(t1 == thrt[v]) {
                                d1+= szrt[idrt[u]];
                                continue;
                            }
                            if(d[v][t1] > d1) {
                                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 49 ms 15424 KB Output is correct
2 Correct 122 ms 22600 KB Output is correct
3 Correct 107 ms 22096 KB Output is correct
4 Correct 126 ms 22084 KB Output is correct
5 Correct 10 ms 14440 KB Output is correct
6 Correct 113 ms 21936 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 15388 KB Output is correct
2 Correct 160 ms 22648 KB Output is correct
3 Correct 115 ms 22184 KB Output is correct
4 Correct 111 ms 22140 KB Output is correct
5 Correct 13 ms 14420 KB Output is correct
6 Correct 114 ms 22020 KB Output is correct
7 Correct 113 ms 22140 KB Output is correct
8 Correct 116 ms 21964 KB Output is correct
9 Correct 142 ms 21916 KB Output is correct
10 Correct 124 ms 22256 KB Output is correct
11 Correct 114 ms 21996 KB Output is correct
12 Correct 115 ms 21952 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 15388 KB Output is correct
2 Correct 160 ms 22648 KB Output is correct
3 Correct 115 ms 22184 KB Output is correct
4 Correct 111 ms 22140 KB Output is correct
5 Correct 13 ms 14420 KB Output is correct
6 Correct 114 ms 22020 KB Output is correct
7 Correct 113 ms 22140 KB Output is correct
8 Correct 116 ms 21964 KB Output is correct
9 Correct 142 ms 21916 KB Output is correct
10 Correct 124 ms 22256 KB Output is correct
11 Correct 114 ms 21996 KB Output is correct
12 Correct 115 ms 21952 KB Output is correct
13 Correct 46 ms 15436 KB Output is correct
14 Correct 128 ms 22648 KB Output is correct
15 Correct 116 ms 22200 KB Output is correct
16 Correct 110 ms 22092 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 108 ms 22080 KB Output is correct
19 Correct 110 ms 21924 KB Output is correct
20 Correct 105 ms 21968 KB Output is correct
21 Correct 147 ms 21972 KB Output is correct
22 Correct 110 ms 22244 KB Output is correct
23 Correct 116 ms 22088 KB Output is correct
24 Correct 110 ms 21968 KB Output is correct
25 Correct 2719 ms 66432 KB Output is correct
26 Correct 2549 ms 71424 KB Output is correct
27 Correct 2487 ms 67184 KB Output is correct
28 Correct 2175 ms 71124 KB Output is correct
29 Correct 2539 ms 61640 KB Output is correct
30 Correct 2493 ms 65196 KB Output is correct
31 Correct 2768 ms 71660 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 15388 KB Output is correct
2 Correct 160 ms 22648 KB Output is correct
3 Correct 115 ms 22184 KB Output is correct
4 Correct 111 ms 22140 KB Output is correct
5 Correct 13 ms 14420 KB Output is correct
6 Correct 114 ms 22020 KB Output is correct
7 Correct 113 ms 22140 KB Output is correct
8 Correct 116 ms 21964 KB Output is correct
9 Correct 142 ms 21916 KB Output is correct
10 Correct 124 ms 22256 KB Output is correct
11 Correct 114 ms 21996 KB Output is correct
12 Correct 115 ms 21952 KB Output is correct
13 Correct 46 ms 15436 KB Output is correct
14 Correct 128 ms 22648 KB Output is correct
15 Correct 116 ms 22200 KB Output is correct
16 Correct 110 ms 22092 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 108 ms 22080 KB Output is correct
19 Correct 110 ms 21924 KB Output is correct
20 Correct 105 ms 21968 KB Output is correct
21 Correct 147 ms 21972 KB Output is correct
22 Correct 110 ms 22244 KB Output is correct
23 Correct 116 ms 22088 KB Output is correct
24 Correct 110 ms 21968 KB Output is correct
25 Correct 2719 ms 66432 KB Output is correct
26 Correct 2549 ms 71424 KB Output is correct
27 Correct 2487 ms 67184 KB Output is correct
28 Correct 2175 ms 71124 KB Output is correct
29 Correct 2539 ms 61640 KB Output is correct
30 Correct 2493 ms 65196 KB Output is correct
31 Correct 2768 ms 71660 KB Output is correct
32 Correct 51 ms 15444 KB Output is correct
33 Correct 130 ms 22632 KB Output is correct
34 Correct 127 ms 22124 KB Output is correct
35 Correct 141 ms 22168 KB Output is correct
36 Correct 10 ms 14420 KB Output is correct
37 Correct 133 ms 22012 KB Output is correct
38 Correct 116 ms 21968 KB Output is correct
39 Correct 122 ms 21952 KB Output is correct
40 Correct 116 ms 21936 KB Output is correct
41 Correct 117 ms 22256 KB Output is correct
42 Correct 114 ms 22112 KB Output is correct
43 Correct 119 ms 21992 KB Output is correct
44 Correct 2782 ms 66212 KB Output is correct
45 Correct 2547 ms 71548 KB Output is correct
46 Correct 2501 ms 67072 KB Output is correct
47 Correct 2842 ms 71340 KB Output is correct
48 Correct 2917 ms 61800 KB Output is correct
49 Correct 3022 ms 65648 KB Output is correct
50 Correct 2924 ms 72188 KB Output is correct
51 Correct 3259 ms 80744 KB Output is correct
52 Correct 3411 ms 95344 KB Output is correct
53 Correct 3533 ms 78916 KB Output is correct
54 Correct 2238 ms 64968 KB Output is correct
55 Correct 3247 ms 81152 KB Output is correct
56 Correct 3165 ms 71320 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15424 KB Output is correct
2 Correct 122 ms 22600 KB Output is correct
3 Correct 107 ms 22096 KB Output is correct
4 Correct 126 ms 22084 KB Output is correct
5 Correct 10 ms 14440 KB Output is correct
6 Correct 113 ms 21936 KB Output is correct
7 Correct 43 ms 15388 KB Output is correct
8 Correct 160 ms 22648 KB Output is correct
9 Correct 115 ms 22184 KB Output is correct
10 Correct 111 ms 22140 KB Output is correct
11 Correct 13 ms 14420 KB Output is correct
12 Correct 114 ms 22020 KB Output is correct
13 Correct 113 ms 22140 KB Output is correct
14 Correct 116 ms 21964 KB Output is correct
15 Correct 142 ms 21916 KB Output is correct
16 Correct 124 ms 22256 KB Output is correct
17 Correct 114 ms 21996 KB Output is correct
18 Correct 115 ms 21952 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14396 KB Output is correct
21 Correct 8 ms 14356 KB Output is correct
22 Correct 46 ms 15692 KB Output is correct
23 Correct 147 ms 22824 KB Output is correct
24 Correct 182 ms 22320 KB Output is correct
25 Correct 122 ms 22392 KB Output is correct
26 Correct 10 ms 14400 KB Output is correct
27 Correct 129 ms 22284 KB Output is correct
28 Correct 147 ms 22220 KB Output is correct
29 Correct 109 ms 22216 KB Output is correct
30 Correct 120 ms 22220 KB Output is correct
31 Correct 119 ms 22516 KB Output is correct
32 Correct 116 ms 22316 KB Output is correct
33 Correct 113 ms 22348 KB Output is correct
34 Correct 2863 ms 66472 KB Output is correct
35 Correct 2959 ms 63168 KB Output is correct
36 Correct 3056 ms 63012 KB Output is correct
37 Incorrect 2881 ms 67656 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15424 KB Output is correct
2 Correct 122 ms 22600 KB Output is correct
3 Correct 107 ms 22096 KB Output is correct
4 Correct 126 ms 22084 KB Output is correct
5 Correct 10 ms 14440 KB Output is correct
6 Correct 113 ms 21936 KB Output is correct
7 Correct 43 ms 15388 KB Output is correct
8 Correct 160 ms 22648 KB Output is correct
9 Correct 115 ms 22184 KB Output is correct
10 Correct 111 ms 22140 KB Output is correct
11 Correct 13 ms 14420 KB Output is correct
12 Correct 114 ms 22020 KB Output is correct
13 Correct 113 ms 22140 KB Output is correct
14 Correct 116 ms 21964 KB Output is correct
15 Correct 142 ms 21916 KB Output is correct
16 Correct 124 ms 22256 KB Output is correct
17 Correct 114 ms 21996 KB Output is correct
18 Correct 115 ms 21952 KB Output is correct
19 Correct 46 ms 15436 KB Output is correct
20 Correct 128 ms 22648 KB Output is correct
21 Correct 116 ms 22200 KB Output is correct
22 Correct 110 ms 22092 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 108 ms 22080 KB Output is correct
25 Correct 110 ms 21924 KB Output is correct
26 Correct 105 ms 21968 KB Output is correct
27 Correct 147 ms 21972 KB Output is correct
28 Correct 110 ms 22244 KB Output is correct
29 Correct 116 ms 22088 KB Output is correct
30 Correct 110 ms 21968 KB Output is correct
31 Correct 2719 ms 66432 KB Output is correct
32 Correct 2549 ms 71424 KB Output is correct
33 Correct 2487 ms 67184 KB Output is correct
34 Correct 2175 ms 71124 KB Output is correct
35 Correct 2539 ms 61640 KB Output is correct
36 Correct 2493 ms 65196 KB Output is correct
37 Correct 2768 ms 71660 KB Output is correct
38 Correct 9 ms 14420 KB Output is correct
39 Correct 8 ms 14396 KB Output is correct
40 Correct 8 ms 14356 KB Output is correct
41 Correct 46 ms 15692 KB Output is correct
42 Correct 147 ms 22824 KB Output is correct
43 Correct 182 ms 22320 KB Output is correct
44 Correct 122 ms 22392 KB Output is correct
45 Correct 10 ms 14400 KB Output is correct
46 Correct 129 ms 22284 KB Output is correct
47 Correct 147 ms 22220 KB Output is correct
48 Correct 109 ms 22216 KB Output is correct
49 Correct 120 ms 22220 KB Output is correct
50 Correct 119 ms 22516 KB Output is correct
51 Correct 116 ms 22316 KB Output is correct
52 Correct 113 ms 22348 KB Output is correct
53 Correct 2863 ms 66472 KB Output is correct
54 Correct 2959 ms 63168 KB Output is correct
55 Correct 3056 ms 63012 KB Output is correct
56 Incorrect 2881 ms 67656 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15424 KB Output is correct
2 Correct 122 ms 22600 KB Output is correct
3 Correct 107 ms 22096 KB Output is correct
4 Correct 126 ms 22084 KB Output is correct
5 Correct 10 ms 14440 KB Output is correct
6 Correct 113 ms 21936 KB Output is correct
7 Correct 43 ms 15388 KB Output is correct
8 Correct 160 ms 22648 KB Output is correct
9 Correct 115 ms 22184 KB Output is correct
10 Correct 111 ms 22140 KB Output is correct
11 Correct 13 ms 14420 KB Output is correct
12 Correct 114 ms 22020 KB Output is correct
13 Correct 113 ms 22140 KB Output is correct
14 Correct 116 ms 21964 KB Output is correct
15 Correct 142 ms 21916 KB Output is correct
16 Correct 124 ms 22256 KB Output is correct
17 Correct 114 ms 21996 KB Output is correct
18 Correct 115 ms 21952 KB Output is correct
19 Correct 46 ms 15436 KB Output is correct
20 Correct 128 ms 22648 KB Output is correct
21 Correct 116 ms 22200 KB Output is correct
22 Correct 110 ms 22092 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 108 ms 22080 KB Output is correct
25 Correct 110 ms 21924 KB Output is correct
26 Correct 105 ms 21968 KB Output is correct
27 Correct 147 ms 21972 KB Output is correct
28 Correct 110 ms 22244 KB Output is correct
29 Correct 116 ms 22088 KB Output is correct
30 Correct 110 ms 21968 KB Output is correct
31 Correct 2719 ms 66432 KB Output is correct
32 Correct 2549 ms 71424 KB Output is correct
33 Correct 2487 ms 67184 KB Output is correct
34 Correct 2175 ms 71124 KB Output is correct
35 Correct 2539 ms 61640 KB Output is correct
36 Correct 2493 ms 65196 KB Output is correct
37 Correct 2768 ms 71660 KB Output is correct
38 Correct 51 ms 15444 KB Output is correct
39 Correct 130 ms 22632 KB Output is correct
40 Correct 127 ms 22124 KB Output is correct
41 Correct 141 ms 22168 KB Output is correct
42 Correct 10 ms 14420 KB Output is correct
43 Correct 133 ms 22012 KB Output is correct
44 Correct 116 ms 21968 KB Output is correct
45 Correct 122 ms 21952 KB Output is correct
46 Correct 116 ms 21936 KB Output is correct
47 Correct 117 ms 22256 KB Output is correct
48 Correct 114 ms 22112 KB Output is correct
49 Correct 119 ms 21992 KB Output is correct
50 Correct 2782 ms 66212 KB Output is correct
51 Correct 2547 ms 71548 KB Output is correct
52 Correct 2501 ms 67072 KB Output is correct
53 Correct 2842 ms 71340 KB Output is correct
54 Correct 2917 ms 61800 KB Output is correct
55 Correct 3022 ms 65648 KB Output is correct
56 Correct 2924 ms 72188 KB Output is correct
57 Correct 3259 ms 80744 KB Output is correct
58 Correct 3411 ms 95344 KB Output is correct
59 Correct 3533 ms 78916 KB Output is correct
60 Correct 2238 ms 64968 KB Output is correct
61 Correct 3247 ms 81152 KB Output is correct
62 Correct 3165 ms 71320 KB Output is correct
63 Correct 9 ms 14420 KB Output is correct
64 Correct 8 ms 14396 KB Output is correct
65 Correct 8 ms 14356 KB Output is correct
66 Correct 46 ms 15692 KB Output is correct
67 Correct 147 ms 22824 KB Output is correct
68 Correct 182 ms 22320 KB Output is correct
69 Correct 122 ms 22392 KB Output is correct
70 Correct 10 ms 14400 KB Output is correct
71 Correct 129 ms 22284 KB Output is correct
72 Correct 147 ms 22220 KB Output is correct
73 Correct 109 ms 22216 KB Output is correct
74 Correct 120 ms 22220 KB Output is correct
75 Correct 119 ms 22516 KB Output is correct
76 Correct 116 ms 22316 KB Output is correct
77 Correct 113 ms 22348 KB Output is correct
78 Correct 2863 ms 66472 KB Output is correct
79 Correct 2959 ms 63168 KB Output is correct
80 Correct 3056 ms 63012 KB Output is correct
81 Incorrect 2881 ms 67656 KB Output isn't correct
82 Halted 0 ms 0 KB -