oj.uz

Submission #655837

# Submission time Handle Problem Language Result Execution time Memory
655837 2022-11-05T18:33:57 Z 600Mihnea From Hacks to Snitches (BOI21_watchmen) C++17
50 / 100
 6000 ms 222588 KB 
// pana la ora 1
bool home = 0;
bool verbose = 1;

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>


using namespace std;

struct T {
  int v;
  int r;
};

const int N = 250000 + 7;
const int V = (int)1e7 + 7;
const int INF = (int)1e9 + 7;
int n;
int m;
int cnt_cycles;
int suml;
vector<pair<int, int>> edges;
vector<int> cycles[N];
int cycle_id[N];
int cycle_location[N];
int single_vertex_id[N];
vector<int> cycle_vertex_id[N];
vector<int> splash_vertex_id[N];
int dp[V];
T what[V];
int y;
vector<int> g[N];
int maxd;
const int D = 3000;
queue<int> q[D];

priority_queue<pair<int, int>> pq;

void relax(int id, int d) {
  if (d < dp[id]) {
    dp[id] = d;
    q[d % D].push(id);
    maxd = max(maxd, d);
  }
}
int main() {
  if (!home) {
    verbose = 0;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  if (home) {
    verbose = 1;
    // FILE* stream;
     //freopen_s(&stream, "input.txt", "r", stdin);
  }

  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
    edges.push_back({ a, b });
  }

  cin >> cnt_cycles;

  for (int i = 1; i <= cnt_cycles; i++) {
    int l;
    cin >> l;
    suml += l;
    cycles[i].resize(l);
    for (int j = 0; j < (int)cycles[i].size(); j++) {
      cin >> cycles[i][j];
      cycle_id[cycles[i][j]] = i;
      cycle_location[cycles[i][j]] = j;
    }
    if (verbose) {
      cout << " ---> ";
      for (auto& v : cycles[i]) {
        cout << v << " ";
      }
      cout << "\n";
    }
  }
  for (int a = 1; a <= n; a++) {
    if (cycle_id[a] == 0) {
      y++;
      single_vertex_id[a] = y;
      what[y] = { a, 0 };
    }
    else {
      int id = cycle_id[a];
      cycle_vertex_id[a].resize((int)cycles[id].size());
      splash_vertex_id[a].resize((int)cycles[id].size());
      for (int j = 0; j < (int)cycles[id].size(); j++) {
        y++;
        cycle_vertex_id[a][j] = y;
        what[y] = { a, j };
      }
      for (int j = 0; j < (int)cycles[id].size(); j++) {
        y++;
        splash_vertex_id[a][j] = y;
        what[y] = { a, -(j + 1) };
      }
    }
  }
  for (int i = 1; i <= y; i++) {
    dp[i] = INF;
  }
  if (verbose) {
    cout << "################################################################################### \n";
  }

  relax(single_vertex_id[1], 0);

  for (int cd = 0; cd <= maxd; cd++) {
    while (!q[cd % D].empty()) {
      int idv = q[cd % D].front(), d = cd;
      q[cd % D].pop();
      if (dp[idv] != d) {
        continue;
      }
      if (dp[idv] != d) {
        continue;
      }
      int vertex = what[idv].v;
      int r = what[idv].r;
      if (r < 0) {
        r *= -1;
        r--;

        int cycle = cycle_id[vertex];
        int l = cycles[cycle].size();
        relax(splash_vertex_id[vertex][(d + 1) % l], d + 1);
        if (d % l != cycle_location[vertex]) {
          relax(cycle_vertex_id[vertex][d % l], d);
        }
        continue;
      }
      if (cycle_id[vertex] == 0) {
        for (auto& vecin : g[vertex]) {
          if (cycle_id[vecin] == 0) {
            // vecin is a single vertex
            relax(single_vertex_id[vecin], d + 1);
          }
          else {
            // vecin is on a cycle
            int cycle_vecin = cycle_id[vecin];
            int l_vecin = cycles[cycle_vecin].size();
            relax(splash_vertex_id[vecin][(d + 1) % l_vecin], d + 1);
            continue;
            for (int twait = 0; twait < l_vecin; twait++) {
              // la momentul d + 1 + twait
              if ((d + 1 + twait) % l_vecin == cycle_location[vecin]) {
                continue;
              }
              relax(cycle_vertex_id[vecin][(d + 1 + twait) % l_vecin], d + 1 + twait);
            }
          }
        }
        continue;
      }
      if (cycle_id[vertex] != 0) {
        int cycle = cycle_id[vertex];
        int l = cycles[cycle].size();

        /*
          wait a moment here
        */

        if ((d + 1) % l != cycle_location[vertex]) {
          relax(cycle_vertex_id[vertex][(d + 1) % l], d + 1);
        }

        /*
          don't wait a moment here
        */

        for (auto& vecin : g[vertex]) {
          if (cycle_id[vecin] == 0) {
            // vecin is a single vertex
            relax(single_vertex_id[vecin], d + 1);
          }
          else {
            // vecin is on a cycle
            int cycle_vecin = cycle_id[vecin];
            int l_vecin = cycles[cycle_vecin].size();
            if (cycle_vecin == cycle) {
              // vecin is on the same cycle
              if ((d + 1) % l_vecin == cycle_location[vecin]) {
                continue;
              }
              if (d % l_vecin == cycle_location[vecin] && (d + 1) % l_vecin == cycle_location[vertex]) {
                continue;
              }

              relax(cycle_vertex_id[vecin][(d + 1) % l_vecin], d + 1);
              /*

              vertex -> vecin <- vecin2

              */
            }
            else {
              // vecin is on a different cycle
              for (int j = 0; j <= l_vecin; j++) {
                int twait = j * l;
                // la momentul d + 1 + twait
                if ((d + 1 + twait) % l_vecin == cycle_location[vecin]) {
                  continue;
                }
                relax(cycle_vertex_id[vecin][(d + 1 + twait) % l_vecin], d + 1 + twait);
              }
            }
          }
        }
        continue;
      }
    }
  }

  int sol = dp[single_vertex_id[n]];
  if (sol == INF) {
    cout << "impossible\n";
    return 0;
  }
  cout << sol << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 27840 KB Output is correct
2 Correct 64 ms 32316 KB Output is correct
3 Correct 66 ms 31936 KB Output is correct
4 Correct 95 ms 32060 KB Output is correct
5 Correct 14 ms 26316 KB Output is correct
6 Correct 72 ms 31852 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 27816 KB Output is correct
2 Correct 63 ms 32328 KB Output is correct
3 Correct 62 ms 31892 KB Output is correct
4 Correct 94 ms 32060 KB Output is correct
5 Correct 14 ms 26340 KB Output is correct
6 Correct 71 ms 31848 KB Output is correct
7 Correct 66 ms 31636 KB Output is correct
8 Correct 57 ms 31536 KB Output is correct
9 Correct 69 ms 31564 KB Output is correct
10 Correct 87 ms 31676 KB Output is correct
11 Correct 68 ms 31548 KB Output is correct
12 Correct 61 ms 31648 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 27816 KB Output is correct
2 Correct 63 ms 32328 KB Output is correct
3 Correct 62 ms 31892 KB Output is correct
4 Correct 94 ms 32060 KB Output is correct
5 Correct 14 ms 26340 KB Output is correct
6 Correct 71 ms 31848 KB Output is correct
7 Correct 66 ms 31636 KB Output is correct
8 Correct 57 ms 31536 KB Output is correct
9 Correct 69 ms 31564 KB Output is correct
10 Correct 87 ms 31676 KB Output is correct
11 Correct 68 ms 31548 KB Output is correct
12 Correct 61 ms 31648 KB Output is correct
13 Correct 64 ms 27848 KB Output is correct
14 Correct 68 ms 32332 KB Output is correct
15 Correct 67 ms 31916 KB Output is correct
16 Correct 93 ms 32084 KB Output is correct
17 Correct 15 ms 26284 KB Output is correct
18 Correct 64 ms 31848 KB Output is correct
19 Correct 63 ms 31572 KB Output is correct
20 Correct 56 ms 31556 KB Output is correct
21 Correct 59 ms 31488 KB Output is correct
22 Correct 69 ms 31672 KB Output is correct
23 Correct 56 ms 31576 KB Output is correct
24 Correct 77 ms 31644 KB Output is correct
25 Correct 1366 ms 98908 KB Output is correct
26 Correct 1326 ms 105184 KB Output is correct
27 Correct 1241 ms 98352 KB Output is correct
28 Correct 1058 ms 102804 KB Output is correct
29 Correct 3764 ms 91716 KB Output is correct
30 Correct 4559 ms 95940 KB Output is correct
31 Correct 1468 ms 105652 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 27816 KB Output is correct
2 Correct 63 ms 32328 KB Output is correct
3 Correct 62 ms 31892 KB Output is correct
4 Correct 94 ms 32060 KB Output is correct
5 Correct 14 ms 26340 KB Output is correct
6 Correct 71 ms 31848 KB Output is correct
7 Correct 66 ms 31636 KB Output is correct
8 Correct 57 ms 31536 KB Output is correct
9 Correct 69 ms 31564 KB Output is correct
10 Correct 87 ms 31676 KB Output is correct
11 Correct 68 ms 31548 KB Output is correct
12 Correct 61 ms 31648 KB Output is correct
13 Correct 64 ms 27848 KB Output is correct
14 Correct 68 ms 32332 KB Output is correct
15 Correct 67 ms 31916 KB Output is correct
16 Correct 93 ms 32084 KB Output is correct
17 Correct 15 ms 26284 KB Output is correct
18 Correct 64 ms 31848 KB Output is correct
19 Correct 63 ms 31572 KB Output is correct
20 Correct 56 ms 31556 KB Output is correct
21 Correct 59 ms 31488 KB Output is correct
22 Correct 69 ms 31672 KB Output is correct
23 Correct 56 ms 31576 KB Output is correct
24 Correct 77 ms 31644 KB Output is correct
25 Correct 1366 ms 98908 KB Output is correct
26 Correct 1326 ms 105184 KB Output is correct
27 Correct 1241 ms 98352 KB Output is correct
28 Correct 1058 ms 102804 KB Output is correct
29 Correct 3764 ms 91716 KB Output is correct
30 Correct 4559 ms 95940 KB Output is correct
31 Correct 1468 ms 105652 KB Output is correct
32 Correct 68 ms 27760 KB Output is correct
33 Correct 70 ms 32296 KB Output is correct
34 Correct 81 ms 31876 KB Output is correct
35 Correct 100 ms 31964 KB Output is correct
36 Correct 16 ms 26324 KB Output is correct
37 Correct 75 ms 31800 KB Output is correct
38 Correct 85 ms 31644 KB Output is correct
39 Correct 61 ms 31520 KB Output is correct
40 Correct 63 ms 31568 KB Output is correct
41 Correct 74 ms 31676 KB Output is correct
42 Correct 56 ms 31560 KB Output is correct
43 Correct 59 ms 31672 KB Output is correct
44 Correct 1345 ms 98812 KB Output is correct
45 Correct 1292 ms 105280 KB Output is correct
46 Correct 1251 ms 98400 KB Output is correct
47 Correct 978 ms 102852 KB Output is correct
48 Correct 4175 ms 91684 KB Output is correct
49 Correct 4338 ms 96100 KB Output is correct
50 Correct 1408 ms 105492 KB Output is correct
51 Correct 1850 ms 168848 KB Output is correct
52 Correct 2048 ms 222588 KB Output is correct
53 Correct 2169 ms 176232 KB Output is correct
54 Correct 975 ms 98456 KB Output is correct
55 Execution timed out 6064 ms 166884 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 27840 KB Output is correct
2 Correct 64 ms 32316 KB Output is correct
3 Correct 66 ms 31936 KB Output is correct
4 Correct 95 ms 32060 KB Output is correct
5 Correct 14 ms 26316 KB Output is correct
6 Correct 72 ms 31852 KB Output is correct
7 Correct 70 ms 27816 KB Output is correct
8 Correct 63 ms 32328 KB Output is correct
9 Correct 62 ms 31892 KB Output is correct
10 Correct 94 ms 32060 KB Output is correct
11 Correct 14 ms 26340 KB Output is correct
12 Correct 71 ms 31848 KB Output is correct
13 Correct 66 ms 31636 KB Output is correct
14 Correct 57 ms 31536 KB Output is correct
15 Correct 69 ms 31564 KB Output is correct
16 Correct 87 ms 31676 KB Output is correct
17 Correct 68 ms 31548 KB Output is correct
18 Correct 61 ms 31648 KB Output is correct
19 Correct 17 ms 25812 KB Output is correct
20 Correct 13 ms 25812 KB Output is correct
21 Correct 15 ms 25812 KB Output is correct
22 Correct 69 ms 27848 KB Output is correct
23 Correct 72 ms 32328 KB Output is correct
24 Correct 61 ms 31872 KB Output is correct
25 Correct 109 ms 32076 KB Output is correct
26 Correct 14 ms 26324 KB Output is correct
27 Correct 71 ms 31808 KB Output is correct
28 Correct 59 ms 31552 KB Output is correct
29 Correct 57 ms 31568 KB Output is correct
30 Correct 55 ms 31488 KB Output is correct
31 Correct 74 ms 31680 KB Output is correct
32 Correct 64 ms 31564 KB Output is correct
33 Correct 58 ms 31692 KB Output is correct
34 Correct 1427 ms 97968 KB Output is correct
35 Correct 1464 ms 94372 KB Output is correct
36 Correct 1436 ms 94508 KB Output is correct
37 Correct 1292 ms 101176 KB Output is correct
38 Correct 1396 ms 97460 KB Output is correct
39 Correct 2583 ms 91372 KB Output is correct
40 Correct 2367 ms 92184 KB Output is correct
41 Correct 1584 ms 91424 KB Output is correct
42 Correct 1417 ms 97496 KB Output is correct
43 Correct 1408 ms 102980 KB Output is correct
44 Correct 1413 ms 102956 KB Output is correct
45 Correct 1472 ms 96484 KB Output is correct
46 Correct 1368 ms 97284 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 27840 KB Output is correct
2 Correct 64 ms 32316 KB Output is correct
3 Correct 66 ms 31936 KB Output is correct
4 Correct 95 ms 32060 KB Output is correct
5 Correct 14 ms 26316 KB Output is correct
6 Correct 72 ms 31852 KB Output is correct
7 Correct 70 ms 27816 KB Output is correct
8 Correct 63 ms 32328 KB Output is correct
9 Correct 62 ms 31892 KB Output is correct
10 Correct 94 ms 32060 KB Output is correct
11 Correct 14 ms 26340 KB Output is correct
12 Correct 71 ms 31848 KB Output is correct
13 Correct 66 ms 31636 KB Output is correct
14 Correct 57 ms 31536 KB Output is correct
15 Correct 69 ms 31564 KB Output is correct
16 Correct 87 ms 31676 KB Output is correct
17 Correct 68 ms 31548 KB Output is correct
18 Correct 61 ms 31648 KB Output is correct
19 Correct 64 ms 27848 KB Output is correct
20 Correct 68 ms 32332 KB Output is correct
21 Correct 67 ms 31916 KB Output is correct
22 Correct 93 ms 32084 KB Output is correct
23 Correct 15 ms 26284 KB Output is correct
24 Correct 64 ms 31848 KB Output is correct
25 Correct 63 ms 31572 KB Output is correct
26 Correct 56 ms 31556 KB Output is correct
27 Correct 59 ms 31488 KB Output is correct
28 Correct 69 ms 31672 KB Output is correct
29 Correct 56 ms 31576 KB Output is correct
30 Correct 77 ms 31644 KB Output is correct
31 Correct 1366 ms 98908 KB Output is correct
32 Correct 1326 ms 105184 KB Output is correct
33 Correct 1241 ms 98352 KB Output is correct
34 Correct 1058 ms 102804 KB Output is correct
35 Correct 3764 ms 91716 KB Output is correct
36 Correct 4559 ms 95940 KB Output is correct
37 Correct 1468 ms 105652 KB Output is correct
38 Correct 17 ms 25812 KB Output is correct
39 Correct 13 ms 25812 KB Output is correct
40 Correct 15 ms 25812 KB Output is correct
41 Correct 69 ms 27848 KB Output is correct
42 Correct 72 ms 32328 KB Output is correct
43 Correct 61 ms 31872 KB Output is correct
44 Correct 109 ms 32076 KB Output is correct
45 Correct 14 ms 26324 KB Output is correct
46 Correct 71 ms 31808 KB Output is correct
47 Correct 59 ms 31552 KB Output is correct
48 Correct 57 ms 31568 KB Output is correct
49 Correct 55 ms 31488 KB Output is correct
50 Correct 74 ms 31680 KB Output is correct
51 Correct 64 ms 31564 KB Output is correct
52 Correct 58 ms 31692 KB Output is correct
53 Correct 1427 ms 97968 KB Output is correct
54 Correct 1464 ms 94372 KB Output is correct
55 Correct 1436 ms 94508 KB Output is correct
56 Correct 1292 ms 101176 KB Output is correct
57 Correct 1396 ms 97460 KB Output is correct
58 Correct 2583 ms 91372 KB Output is correct
59 Correct 2367 ms 92184 KB Output is correct
60 Correct 1584 ms 91424 KB Output is correct
61 Correct 1417 ms 97496 KB Output is correct
62 Correct 1408 ms 102980 KB Output is correct
63 Correct 1413 ms 102956 KB Output is correct
64 Correct 1472 ms 96484 KB Output is correct
65 Correct 1368 ms 97284 KB Output is correct
66 Correct 14 ms 25812 KB Output is correct
67 Correct 14 ms 25860 KB Output is correct
68 Correct 13 ms 25812 KB Output is correct
69 Correct 68 ms 27780 KB Output is correct
70 Correct 83 ms 32284 KB Output is correct
71 Correct 62 ms 31880 KB Output is correct
72 Correct 89 ms 31980 KB Output is correct
73 Correct 15 ms 26324 KB Output is correct
74 Correct 78 ms 31860 KB Output is correct
75 Correct 57 ms 31544 KB Output is correct
76 Correct 58 ms 31496 KB Output is correct
77 Correct 63 ms 31584 KB Output is correct
78 Correct 75 ms 31708 KB Output is correct
79 Correct 56 ms 31552 KB Output is correct
80 Correct 58 ms 31552 KB Output is correct
81 Correct 1314 ms 98896 KB Output is correct
82 Correct 1285 ms 105192 KB Output is correct
83 Correct 1210 ms 98412 KB Output is correct
84 Correct 956 ms 102784 KB Output is correct
85 Correct 4086 ms 91708 KB Output is correct
86 Correct 3924 ms 96148 KB Output is correct
87 Correct 1373 ms 105440 KB Output is correct
88 Correct 1353 ms 98160 KB Output is correct
89 Correct 1363 ms 94380 KB Output is correct
90 Correct 1380 ms 94196 KB Output is correct
91 Correct 1209 ms 101268 KB Output is correct
92 Correct 1299 ms 97464 KB Output is correct
93 Correct 2332 ms 91432 KB Output is correct
94 Correct 2080 ms 92060 KB Output is correct
95 Correct 1554 ms 91404 KB Output is correct
96 Correct 1321 ms 97548 KB Output is correct
97 Correct 1347 ms 103056 KB Output is correct
98 Correct 1358 ms 103012 KB Output is correct
99 Correct 1389 ms 96612 KB Output is correct
100 Correct 1333 ms 97416 KB Output is correct
101 Correct 1316 ms 98992 KB Output is correct
102 Correct 1208 ms 102272 KB Output is correct
103 Correct 1325 ms 99044 KB Output is correct
104 Execution timed out 6084 ms 98116 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 27840 KB Output is correct
2 Correct 64 ms 32316 KB Output is correct
3 Correct 66 ms 31936 KB Output is correct
4 Correct 95 ms 32060 KB Output is correct
5 Correct 14 ms 26316 KB Output is correct
6 Correct 72 ms 31852 KB Output is correct
7 Correct 70 ms 27816 KB Output is correct
8 Correct 63 ms 32328 KB Output is correct
9 Correct 62 ms 31892 KB Output is correct
10 Correct 94 ms 32060 KB Output is correct
11 Correct 14 ms 26340 KB Output is correct
12 Correct 71 ms 31848 KB Output is correct
13 Correct 66 ms 31636 KB Output is correct
14 Correct 57 ms 31536 KB Output is correct
15 Correct 69 ms 31564 KB Output is correct
16 Correct 87 ms 31676 KB Output is correct
17 Correct 68 ms 31548 KB Output is correct
18 Correct 61 ms 31648 KB Output is correct
19 Correct 64 ms 27848 KB Output is correct
20 Correct 68 ms 32332 KB Output is correct
21 Correct 67 ms 31916 KB Output is correct
22 Correct 93 ms 32084 KB Output is correct
23 Correct 15 ms 26284 KB Output is correct
24 Correct 64 ms 31848 KB Output is correct
25 Correct 63 ms 31572 KB Output is correct
26 Correct 56 ms 31556 KB Output is correct
27 Correct 59 ms 31488 KB Output is correct
28 Correct 69 ms 31672 KB Output is correct
29 Correct 56 ms 31576 KB Output is correct
30 Correct 77 ms 31644 KB Output is correct
31 Correct 1366 ms 98908 KB Output is correct
32 Correct 1326 ms 105184 KB Output is correct
33 Correct 1241 ms 98352 KB Output is correct
34 Correct 1058 ms 102804 KB Output is correct
35 Correct 3764 ms 91716 KB Output is correct
36 Correct 4559 ms 95940 KB Output is correct
37 Correct 1468 ms 105652 KB Output is correct
38 Correct 68 ms 27760 KB Output is correct
39 Correct 70 ms 32296 KB Output is correct
40 Correct 81 ms 31876 KB Output is correct
41 Correct 100 ms 31964 KB Output is correct
42 Correct 16 ms 26324 KB Output is correct
43 Correct 75 ms 31800 KB Output is correct
44 Correct 85 ms 31644 KB Output is correct
45 Correct 61 ms 31520 KB Output is correct
46 Correct 63 ms 31568 KB Output is correct
47 Correct 74 ms 31676 KB Output is correct
48 Correct 56 ms 31560 KB Output is correct
49 Correct 59 ms 31672 KB Output is correct
50 Correct 1345 ms 98812 KB Output is correct
51 Correct 1292 ms 105280 KB Output is correct
52 Correct 1251 ms 98400 KB Output is correct
53 Correct 978 ms 102852 KB Output is correct
54 Correct 4175 ms 91684 KB Output is correct
55 Correct 4338 ms 96100 KB Output is correct
56 Correct 1408 ms 105492 KB Output is correct
57 Correct 1850 ms 168848 KB Output is correct
58 Correct 2048 ms 222588 KB Output is correct
59 Correct 2169 ms 176232 KB Output is correct
60 Correct 975 ms 98456 KB Output is correct
61 Execution timed out 6064 ms 166884 KB Time limit exceeded
62 Halted 0 ms 0 KB -