oj.uz

답안 #657493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
657493 2022-11-10T01:52:44 Z Lobo From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 6000 ms 68816 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], 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++) {
        if(isrt[i]) {
            for(int j = 0; j < szrt[idrt[i]]; j++) {
                d[i].pb(inf);
            }
        }
        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]) continue;
                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)));
                }
            }
        }

        if(isrt[u]) {
            for(auto v : g[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)));
                    }
                }
                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(dlol[u] > d[u][t]+1) {
                    dlol[u] = d[u][t]+1;
                    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

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 15308 KB Output is correct
2 Correct 104 ms 21604 KB Output is correct
3 Correct 115 ms 21012 KB Output is correct
4 Correct 154 ms 21068 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 122 ms 20952 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 15356 KB Output is correct
2 Correct 117 ms 21444 KB Output is correct
3 Correct 115 ms 21076 KB Output is correct
4 Correct 141 ms 21260 KB Output is correct
5 Correct 9 ms 14388 KB Output is correct
6 Correct 112 ms 21020 KB Output is correct
7 Correct 108 ms 20944 KB Output is correct
8 Correct 104 ms 21004 KB Output is correct
9 Correct 111 ms 20936 KB Output is correct
10 Correct 136 ms 21200 KB Output is correct
11 Correct 103 ms 20988 KB Output is correct
12 Correct 104 ms 21032 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 15356 KB Output is correct
2 Correct 117 ms 21444 KB Output is correct
3 Correct 115 ms 21076 KB Output is correct
4 Correct 141 ms 21260 KB Output is correct
5 Correct 9 ms 14388 KB Output is correct
6 Correct 112 ms 21020 KB Output is correct
7 Correct 108 ms 20944 KB Output is correct
8 Correct 104 ms 21004 KB Output is correct
9 Correct 111 ms 20936 KB Output is correct
10 Correct 136 ms 21200 KB Output is correct
11 Correct 103 ms 20988 KB Output is correct
12 Correct 104 ms 21032 KB Output is correct
13 Correct 76 ms 15436 KB Output is correct
14 Correct 105 ms 21532 KB Output is correct
15 Correct 114 ms 21008 KB Output is correct
16 Correct 131 ms 21100 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 108 ms 20940 KB Output is correct
19 Correct 101 ms 20940 KB Output is correct
20 Correct 104 ms 20932 KB Output is correct
21 Correct 98 ms 20948 KB Output is correct
22 Correct 111 ms 21200 KB Output is correct
23 Correct 113 ms 21068 KB Output is correct
24 Correct 115 ms 21000 KB Output is correct
25 Correct 2634 ms 63980 KB Output is correct
26 Correct 2586 ms 68816 KB Output is correct
27 Correct 2351 ms 64460 KB Output is correct
28 Correct 2451 ms 68412 KB Output is correct
29 Execution timed out 6031 ms 59480 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 15356 KB Output is correct
2 Correct 117 ms 21444 KB Output is correct
3 Correct 115 ms 21076 KB Output is correct
4 Correct 141 ms 21260 KB Output is correct
5 Correct 9 ms 14388 KB Output is correct
6 Correct 112 ms 21020 KB Output is correct
7 Correct 108 ms 20944 KB Output is correct
8 Correct 104 ms 21004 KB Output is correct
9 Correct 111 ms 20936 KB Output is correct
10 Correct 136 ms 21200 KB Output is correct
11 Correct 103 ms 20988 KB Output is correct
12 Correct 104 ms 21032 KB Output is correct
13 Correct 76 ms 15436 KB Output is correct
14 Correct 105 ms 21532 KB Output is correct
15 Correct 114 ms 21008 KB Output is correct
16 Correct 131 ms 21100 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 108 ms 20940 KB Output is correct
19 Correct 101 ms 20940 KB Output is correct
20 Correct 104 ms 20932 KB Output is correct
21 Correct 98 ms 20948 KB Output is correct
22 Correct 111 ms 21200 KB Output is correct
23 Correct 113 ms 21068 KB Output is correct
24 Correct 115 ms 21000 KB Output is correct
25 Correct 2634 ms 63980 KB Output is correct
26 Correct 2586 ms 68816 KB Output is correct
27 Correct 2351 ms 64460 KB Output is correct
28 Correct 2451 ms 68412 KB Output is correct
29 Execution timed out 6031 ms 59480 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 15308 KB Output is correct
2 Correct 104 ms 21604 KB Output is correct
3 Correct 115 ms 21012 KB Output is correct
4 Correct 154 ms 21068 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 122 ms 20952 KB Output is correct
7 Correct 81 ms 15356 KB Output is correct
8 Correct 117 ms 21444 KB Output is correct
9 Correct 115 ms 21076 KB Output is correct
10 Correct 141 ms 21260 KB Output is correct
11 Correct 9 ms 14388 KB Output is correct
12 Correct 112 ms 21020 KB Output is correct
13 Correct 108 ms 20944 KB Output is correct
14 Correct 104 ms 21004 KB Output is correct
15 Correct 111 ms 20936 KB Output is correct
16 Correct 136 ms 21200 KB Output is correct
17 Correct 103 ms 20988 KB Output is correct
18 Correct 104 ms 21032 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 74 ms 15364 KB Output is correct
23 Correct 125 ms 21460 KB Output is correct
24 Correct 126 ms 21036 KB Output is correct
25 Correct 136 ms 21092 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 108 ms 20940 KB Output is correct
28 Correct 122 ms 20920 KB Output is correct
29 Correct 124 ms 20992 KB Output is correct
30 Correct 101 ms 21024 KB Output is correct
31 Correct 116 ms 21280 KB Output is correct
32 Correct 112 ms 21104 KB Output is correct
33 Correct 143 ms 21060 KB Output is correct
34 Correct 2726 ms 64456 KB Output is correct
35 Correct 2690 ms 60820 KB Output is correct
36 Correct 2769 ms 60824 KB Output is correct
37 Incorrect 2472 ms 65868 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 15308 KB Output is correct
2 Correct 104 ms 21604 KB Output is correct
3 Correct 115 ms 21012 KB Output is correct
4 Correct 154 ms 21068 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 122 ms 20952 KB Output is correct
7 Correct 81 ms 15356 KB Output is correct
8 Correct 117 ms 21444 KB Output is correct
9 Correct 115 ms 21076 KB Output is correct
10 Correct 141 ms 21260 KB Output is correct
11 Correct 9 ms 14388 KB Output is correct
12 Correct 112 ms 21020 KB Output is correct
13 Correct 108 ms 20944 KB Output is correct
14 Correct 104 ms 21004 KB Output is correct
15 Correct 111 ms 20936 KB Output is correct
16 Correct 136 ms 21200 KB Output is correct
17 Correct 103 ms 20988 KB Output is correct
18 Correct 104 ms 21032 KB Output is correct
19 Correct 76 ms 15436 KB Output is correct
20 Correct 105 ms 21532 KB Output is correct
21 Correct 114 ms 21008 KB Output is correct
22 Correct 131 ms 21100 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 108 ms 20940 KB Output is correct
25 Correct 101 ms 20940 KB Output is correct
26 Correct 104 ms 20932 KB Output is correct
27 Correct 98 ms 20948 KB Output is correct
28 Correct 111 ms 21200 KB Output is correct
29 Correct 113 ms 21068 KB Output is correct
30 Correct 115 ms 21000 KB Output is correct
31 Correct 2634 ms 63980 KB Output is correct
32 Correct 2586 ms 68816 KB Output is correct
33 Correct 2351 ms 64460 KB Output is correct
34 Correct 2451 ms 68412 KB Output is correct
35 Execution timed out 6031 ms 59480 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 15308 KB Output is correct
2 Correct 104 ms 21604 KB Output is correct
3 Correct 115 ms 21012 KB Output is correct
4 Correct 154 ms 21068 KB Output is correct
5 Correct 9 ms 14420 KB Output is correct
6 Correct 122 ms 20952 KB Output is correct
7 Correct 81 ms 15356 KB Output is correct
8 Correct 117 ms 21444 KB Output is correct
9 Correct 115 ms 21076 KB Output is correct
10 Correct 141 ms 21260 KB Output is correct
11 Correct 9 ms 14388 KB Output is correct
12 Correct 112 ms 21020 KB Output is correct
13 Correct 108 ms 20944 KB Output is correct
14 Correct 104 ms 21004 KB Output is correct
15 Correct 111 ms 20936 KB Output is correct
16 Correct 136 ms 21200 KB Output is correct
17 Correct 103 ms 20988 KB Output is correct
18 Correct 104 ms 21032 KB Output is correct
19 Correct 76 ms 15436 KB Output is correct
20 Correct 105 ms 21532 KB Output is correct
21 Correct 114 ms 21008 KB Output is correct
22 Correct 131 ms 21100 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 108 ms 20940 KB Output is correct
25 Correct 101 ms 20940 KB Output is correct
26 Correct 104 ms 20932 KB Output is correct
27 Correct 98 ms 20948 KB Output is correct
28 Correct 111 ms 21200 KB Output is correct
29 Correct 113 ms 21068 KB Output is correct
30 Correct 115 ms 21000 KB Output is correct
31 Correct 2634 ms 63980 KB Output is correct
32 Correct 2586 ms 68816 KB Output is correct
33 Correct 2351 ms 64460 KB Output is correct
34 Correct 2451 ms 68412 KB Output is correct
35 Execution timed out 6031 ms 59480 KB Time limit exceeded
36 Halted 0 ms 0 KB -