oj.uz

답안 #658700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658700 2022-11-14T12:49:25 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 6000 ms 94512 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;
                            // 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]) 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

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15308 KB Output is correct
2 Correct 123 ms 22484 KB Output is correct
3 Correct 107 ms 21912 KB Output is correct
4 Correct 126 ms 21920 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 110 ms 21852 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15248 KB Output is correct
2 Correct 133 ms 22496 KB Output is correct
3 Correct 120 ms 22048 KB Output is correct
4 Correct 116 ms 22016 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 155 ms 21900 KB Output is correct
7 Correct 136 ms 21844 KB Output is correct
8 Correct 106 ms 21940 KB Output is correct
9 Correct 103 ms 21824 KB Output is correct
10 Correct 109 ms 22112 KB Output is correct
11 Correct 119 ms 21972 KB Output is correct
12 Correct 120 ms 21848 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15248 KB Output is correct
2 Correct 133 ms 22496 KB Output is correct
3 Correct 120 ms 22048 KB Output is correct
4 Correct 116 ms 22016 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 155 ms 21900 KB Output is correct
7 Correct 136 ms 21844 KB Output is correct
8 Correct 106 ms 21940 KB Output is correct
9 Correct 103 ms 21824 KB Output is correct
10 Correct 109 ms 22112 KB Output is correct
11 Correct 119 ms 21972 KB Output is correct
12 Correct 120 ms 21848 KB Output is correct
13 Correct 46 ms 15368 KB Output is correct
14 Correct 117 ms 22540 KB Output is correct
15 Correct 104 ms 21956 KB Output is correct
16 Correct 151 ms 22040 KB Output is correct
17 Correct 10 ms 14516 KB Output is correct
18 Correct 120 ms 21812 KB Output is correct
19 Correct 103 ms 21836 KB Output is correct
20 Correct 103 ms 21848 KB Output is correct
21 Correct 108 ms 21828 KB Output is correct
22 Correct 101 ms 22116 KB Output is correct
23 Correct 116 ms 21952 KB Output is correct
24 Correct 102 ms 21876 KB Output is correct
25 Correct 2643 ms 66256 KB Output is correct
26 Correct 2487 ms 71328 KB Output is correct
27 Correct 2499 ms 67088 KB Output is correct
28 Correct 2156 ms 70712 KB Output is correct
29 Correct 2454 ms 61528 KB Output is correct
30 Correct 2356 ms 64832 KB Output is correct
31 Correct 2618 ms 71312 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15248 KB Output is correct
2 Correct 133 ms 22496 KB Output is correct
3 Correct 120 ms 22048 KB Output is correct
4 Correct 116 ms 22016 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 155 ms 21900 KB Output is correct
7 Correct 136 ms 21844 KB Output is correct
8 Correct 106 ms 21940 KB Output is correct
9 Correct 103 ms 21824 KB Output is correct
10 Correct 109 ms 22112 KB Output is correct
11 Correct 119 ms 21972 KB Output is correct
12 Correct 120 ms 21848 KB Output is correct
13 Correct 46 ms 15368 KB Output is correct
14 Correct 117 ms 22540 KB Output is correct
15 Correct 104 ms 21956 KB Output is correct
16 Correct 151 ms 22040 KB Output is correct
17 Correct 10 ms 14516 KB Output is correct
18 Correct 120 ms 21812 KB Output is correct
19 Correct 103 ms 21836 KB Output is correct
20 Correct 103 ms 21848 KB Output is correct
21 Correct 108 ms 21828 KB Output is correct
22 Correct 101 ms 22116 KB Output is correct
23 Correct 116 ms 21952 KB Output is correct
24 Correct 102 ms 21876 KB Output is correct
25 Correct 2643 ms 66256 KB Output is correct
26 Correct 2487 ms 71328 KB Output is correct
27 Correct 2499 ms 67088 KB Output is correct
28 Correct 2156 ms 70712 KB Output is correct
29 Correct 2454 ms 61528 KB Output is correct
30 Correct 2356 ms 64832 KB Output is correct
31 Correct 2618 ms 71312 KB Output is correct
32 Correct 41 ms 15256 KB Output is correct
33 Correct 114 ms 22416 KB Output is correct
34 Correct 103 ms 21988 KB Output is correct
35 Correct 112 ms 22168 KB Output is correct
36 Correct 9 ms 14512 KB Output is correct
37 Correct 105 ms 21844 KB Output is correct
38 Correct 105 ms 21996 KB Output is correct
39 Correct 99 ms 21836 KB Output is correct
40 Correct 107 ms 21948 KB Output is correct
41 Correct 104 ms 22228 KB Output is correct
42 Correct 102 ms 21892 KB Output is correct
43 Correct 108 ms 21936 KB Output is correct
44 Correct 2522 ms 66284 KB Output is correct
45 Correct 2420 ms 71208 KB Output is correct
46 Correct 2427 ms 67124 KB Output is correct
47 Correct 2111 ms 70900 KB Output is correct
48 Correct 2412 ms 61440 KB Output is correct
49 Correct 2386 ms 65036 KB Output is correct
50 Correct 2672 ms 71244 KB Output is correct
51 Correct 3072 ms 80004 KB Output is correct
52 Correct 3237 ms 94512 KB Output is correct
53 Correct 3011 ms 78320 KB Output is correct
54 Correct 2050 ms 63868 KB Output is correct
55 Correct 2857 ms 80768 KB Output is correct
56 Correct 2726 ms 70504 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15308 KB Output is correct
2 Correct 123 ms 22484 KB Output is correct
3 Correct 107 ms 21912 KB Output is correct
4 Correct 126 ms 21920 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 110 ms 21852 KB Output is correct
7 Correct 41 ms 15248 KB Output is correct
8 Correct 133 ms 22496 KB Output is correct
9 Correct 120 ms 22048 KB Output is correct
10 Correct 116 ms 22016 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 155 ms 21900 KB Output is correct
13 Correct 136 ms 21844 KB Output is correct
14 Correct 106 ms 21940 KB Output is correct
15 Correct 103 ms 21824 KB Output is correct
16 Correct 109 ms 22112 KB Output is correct
17 Correct 119 ms 21972 KB Output is correct
18 Correct 120 ms 21848 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Execution timed out 6071 ms 14420 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15308 KB Output is correct
2 Correct 123 ms 22484 KB Output is correct
3 Correct 107 ms 21912 KB Output is correct
4 Correct 126 ms 21920 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 110 ms 21852 KB Output is correct
7 Correct 41 ms 15248 KB Output is correct
8 Correct 133 ms 22496 KB Output is correct
9 Correct 120 ms 22048 KB Output is correct
10 Correct 116 ms 22016 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 155 ms 21900 KB Output is correct
13 Correct 136 ms 21844 KB Output is correct
14 Correct 106 ms 21940 KB Output is correct
15 Correct 103 ms 21824 KB Output is correct
16 Correct 109 ms 22112 KB Output is correct
17 Correct 119 ms 21972 KB Output is correct
18 Correct 120 ms 21848 KB Output is correct
19 Correct 46 ms 15368 KB Output is correct
20 Correct 117 ms 22540 KB Output is correct
21 Correct 104 ms 21956 KB Output is correct
22 Correct 151 ms 22040 KB Output is correct
23 Correct 10 ms 14516 KB Output is correct
24 Correct 120 ms 21812 KB Output is correct
25 Correct 103 ms 21836 KB Output is correct
26 Correct 103 ms 21848 KB Output is correct
27 Correct 108 ms 21828 KB Output is correct
28 Correct 101 ms 22116 KB Output is correct
29 Correct 116 ms 21952 KB Output is correct
30 Correct 102 ms 21876 KB Output is correct
31 Correct 2643 ms 66256 KB Output is correct
32 Correct 2487 ms 71328 KB Output is correct
33 Correct 2499 ms 67088 KB Output is correct
34 Correct 2156 ms 70712 KB Output is correct
35 Correct 2454 ms 61528 KB Output is correct
36 Correct 2356 ms 64832 KB Output is correct
37 Correct 2618 ms 71312 KB Output is correct
38 Correct 7 ms 14420 KB Output is correct
39 Correct 7 ms 14420 KB Output is correct
40 Execution timed out 6071 ms 14420 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15308 KB Output is correct
2 Correct 123 ms 22484 KB Output is correct
3 Correct 107 ms 21912 KB Output is correct
4 Correct 126 ms 21920 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 110 ms 21852 KB Output is correct
7 Correct 41 ms 15248 KB Output is correct
8 Correct 133 ms 22496 KB Output is correct
9 Correct 120 ms 22048 KB Output is correct
10 Correct 116 ms 22016 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 155 ms 21900 KB Output is correct
13 Correct 136 ms 21844 KB Output is correct
14 Correct 106 ms 21940 KB Output is correct
15 Correct 103 ms 21824 KB Output is correct
16 Correct 109 ms 22112 KB Output is correct
17 Correct 119 ms 21972 KB Output is correct
18 Correct 120 ms 21848 KB Output is correct
19 Correct 46 ms 15368 KB Output is correct
20 Correct 117 ms 22540 KB Output is correct
21 Correct 104 ms 21956 KB Output is correct
22 Correct 151 ms 22040 KB Output is correct
23 Correct 10 ms 14516 KB Output is correct
24 Correct 120 ms 21812 KB Output is correct
25 Correct 103 ms 21836 KB Output is correct
26 Correct 103 ms 21848 KB Output is correct
27 Correct 108 ms 21828 KB Output is correct
28 Correct 101 ms 22116 KB Output is correct
29 Correct 116 ms 21952 KB Output is correct
30 Correct 102 ms 21876 KB Output is correct
31 Correct 2643 ms 66256 KB Output is correct
32 Correct 2487 ms 71328 KB Output is correct
33 Correct 2499 ms 67088 KB Output is correct
34 Correct 2156 ms 70712 KB Output is correct
35 Correct 2454 ms 61528 KB Output is correct
36 Correct 2356 ms 64832 KB Output is correct
37 Correct 2618 ms 71312 KB Output is correct
38 Correct 41 ms 15256 KB Output is correct
39 Correct 114 ms 22416 KB Output is correct
40 Correct 103 ms 21988 KB Output is correct
41 Correct 112 ms 22168 KB Output is correct
42 Correct 9 ms 14512 KB Output is correct
43 Correct 105 ms 21844 KB Output is correct
44 Correct 105 ms 21996 KB Output is correct
45 Correct 99 ms 21836 KB Output is correct
46 Correct 107 ms 21948 KB Output is correct
47 Correct 104 ms 22228 KB Output is correct
48 Correct 102 ms 21892 KB Output is correct
49 Correct 108 ms 21936 KB Output is correct
50 Correct 2522 ms 66284 KB Output is correct
51 Correct 2420 ms 71208 KB Output is correct
52 Correct 2427 ms 67124 KB Output is correct
53 Correct 2111 ms 70900 KB Output is correct
54 Correct 2412 ms 61440 KB Output is correct
55 Correct 2386 ms 65036 KB Output is correct
56 Correct 2672 ms 71244 KB Output is correct
57 Correct 3072 ms 80004 KB Output is correct
58 Correct 3237 ms 94512 KB Output is correct
59 Correct 3011 ms 78320 KB Output is correct
60 Correct 2050 ms 63868 KB Output is correct
61 Correct 2857 ms 80768 KB Output is correct
62 Correct 2726 ms 70504 KB Output is correct
63 Correct 7 ms 14420 KB Output is correct
64 Correct 7 ms 14420 KB Output is correct
65 Execution timed out 6071 ms 14420 KB Time limit exceeded
66 Halted 0 ms 0 KB -