oj.uz

답안 #540485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540485 2022-03-20T13:39:46 Z elazarkoren From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 1256 ms 137872 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;

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;
    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]);
            }
        }
//        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[d % cycle[node]][node]) continue;
        visited[d % cycle[node]][node] = true;
        if (node == n) {
            cout << d << '\n';
            return 0;
        }
        if (!bad_node[(d + 1) % cycle[node]].count(node)) {
            if (!visited[(d + 1) % cycle[node]][node]) {
                pq.push({node, d + 1});
            }
//            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[(d + 1) % cycle[neighbor]][neighbor]) {
                        pq.push({neighbor, d + 1});
                    }
//                    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

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11604 KB Output is correct
2 Correct 50 ms 17032 KB Output is correct
3 Correct 61 ms 16636 KB Output is correct
4 Correct 153 ms 17084 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 53 ms 16628 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11500 KB Output is correct
2 Correct 51 ms 17036 KB Output is correct
3 Correct 52 ms 16608 KB Output is correct
4 Correct 147 ms 17068 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 52 ms 16536 KB Output is correct
7 Correct 49 ms 15816 KB Output is correct
8 Correct 50 ms 15560 KB Output is correct
9 Correct 50 ms 15436 KB Output is correct
10 Correct 377 ms 59652 KB Output is correct
11 Correct 1062 ms 137816 KB Output is correct
12 Correct 54 ms 15864 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11500 KB Output is correct
2 Correct 51 ms 17036 KB Output is correct
3 Correct 52 ms 16608 KB Output is correct
4 Correct 147 ms 17068 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 52 ms 16536 KB Output is correct
7 Correct 49 ms 15816 KB Output is correct
8 Correct 50 ms 15560 KB Output is correct
9 Correct 50 ms 15436 KB Output is correct
10 Correct 377 ms 59652 KB Output is correct
11 Correct 1062 ms 137816 KB Output is correct
12 Correct 54 ms 15864 KB Output is correct
13 Correct 19 ms 11504 KB Output is correct
14 Correct 53 ms 17060 KB Output is correct
15 Correct 52 ms 16604 KB Output is correct
16 Correct 158 ms 17148 KB Output is correct
17 Correct 6 ms 10068 KB Output is correct
18 Correct 53 ms 16516 KB Output is correct
19 Correct 50 ms 15788 KB Output is correct
20 Correct 50 ms 15620 KB Output is correct
21 Correct 49 ms 15420 KB Output is correct
22 Correct 369 ms 59720 KB Output is correct
23 Correct 1059 ms 137776 KB Output is correct
24 Correct 48 ms 15856 KB Output is correct
25 Runtime error 1179 ms 60728 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11500 KB Output is correct
2 Correct 51 ms 17036 KB Output is correct
3 Correct 52 ms 16608 KB Output is correct
4 Correct 147 ms 17068 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 52 ms 16536 KB Output is correct
7 Correct 49 ms 15816 KB Output is correct
8 Correct 50 ms 15560 KB Output is correct
9 Correct 50 ms 15436 KB Output is correct
10 Correct 377 ms 59652 KB Output is correct
11 Correct 1062 ms 137816 KB Output is correct
12 Correct 54 ms 15864 KB Output is correct
13 Correct 19 ms 11504 KB Output is correct
14 Correct 53 ms 17060 KB Output is correct
15 Correct 52 ms 16604 KB Output is correct
16 Correct 158 ms 17148 KB Output is correct
17 Correct 6 ms 10068 KB Output is correct
18 Correct 53 ms 16516 KB Output is correct
19 Correct 50 ms 15788 KB Output is correct
20 Correct 50 ms 15620 KB Output is correct
21 Correct 49 ms 15420 KB Output is correct
22 Correct 369 ms 59720 KB Output is correct
23 Correct 1059 ms 137776 KB Output is correct
24 Correct 48 ms 15856 KB Output is correct
25 Runtime error 1179 ms 60728 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11604 KB Output is correct
2 Correct 50 ms 17032 KB Output is correct
3 Correct 61 ms 16636 KB Output is correct
4 Correct 153 ms 17084 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 53 ms 16628 KB Output is correct
7 Correct 19 ms 11500 KB Output is correct
8 Correct 51 ms 17036 KB Output is correct
9 Correct 52 ms 16608 KB Output is correct
10 Correct 147 ms 17068 KB Output is correct
11 Correct 5 ms 10068 KB Output is correct
12 Correct 52 ms 16536 KB Output is correct
13 Correct 49 ms 15816 KB Output is correct
14 Correct 50 ms 15560 KB Output is correct
15 Correct 50 ms 15436 KB Output is correct
16 Correct 377 ms 59652 KB Output is correct
17 Correct 1062 ms 137816 KB Output is correct
18 Correct 54 ms 15864 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9648 KB Output is correct
22 Correct 19 ms 11500 KB Output is correct
23 Correct 60 ms 17124 KB Output is correct
24 Correct 69 ms 16584 KB Output is correct
25 Correct 156 ms 17140 KB Output is correct
26 Correct 6 ms 10068 KB Output is correct
27 Correct 51 ms 16556 KB Output is correct
28 Correct 51 ms 15796 KB Output is correct
29 Correct 51 ms 15692 KB Output is correct
30 Correct 54 ms 15408 KB Output is correct
31 Correct 366 ms 59596 KB Output is correct
32 Correct 1068 ms 137872 KB Output is correct
33 Correct 47 ms 15828 KB Output is correct
34 Runtime error 1256 ms 61340 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11604 KB Output is correct
2 Correct 50 ms 17032 KB Output is correct
3 Correct 61 ms 16636 KB Output is correct
4 Correct 153 ms 17084 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 53 ms 16628 KB Output is correct
7 Correct 19 ms 11500 KB Output is correct
8 Correct 51 ms 17036 KB Output is correct
9 Correct 52 ms 16608 KB Output is correct
10 Correct 147 ms 17068 KB Output is correct
11 Correct 5 ms 10068 KB Output is correct
12 Correct 52 ms 16536 KB Output is correct
13 Correct 49 ms 15816 KB Output is correct
14 Correct 50 ms 15560 KB Output is correct
15 Correct 50 ms 15436 KB Output is correct
16 Correct 377 ms 59652 KB Output is correct
17 Correct 1062 ms 137816 KB Output is correct
18 Correct 54 ms 15864 KB Output is correct
19 Correct 19 ms 11504 KB Output is correct
20 Correct 53 ms 17060 KB Output is correct
21 Correct 52 ms 16604 KB Output is correct
22 Correct 158 ms 17148 KB Output is correct
23 Correct 6 ms 10068 KB Output is correct
24 Correct 53 ms 16516 KB Output is correct
25 Correct 50 ms 15788 KB Output is correct
26 Correct 50 ms 15620 KB Output is correct
27 Correct 49 ms 15420 KB Output is correct
28 Correct 369 ms 59720 KB Output is correct
29 Correct 1059 ms 137776 KB Output is correct
30 Correct 48 ms 15856 KB Output is correct
31 Runtime error 1179 ms 60728 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 11604 KB Output is correct
2 Correct 50 ms 17032 KB Output is correct
3 Correct 61 ms 16636 KB Output is correct
4 Correct 153 ms 17084 KB Output is correct
5 Correct 5 ms 10068 KB Output is correct
6 Correct 53 ms 16628 KB Output is correct
7 Correct 19 ms 11500 KB Output is correct
8 Correct 51 ms 17036 KB Output is correct
9 Correct 52 ms 16608 KB Output is correct
10 Correct 147 ms 17068 KB Output is correct
11 Correct 5 ms 10068 KB Output is correct
12 Correct 52 ms 16536 KB Output is correct
13 Correct 49 ms 15816 KB Output is correct
14 Correct 50 ms 15560 KB Output is correct
15 Correct 50 ms 15436 KB Output is correct
16 Correct 377 ms 59652 KB Output is correct
17 Correct 1062 ms 137816 KB Output is correct
18 Correct 54 ms 15864 KB Output is correct
19 Correct 19 ms 11504 KB Output is correct
20 Correct 53 ms 17060 KB Output is correct
21 Correct 52 ms 16604 KB Output is correct
22 Correct 158 ms 17148 KB Output is correct
23 Correct 6 ms 10068 KB Output is correct
24 Correct 53 ms 16516 KB Output is correct
25 Correct 50 ms 15788 KB Output is correct
26 Correct 50 ms 15620 KB Output is correct
27 Correct 49 ms 15420 KB Output is correct
28 Correct 369 ms 59720 KB Output is correct
29 Correct 1059 ms 137776 KB Output is correct
30 Correct 48 ms 15856 KB Output is correct
31 Runtime error 1179 ms 60728 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -