oj.uz

답안 #658720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658720 2022-11-14T13:56:58 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
35 / 100
 2992 ms 275560 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;
const int maxd = 5e6;

int n, m, k;
int szrt[maxn], idrt[maxn], thrt[maxn], isrt[maxn], nxrt[maxn], pvrt[maxn], dlol[maxn];
int fqt1[maxn];
int cntwtf = 0;
vector<int> g[maxn], gdiffrt[maxn], d[maxn];
vector<pair<int,int>> withdist[maxd+1];

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;
                }

                if(isrt[v] && idrt[v] != idrt[u]) {
                    gdiffrt[u].pb(v);
                }
            }
        }
        else {
            d[i].pb(inf);
        }

    }

    d[1][0] = 0;
    withdist[0].pb(mp(1,0));
    for(int distcur = 0; distcur <= maxd; distcur++) {
    while(withdist[distcur].size()) {
        auto X = withdist[distcur].back();
        withdist[distcur].pop_back();
        int u = X.fr;
        int t = X.sc;
        if(t != -1 && distcur != d[u][t]) continue;
        if(t == -1 && distcur != 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;
                        withdist[d[v][t1]].pb(mp(v,t1));
                    }
                }
                else {
                    int d1 = dlol[u]+1;
                    int t1 = 0;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        withdist[d[v][t1]].pb(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;
                withdist[d[v][t1]].pb(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;
                withdist[d[v][t1]].pb(mp(v,t1));
            }

            if(dlol[u] > d[u][t]) {
                dlol[u] = d[u][t];
                withdist[dlol[u]].pb(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;
                withdist[d[v][t1]].pb(mp(v,t1));
            }

            for(auto v : gdiffrt[u]) {
                d1 = d[u][t]+1;
                while(true) {
                    int t1 = d1%szrt[idrt[v]];
                    if(fqt1[t1] == idrt[u]) break;
                    fqt1[t1] = idrt[u];
                    // 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;
                        withdist[d[v][t1]].pb(mp(v,t1));
                    }
                    d1+= szrt[idrt[u]];
                }
            }
        }
        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;
                        withdist[d[v][t1]].pb(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;
                        withdist[d[v][t1]].pb(mp(v,t1));
                    }
                }
                else {
                    int d1 = d[u][t]+1;
                    int t1 = 0;
                    if(d[v][t1] > d1) {
                        d[v][t1] = d1;
                        withdist[d[v][t1]].pb(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:87:97: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   87 |                     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 108 ms 140544 KB Output is correct
2 Correct 175 ms 151260 KB Output is correct
3 Correct 172 ms 149844 KB Output is correct
4 Correct 185 ms 149500 KB Output is correct
5 Correct 79 ms 139036 KB Output is correct
6 Correct 164 ms 149580 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 140428 KB Output is correct
2 Correct 177 ms 151200 KB Output is correct
3 Correct 171 ms 149788 KB Output is correct
4 Correct 177 ms 149584 KB Output is correct
5 Correct 75 ms 139092 KB Output is correct
6 Correct 185 ms 149624 KB Output is correct
7 Correct 164 ms 149832 KB Output is correct
8 Correct 189 ms 150020 KB Output is correct
9 Correct 173 ms 150152 KB Output is correct
10 Correct 186 ms 148940 KB Output is correct
11 Correct 161 ms 148428 KB Output is correct
12 Correct 187 ms 149480 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 140428 KB Output is correct
2 Correct 177 ms 151200 KB Output is correct
3 Correct 171 ms 149788 KB Output is correct
4 Correct 177 ms 149584 KB Output is correct
5 Correct 75 ms 139092 KB Output is correct
6 Correct 185 ms 149624 KB Output is correct
7 Correct 164 ms 149832 KB Output is correct
8 Correct 189 ms 150020 KB Output is correct
9 Correct 173 ms 150152 KB Output is correct
10 Correct 186 ms 148940 KB Output is correct
11 Correct 161 ms 148428 KB Output is correct
12 Correct 187 ms 149480 KB Output is correct
13 Correct 111 ms 140516 KB Output is correct
14 Correct 180 ms 151232 KB Output is correct
15 Correct 175 ms 149904 KB Output is correct
16 Correct 175 ms 149588 KB Output is correct
17 Correct 79 ms 139084 KB Output is correct
18 Correct 167 ms 149544 KB Output is correct
19 Correct 170 ms 149792 KB Output is correct
20 Correct 173 ms 149876 KB Output is correct
21 Correct 189 ms 150120 KB Output is correct
22 Correct 165 ms 148940 KB Output is correct
23 Correct 166 ms 148396 KB Output is correct
24 Correct 182 ms 149440 KB Output is correct
25 Correct 2654 ms 205144 KB Output is correct
26 Correct 2618 ms 210400 KB Output is correct
27 Correct 2599 ms 205660 KB Output is correct
28 Correct 2272 ms 209868 KB Output is correct
29 Correct 2465 ms 196372 KB Output is correct
30 Correct 2550 ms 200588 KB Output is correct
31 Correct 2750 ms 208124 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 140428 KB Output is correct
2 Correct 177 ms 151200 KB Output is correct
3 Correct 171 ms 149788 KB Output is correct
4 Correct 177 ms 149584 KB Output is correct
5 Correct 75 ms 139092 KB Output is correct
6 Correct 185 ms 149624 KB Output is correct
7 Correct 164 ms 149832 KB Output is correct
8 Correct 189 ms 150020 KB Output is correct
9 Correct 173 ms 150152 KB Output is correct
10 Correct 186 ms 148940 KB Output is correct
11 Correct 161 ms 148428 KB Output is correct
12 Correct 187 ms 149480 KB Output is correct
13 Correct 111 ms 140516 KB Output is correct
14 Correct 180 ms 151232 KB Output is correct
15 Correct 175 ms 149904 KB Output is correct
16 Correct 175 ms 149588 KB Output is correct
17 Correct 79 ms 139084 KB Output is correct
18 Correct 167 ms 149544 KB Output is correct
19 Correct 170 ms 149792 KB Output is correct
20 Correct 173 ms 149876 KB Output is correct
21 Correct 189 ms 150120 KB Output is correct
22 Correct 165 ms 148940 KB Output is correct
23 Correct 166 ms 148396 KB Output is correct
24 Correct 182 ms 149440 KB Output is correct
25 Correct 2654 ms 205144 KB Output is correct
26 Correct 2618 ms 210400 KB Output is correct
27 Correct 2599 ms 205660 KB Output is correct
28 Correct 2272 ms 209868 KB Output is correct
29 Correct 2465 ms 196372 KB Output is correct
30 Correct 2550 ms 200588 KB Output is correct
31 Correct 2750 ms 208124 KB Output is correct
32 Correct 111 ms 140480 KB Output is correct
33 Correct 187 ms 151272 KB Output is correct
34 Correct 185 ms 149840 KB Output is correct
35 Correct 179 ms 149584 KB Output is correct
36 Correct 81 ms 139088 KB Output is correct
37 Correct 174 ms 149652 KB Output is correct
38 Correct 182 ms 149852 KB Output is correct
39 Correct 181 ms 149932 KB Output is correct
40 Correct 176 ms 150132 KB Output is correct
41 Correct 178 ms 148968 KB Output is correct
42 Correct 170 ms 148420 KB Output is correct
43 Correct 202 ms 149452 KB Output is correct
44 Correct 2658 ms 201152 KB Output is correct
45 Correct 2640 ms 207424 KB Output is correct
46 Correct 2448 ms 200668 KB Output is correct
47 Correct 2269 ms 208260 KB Output is correct
48 Correct 2430 ms 191868 KB Output is correct
49 Correct 2429 ms 198744 KB Output is correct
50 Correct 2784 ms 206088 KB Output is correct
51 Correct 2844 ms 237792 KB Output is correct
52 Correct 2992 ms 275560 KB Output is correct
53 Correct 2684 ms 244824 KB Output is correct
54 Correct 2104 ms 199632 KB Output is correct
55 Correct 2731 ms 236216 KB Output is correct
56 Correct 2669 ms 217796 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 140544 KB Output is correct
2 Correct 175 ms 151260 KB Output is correct
3 Correct 172 ms 149844 KB Output is correct
4 Correct 185 ms 149500 KB Output is correct
5 Correct 79 ms 139036 KB Output is correct
6 Correct 164 ms 149580 KB Output is correct
7 Correct 109 ms 140428 KB Output is correct
8 Correct 177 ms 151200 KB Output is correct
9 Correct 171 ms 149788 KB Output is correct
10 Correct 177 ms 149584 KB Output is correct
11 Correct 75 ms 139092 KB Output is correct
12 Correct 185 ms 149624 KB Output is correct
13 Correct 164 ms 149832 KB Output is correct
14 Correct 189 ms 150020 KB Output is correct
15 Correct 173 ms 150152 KB Output is correct
16 Correct 186 ms 148940 KB Output is correct
17 Correct 161 ms 148428 KB Output is correct
18 Correct 187 ms 149480 KB Output is correct
19 Correct 84 ms 138884 KB Output is correct
20 Correct 86 ms 138844 KB Output is correct
21 Correct 89 ms 138868 KB Output is correct
22 Correct 120 ms 140456 KB Output is correct
23 Correct 192 ms 151244 KB Output is correct
24 Correct 184 ms 149852 KB Output is correct
25 Correct 187 ms 149544 KB Output is correct
26 Correct 88 ms 139212 KB Output is correct
27 Correct 180 ms 149580 KB Output is correct
28 Correct 185 ms 149852 KB Output is correct
29 Correct 186 ms 149964 KB Output is correct
30 Correct 201 ms 150228 KB Output is correct
31 Correct 176 ms 148936 KB Output is correct
32 Correct 175 ms 148440 KB Output is correct
33 Correct 179 ms 149456 KB Output is correct
34 Correct 2671 ms 195156 KB Output is correct
35 Correct 2773 ms 194400 KB Output is correct
36 Correct 2747 ms 192544 KB Output is correct
37 Incorrect 2507 ms 195372 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 140544 KB Output is correct
2 Correct 175 ms 151260 KB Output is correct
3 Correct 172 ms 149844 KB Output is correct
4 Correct 185 ms 149500 KB Output is correct
5 Correct 79 ms 139036 KB Output is correct
6 Correct 164 ms 149580 KB Output is correct
7 Correct 109 ms 140428 KB Output is correct
8 Correct 177 ms 151200 KB Output is correct
9 Correct 171 ms 149788 KB Output is correct
10 Correct 177 ms 149584 KB Output is correct
11 Correct 75 ms 139092 KB Output is correct
12 Correct 185 ms 149624 KB Output is correct
13 Correct 164 ms 149832 KB Output is correct
14 Correct 189 ms 150020 KB Output is correct
15 Correct 173 ms 150152 KB Output is correct
16 Correct 186 ms 148940 KB Output is correct
17 Correct 161 ms 148428 KB Output is correct
18 Correct 187 ms 149480 KB Output is correct
19 Correct 111 ms 140516 KB Output is correct
20 Correct 180 ms 151232 KB Output is correct
21 Correct 175 ms 149904 KB Output is correct
22 Correct 175 ms 149588 KB Output is correct
23 Correct 79 ms 139084 KB Output is correct
24 Correct 167 ms 149544 KB Output is correct
25 Correct 170 ms 149792 KB Output is correct
26 Correct 173 ms 149876 KB Output is correct
27 Correct 189 ms 150120 KB Output is correct
28 Correct 165 ms 148940 KB Output is correct
29 Correct 166 ms 148396 KB Output is correct
30 Correct 182 ms 149440 KB Output is correct
31 Correct 2654 ms 205144 KB Output is correct
32 Correct 2618 ms 210400 KB Output is correct
33 Correct 2599 ms 205660 KB Output is correct
34 Correct 2272 ms 209868 KB Output is correct
35 Correct 2465 ms 196372 KB Output is correct
36 Correct 2550 ms 200588 KB Output is correct
37 Correct 2750 ms 208124 KB Output is correct
38 Correct 84 ms 138884 KB Output is correct
39 Correct 86 ms 138844 KB Output is correct
40 Correct 89 ms 138868 KB Output is correct
41 Correct 120 ms 140456 KB Output is correct
42 Correct 192 ms 151244 KB Output is correct
43 Correct 184 ms 149852 KB Output is correct
44 Correct 187 ms 149544 KB Output is correct
45 Correct 88 ms 139212 KB Output is correct
46 Correct 180 ms 149580 KB Output is correct
47 Correct 185 ms 149852 KB Output is correct
48 Correct 186 ms 149964 KB Output is correct
49 Correct 201 ms 150228 KB Output is correct
50 Correct 176 ms 148936 KB Output is correct
51 Correct 175 ms 148440 KB Output is correct
52 Correct 179 ms 149456 KB Output is correct
53 Correct 2671 ms 195156 KB Output is correct
54 Correct 2773 ms 194400 KB Output is correct
55 Correct 2747 ms 192544 KB Output is correct
56 Incorrect 2507 ms 195372 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 140544 KB Output is correct
2 Correct 175 ms 151260 KB Output is correct
3 Correct 172 ms 149844 KB Output is correct
4 Correct 185 ms 149500 KB Output is correct
5 Correct 79 ms 139036 KB Output is correct
6 Correct 164 ms 149580 KB Output is correct
7 Correct 109 ms 140428 KB Output is correct
8 Correct 177 ms 151200 KB Output is correct
9 Correct 171 ms 149788 KB Output is correct
10 Correct 177 ms 149584 KB Output is correct
11 Correct 75 ms 139092 KB Output is correct
12 Correct 185 ms 149624 KB Output is correct
13 Correct 164 ms 149832 KB Output is correct
14 Correct 189 ms 150020 KB Output is correct
15 Correct 173 ms 150152 KB Output is correct
16 Correct 186 ms 148940 KB Output is correct
17 Correct 161 ms 148428 KB Output is correct
18 Correct 187 ms 149480 KB Output is correct
19 Correct 111 ms 140516 KB Output is correct
20 Correct 180 ms 151232 KB Output is correct
21 Correct 175 ms 149904 KB Output is correct
22 Correct 175 ms 149588 KB Output is correct
23 Correct 79 ms 139084 KB Output is correct
24 Correct 167 ms 149544 KB Output is correct
25 Correct 170 ms 149792 KB Output is correct
26 Correct 173 ms 149876 KB Output is correct
27 Correct 189 ms 150120 KB Output is correct
28 Correct 165 ms 148940 KB Output is correct
29 Correct 166 ms 148396 KB Output is correct
30 Correct 182 ms 149440 KB Output is correct
31 Correct 2654 ms 205144 KB Output is correct
32 Correct 2618 ms 210400 KB Output is correct
33 Correct 2599 ms 205660 KB Output is correct
34 Correct 2272 ms 209868 KB Output is correct
35 Correct 2465 ms 196372 KB Output is correct
36 Correct 2550 ms 200588 KB Output is correct
37 Correct 2750 ms 208124 KB Output is correct
38 Correct 111 ms 140480 KB Output is correct
39 Correct 187 ms 151272 KB Output is correct
40 Correct 185 ms 149840 KB Output is correct
41 Correct 179 ms 149584 KB Output is correct
42 Correct 81 ms 139088 KB Output is correct
43 Correct 174 ms 149652 KB Output is correct
44 Correct 182 ms 149852 KB Output is correct
45 Correct 181 ms 149932 KB Output is correct
46 Correct 176 ms 150132 KB Output is correct
47 Correct 178 ms 148968 KB Output is correct
48 Correct 170 ms 148420 KB Output is correct
49 Correct 202 ms 149452 KB Output is correct
50 Correct 2658 ms 201152 KB Output is correct
51 Correct 2640 ms 207424 KB Output is correct
52 Correct 2448 ms 200668 KB Output is correct
53 Correct 2269 ms 208260 KB Output is correct
54 Correct 2430 ms 191868 KB Output is correct
55 Correct 2429 ms 198744 KB Output is correct
56 Correct 2784 ms 206088 KB Output is correct
57 Correct 2844 ms 237792 KB Output is correct
58 Correct 2992 ms 275560 KB Output is correct
59 Correct 2684 ms 244824 KB Output is correct
60 Correct 2104 ms 199632 KB Output is correct
61 Correct 2731 ms 236216 KB Output is correct
62 Correct 2669 ms 217796 KB Output is correct
63 Correct 84 ms 138884 KB Output is correct
64 Correct 86 ms 138844 KB Output is correct
65 Correct 89 ms 138868 KB Output is correct
66 Correct 120 ms 140456 KB Output is correct
67 Correct 192 ms 151244 KB Output is correct
68 Correct 184 ms 149852 KB Output is correct
69 Correct 187 ms 149544 KB Output is correct
70 Correct 88 ms 139212 KB Output is correct
71 Correct 180 ms 149580 KB Output is correct
72 Correct 185 ms 149852 KB Output is correct
73 Correct 186 ms 149964 KB Output is correct
74 Correct 201 ms 150228 KB Output is correct
75 Correct 176 ms 148936 KB Output is correct
76 Correct 175 ms 148440 KB Output is correct
77 Correct 179 ms 149456 KB Output is correct
78 Correct 2671 ms 195156 KB Output is correct
79 Correct 2773 ms 194400 KB Output is correct
80 Correct 2747 ms 192544 KB Output is correct
81 Incorrect 2507 ms 195372 KB Output isn't correct
82 Halted 0 ms 0 KB -