oj.uz

Submission #540489

# Submission time Handle Problem Language Result Execution time Memory
540489 2022-03-20T13:44:28 Z elazarkoren From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 1456 ms 120752 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;

const int MAX_N = 1e5 + 5;
const int MAX_L = 1e5;
const int infinity = 1e9;

int Gcd(int a, int b) {
    return (b ? Gcd(b, a % b) : a);
}

inline int Lcm(int a, int b) {
    return a * b / Gcd(a, b);
}

set<int> bad_node[MAX_L];
set<pii> bad_edge[MAX_L];
//queue<pii> q;//[MAX_L];
//bitset<MAX_N> visited[MAX_L];
//int dist[MAX_N][MAX_L];
int cycle[MAX_N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vvi graph(n + 1);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    for (int i = 1; i <= n; i++) cycle[i] = 1;
    int k;
    cin >> k;
    vi len(k);
    vvi path(k);
    for (int j = 0; j < k; j++) {
        cin >> len[j];
        path[j].resize(len[j] + 1);
        for (int i = 0; i < len[j]; i++) {
            cin >> path[j][i];
            cycle[path[j][i]] = len[j];
        }
        path[j][len[j]] = path[j][0];
        for (int i = 1; i <= len[j]; i++) {
            bad_node[i % len[j]].insert(path[j][i]);
            bad_edge[i % len[j]].insert({min(path[j][i], path[j][i - 1]), max(path[j][i], path[j][i - 1])});
        }
    }
    bitset<MAX_N> vis;
    vvb visited(n + 1);
    for (int i = 1; i <= n; i++) {
        if (cycle[i] == 1) {
            vis[i] = true;
            for (int neighbor : graph[i]) {
                if (!vis[neighbor]) cycle[i] = Lcm(cycle[i], cycle[neighbor]);
            }
        }
        visited[i].resize(cycle[i]);
//        for (int j = 0; j < cycle[i]; j++) dist[i][j] = infinity;
    }
//    priority_queue<pii, vii, greater<pii>> pq;
    queue<pii> pq;
    pq.push({1, 0});
    while (!pq.empty()) {
        auto [node, d] = pq.front();
        pq.pop();
//        if (visited[node][d % cycle[node]]) continue;
//        visited[node][d % cycle[node]] = true;
        if (node == n) {
            cout << d << '\n';
            return 0;
        }
        if (!bad_node[(d + 1) % cycle[node]].count(node)) {
            if (!visited[node][(d + 1) % cycle[node]]) {
                pq.push({node, d + 1});
                visited[node][(d + 1) % cycle[node]] = true;
            }
//            if (d + 1 < dist[node][(d + 1) % cycle[node]]) {
//                dist[node][(d + 1) % cycle[node]] = d + 1;
//                pq.push({node, d + 1});
//            }
        }
        for (int neighbor : graph[node]) {
            if (!bad_node[(d + 1) % cycle[neighbor]].count(neighbor)) {
                if (!bad_edge[(d + 1) % cycle[neighbor]].count({min(node, neighbor), max(node, neighbor)})) {
                    if (!visited[neighbor][(d + 1) % cycle[neighbor]]) {
                        pq.push({neighbor, d + 1});
                        visited[neighbor][(d + 1) % cycle[neighbor]] = true;
                    }
//                    if (d + 1 < dist[neighbor][(d + 1) % cycle[neighbor]]) {
//                        dist[node][(d + 1) % cycle[neighbor]] = d + 1;
//                        pq.push({neighbor, d + 1});
//                    }
                }
            }
        }
    }
    cout << "impossible\n";
    return 0;
}
//6 6
//1 2
//2 3
//3 4
//4 5
//5 6
//2 4
//1
//3 2 3 4

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10580 KB Output is correct
2 Correct 105 ms 22708 KB Output is correct
3 Correct 112 ms 21416 KB Output is correct
4 Correct 219 ms 21568 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 93 ms 21380 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 10572 KB Output is correct
2 Correct 120 ms 22624 KB Output is correct
3 Correct 107 ms 21324 KB Output is correct
4 Correct 228 ms 21564 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 104 ms 21432 KB Output is correct
7 Correct 113 ms 21420 KB Output is correct
8 Correct 103 ms 21412 KB Output is correct
9 Correct 120 ms 21396 KB Output is correct
10 Correct 542 ms 21748 KB Output is correct
11 Correct 1187 ms 22812 KB Output is correct
12 Correct 103 ms 21332 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 10572 KB Output is correct
2 Correct 120 ms 22624 KB Output is correct
3 Correct 107 ms 21324 KB Output is correct
4 Correct 228 ms 21564 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 104 ms 21432 KB Output is correct
7 Correct 113 ms 21420 KB Output is correct
8 Correct 103 ms 21412 KB Output is correct
9 Correct 120 ms 21396 KB Output is correct
10 Correct 542 ms 21748 KB Output is correct
11 Correct 1187 ms 22812 KB Output is correct
12 Correct 103 ms 21332 KB Output is correct
13 Correct 19 ms 10676 KB Output is correct
14 Correct 100 ms 22648 KB Output is correct
15 Correct 101 ms 21320 KB Output is correct
16 Correct 186 ms 21560 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 96 ms 21424 KB Output is correct
19 Correct 101 ms 21404 KB Output is correct
20 Correct 97 ms 21376 KB Output is correct
21 Correct 97 ms 21444 KB Output is correct
22 Correct 485 ms 21736 KB Output is correct
23 Correct 1153 ms 22820 KB Output is correct
24 Correct 113 ms 21396 KB Output is correct
25 Runtime error 1428 ms 119368 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 10572 KB Output is correct
2 Correct 120 ms 22624 KB Output is correct
3 Correct 107 ms 21324 KB Output is correct
4 Correct 228 ms 21564 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 104 ms 21432 KB Output is correct
7 Correct 113 ms 21420 KB Output is correct
8 Correct 103 ms 21412 KB Output is correct
9 Correct 120 ms 21396 KB Output is correct
10 Correct 542 ms 21748 KB Output is correct
11 Correct 1187 ms 22812 KB Output is correct
12 Correct 103 ms 21332 KB Output is correct
13 Correct 19 ms 10676 KB Output is correct
14 Correct 100 ms 22648 KB Output is correct
15 Correct 101 ms 21320 KB Output is correct
16 Correct 186 ms 21560 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 96 ms 21424 KB Output is correct
19 Correct 101 ms 21404 KB Output is correct
20 Correct 97 ms 21376 KB Output is correct
21 Correct 97 ms 21444 KB Output is correct
22 Correct 485 ms 21736 KB Output is correct
23 Correct 1153 ms 22820 KB Output is correct
24 Correct 113 ms 21396 KB Output is correct
25 Runtime error 1428 ms 119368 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10580 KB Output is correct
2 Correct 105 ms 22708 KB Output is correct
3 Correct 112 ms 21416 KB Output is correct
4 Correct 219 ms 21568 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 93 ms 21380 KB Output is correct
7 Correct 20 ms 10572 KB Output is correct
8 Correct 120 ms 22624 KB Output is correct
9 Correct 107 ms 21324 KB Output is correct
10 Correct 228 ms 21564 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 104 ms 21432 KB Output is correct
13 Correct 113 ms 21420 KB Output is correct
14 Correct 103 ms 21412 KB Output is correct
15 Correct 120 ms 21396 KB Output is correct
16 Correct 542 ms 21748 KB Output is correct
17 Correct 1187 ms 22812 KB Output is correct
18 Correct 103 ms 21332 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 20 ms 10660 KB Output is correct
23 Correct 92 ms 22644 KB Output is correct
24 Correct 123 ms 21432 KB Output is correct
25 Correct 173 ms 21652 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 93 ms 21400 KB Output is correct
28 Correct 106 ms 21400 KB Output is correct
29 Correct 96 ms 21440 KB Output is correct
30 Correct 113 ms 21436 KB Output is correct
31 Correct 471 ms 21732 KB Output is correct
32 Correct 1157 ms 22820 KB Output is correct
33 Correct 89 ms 21412 KB Output is correct
34 Runtime error 1456 ms 120752 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10580 KB Output is correct
2 Correct 105 ms 22708 KB Output is correct
3 Correct 112 ms 21416 KB Output is correct
4 Correct 219 ms 21568 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 93 ms 21380 KB Output is correct
7 Correct 20 ms 10572 KB Output is correct
8 Correct 120 ms 22624 KB Output is correct
9 Correct 107 ms 21324 KB Output is correct
10 Correct 228 ms 21564 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 104 ms 21432 KB Output is correct
13 Correct 113 ms 21420 KB Output is correct
14 Correct 103 ms 21412 KB Output is correct
15 Correct 120 ms 21396 KB Output is correct
16 Correct 542 ms 21748 KB Output is correct
17 Correct 1187 ms 22812 KB Output is correct
18 Correct 103 ms 21332 KB Output is correct
19 Correct 19 ms 10676 KB Output is correct
20 Correct 100 ms 22648 KB Output is correct
21 Correct 101 ms 21320 KB Output is correct
22 Correct 186 ms 21560 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 96 ms 21424 KB Output is correct
25 Correct 101 ms 21404 KB Output is correct
26 Correct 97 ms 21376 KB Output is correct
27 Correct 97 ms 21444 KB Output is correct
28 Correct 485 ms 21736 KB Output is correct
29 Correct 1153 ms 22820 KB Output is correct
30 Correct 113 ms 21396 KB Output is correct
31 Runtime error 1428 ms 119368 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10580 KB Output is correct
2 Correct 105 ms 22708 KB Output is correct
3 Correct 112 ms 21416 KB Output is correct
4 Correct 219 ms 21568 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 93 ms 21380 KB Output is correct
7 Correct 20 ms 10572 KB Output is correct
8 Correct 120 ms 22624 KB Output is correct
9 Correct 107 ms 21324 KB Output is correct
10 Correct 228 ms 21564 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 104 ms 21432 KB Output is correct
13 Correct 113 ms 21420 KB Output is correct
14 Correct 103 ms 21412 KB Output is correct
15 Correct 120 ms 21396 KB Output is correct
16 Correct 542 ms 21748 KB Output is correct
17 Correct 1187 ms 22812 KB Output is correct
18 Correct 103 ms 21332 KB Output is correct
19 Correct 19 ms 10676 KB Output is correct
20 Correct 100 ms 22648 KB Output is correct
21 Correct 101 ms 21320 KB Output is correct
22 Correct 186 ms 21560 KB Output is correct
23 Correct 7 ms 9684 KB Output is correct
24 Correct 96 ms 21424 KB Output is correct
25 Correct 101 ms 21404 KB Output is correct
26 Correct 97 ms 21376 KB Output is correct
27 Correct 97 ms 21444 KB Output is correct
28 Correct 485 ms 21736 KB Output is correct
29 Correct 1153 ms 22820 KB Output is correct
30 Correct 113 ms 21396 KB Output is correct
31 Runtime error 1428 ms 119368 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -