oj.uz

Submission #655735

# Submission time Handle Problem Language Result Execution time Memory
655735 2022-11-05T11:58:49 Z 600Mihnea From Hacks to Snitches (BOI21_watchmen) C++17
40 / 100
 6000 ms 104524 KB 
// pana la ora 1
bool home = 0;
bool verbose = 1;

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

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

priority_queue<pair<int, int>> pq;

void relax(int id, int d) {
  if (d < dp[id]) {
    dp[id] = d;
    pq.push({ -dp[id], id });
  }
}

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) };
      }
    }
  }
  if (verbose) {
    cout << "y = " << y << "\n";
    cout << "################################################################################### \n";
  }



  map<pair<int, int>, int> spec;
  vector<pair<int, int>> all;

  for (int vertex = 1; vertex <= n; vertex++) {
    if (int cycle = cycle_id[vertex]) {
      for (auto& vecin : g[vertex]) {
        if (int cycle_vecin = cycle_id[vecin]) {
          // vecin is on a cycle
          if (cycle_vecin != cycle) {
            // vecin is on a different cycle
            spec[{vertex, vecin}] = 0;
          }
        }
      }
    }
  }
  vector<vector<int>> ids;
  for (auto& it : spec) {
    it.second = (int)all.size();
    all.push_back(it.first);
    int vertex = it.first.first, vecin = it.first.second;
    int l_vecin = cycles[cycle_id[vecin]].size();
    ids.push_back({});
    ids.back().resize(l_vecin);
    for (int r = 0; r < l_vecin; r++) {
      y++;
      ids.back()[r] = y;
      what[y] = { -(int)ids.size(), r };
    }
  }

  for (int i = 1; i <= y; i++) {
    dp[i] = INF;
  }
  dp[single_vertex_id[1]] = 0;
  pq.push({ 0, single_vertex_id[1] });

  while (!pq.empty()) {
    int d = -pq.top().first;
    int idv = pq.top().second;
    pq.pop();
    if (dp[idv] != d) {
      continue;
    }
    int vertex = what[idv].v;
    int r = what[idv].r;
    if (vertex < 0) {
    //  cout << "aici\n";
      int p = vertex;
      p *= -1;
      p--;
      assert(0 <= p && p < (int)ids.size());
      int vertex = all[p].first, vecin = all[p].second;
      int l = cycles[cycle_id[vertex]].size();
      int l_vecin = cycles[cycle_id[vecin]].size();
      assert((int)ids[p].size() == l_vecin);
      relax(ids[p][(d + l) % l_vecin], d + l);

      if (d % l_vecin == cycle_location[vecin]) {
        continue;
      }
      relax(cycle_vertex_id[vecin][d % l_vecin], d);
      continue;
    }
    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
            assert(spec.count({ vertex, vecin }));
            int p = spec[{vertex, vecin}];
          //  cout << "gest:" << (int)pq.size()<<" "<< ids[p][(d + 1) % l_vecin]<< " vs "<<1<<"..."<<y << "\n";
            relax(ids[p][(d + 1) % l_vecin], d + 1);
            continue;
            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;
}

Compilation message

watchmen.cpp: In function 'int main()':
watchmen.cpp:138:9: warning: unused variable 'vertex' [-Wunused-variable]
  138 |     int vertex = it.first.first, vecin = it.first.second;
      |         ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 26032 KB Output is correct
2 Correct 69 ms 30828 KB Output is correct
3 Correct 71 ms 30668 KB Output is correct
4 Correct 103 ms 30604 KB Output is correct
5 Correct 14 ms 24316 KB Output is correct
6 Correct 77 ms 30528 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26048 KB Output is correct
2 Correct 83 ms 30816 KB Output is correct
3 Correct 69 ms 30404 KB Output is correct
4 Correct 100 ms 30552 KB Output is correct
5 Correct 15 ms 24276 KB Output is correct
6 Correct 71 ms 30384 KB Output is correct
7 Correct 60 ms 30176 KB Output is correct
8 Correct 61 ms 30144 KB Output is correct
9 Correct 63 ms 30020 KB Output is correct
10 Correct 75 ms 30360 KB Output is correct
11 Correct 60 ms 30092 KB Output is correct
12 Correct 63 ms 30400 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26048 KB Output is correct
2 Correct 83 ms 30816 KB Output is correct
3 Correct 69 ms 30404 KB Output is correct
4 Correct 100 ms 30552 KB Output is correct
5 Correct 15 ms 24276 KB Output is correct
6 Correct 71 ms 30384 KB Output is correct
7 Correct 60 ms 30176 KB Output is correct
8 Correct 61 ms 30144 KB Output is correct
9 Correct 63 ms 30020 KB Output is correct
10 Correct 75 ms 30360 KB Output is correct
11 Correct 60 ms 30092 KB Output is correct
12 Correct 63 ms 30400 KB Output is correct
13 Correct 77 ms 26076 KB Output is correct
14 Correct 69 ms 30760 KB Output is correct
15 Correct 73 ms 30512 KB Output is correct
16 Correct 96 ms 30528 KB Output is correct
17 Correct 15 ms 24276 KB Output is correct
18 Correct 70 ms 30380 KB Output is correct
19 Correct 61 ms 30236 KB Output is correct
20 Correct 62 ms 30128 KB Output is correct
21 Correct 61 ms 29980 KB Output is correct
22 Correct 81 ms 30472 KB Output is correct
23 Correct 63 ms 30160 KB Output is correct
24 Correct 64 ms 30400 KB Output is correct
25 Correct 1369 ms 98008 KB Output is correct
26 Correct 1320 ms 104524 KB Output is correct
27 Correct 1235 ms 97520 KB Output is correct
28 Correct 1046 ms 101564 KB Output is correct
29 Correct 5518 ms 91524 KB Output is correct
30 Execution timed out 6047 ms 95620 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26048 KB Output is correct
2 Correct 83 ms 30816 KB Output is correct
3 Correct 69 ms 30404 KB Output is correct
4 Correct 100 ms 30552 KB Output is correct
5 Correct 15 ms 24276 KB Output is correct
6 Correct 71 ms 30384 KB Output is correct
7 Correct 60 ms 30176 KB Output is correct
8 Correct 61 ms 30144 KB Output is correct
9 Correct 63 ms 30020 KB Output is correct
10 Correct 75 ms 30360 KB Output is correct
11 Correct 60 ms 30092 KB Output is correct
12 Correct 63 ms 30400 KB Output is correct
13 Correct 77 ms 26076 KB Output is correct
14 Correct 69 ms 30760 KB Output is correct
15 Correct 73 ms 30512 KB Output is correct
16 Correct 96 ms 30528 KB Output is correct
17 Correct 15 ms 24276 KB Output is correct
18 Correct 70 ms 30380 KB Output is correct
19 Correct 61 ms 30236 KB Output is correct
20 Correct 62 ms 30128 KB Output is correct
21 Correct 61 ms 29980 KB Output is correct
22 Correct 81 ms 30472 KB Output is correct
23 Correct 63 ms 30160 KB Output is correct
24 Correct 64 ms 30400 KB Output is correct
25 Correct 1369 ms 98008 KB Output is correct
26 Correct 1320 ms 104524 KB Output is correct
27 Correct 1235 ms 97520 KB Output is correct
28 Correct 1046 ms 101564 KB Output is correct
29 Correct 5518 ms 91524 KB Output is correct
30 Execution timed out 6047 ms 95620 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 26032 KB Output is correct
2 Correct 69 ms 30828 KB Output is correct
3 Correct 71 ms 30668 KB Output is correct
4 Correct 103 ms 30604 KB Output is correct
5 Correct 14 ms 24316 KB Output is correct
6 Correct 77 ms 30528 KB Output is correct
7 Correct 74 ms 26048 KB Output is correct
8 Correct 83 ms 30816 KB Output is correct
9 Correct 69 ms 30404 KB Output is correct
10 Correct 100 ms 30552 KB Output is correct
11 Correct 15 ms 24276 KB Output is correct
12 Correct 71 ms 30384 KB Output is correct
13 Correct 60 ms 30176 KB Output is correct
14 Correct 61 ms 30144 KB Output is correct
15 Correct 63 ms 30020 KB Output is correct
16 Correct 75 ms 30360 KB Output is correct
17 Correct 60 ms 30092 KB Output is correct
18 Correct 63 ms 30400 KB Output is correct
19 Correct 14 ms 23764 KB Output is correct
20 Correct 14 ms 23764 KB Output is correct
21 Correct 12 ms 23816 KB Output is correct
22 Correct 77 ms 25852 KB Output is correct
23 Correct 99 ms 30656 KB Output is correct
24 Correct 81 ms 30272 KB Output is correct
25 Correct 114 ms 30336 KB Output is correct
26 Correct 15 ms 24280 KB Output is correct
27 Correct 78 ms 30108 KB Output is correct
28 Correct 71 ms 29952 KB Output is correct
29 Correct 75 ms 29864 KB Output is correct
30 Correct 78 ms 29792 KB Output is correct
31 Correct 121 ms 30116 KB Output is correct
32 Correct 63 ms 29764 KB Output is correct
33 Correct 103 ms 29908 KB Output is correct
34 Correct 1395 ms 97608 KB Output is correct
35 Correct 1443 ms 94492 KB Output is correct
36 Correct 1445 ms 94548 KB Output is correct
37 Correct 1278 ms 100776 KB Output is correct
38 Correct 1365 ms 96688 KB Output is correct
39 Correct 3135 ms 91668 KB Output is correct
40 Correct 2758 ms 100556 KB Output is correct
41 Correct 1720 ms 95244 KB Output is correct
42 Correct 1416 ms 97780 KB Output is correct
43 Correct 1404 ms 102596 KB Output is correct
44 Correct 1387 ms 103036 KB Output is correct
45 Correct 1455 ms 96480 KB Output is correct
46 Correct 1356 ms 96868 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 26032 KB Output is correct
2 Correct 69 ms 30828 KB Output is correct
3 Correct 71 ms 30668 KB Output is correct
4 Correct 103 ms 30604 KB Output is correct
5 Correct 14 ms 24316 KB Output is correct
6 Correct 77 ms 30528 KB Output is correct
7 Correct 74 ms 26048 KB Output is correct
8 Correct 83 ms 30816 KB Output is correct
9 Correct 69 ms 30404 KB Output is correct
10 Correct 100 ms 30552 KB Output is correct
11 Correct 15 ms 24276 KB Output is correct
12 Correct 71 ms 30384 KB Output is correct
13 Correct 60 ms 30176 KB Output is correct
14 Correct 61 ms 30144 KB Output is correct
15 Correct 63 ms 30020 KB Output is correct
16 Correct 75 ms 30360 KB Output is correct
17 Correct 60 ms 30092 KB Output is correct
18 Correct 63 ms 30400 KB Output is correct
19 Correct 77 ms 26076 KB Output is correct
20 Correct 69 ms 30760 KB Output is correct
21 Correct 73 ms 30512 KB Output is correct
22 Correct 96 ms 30528 KB Output is correct
23 Correct 15 ms 24276 KB Output is correct
24 Correct 70 ms 30380 KB Output is correct
25 Correct 61 ms 30236 KB Output is correct
26 Correct 62 ms 30128 KB Output is correct
27 Correct 61 ms 29980 KB Output is correct
28 Correct 81 ms 30472 KB Output is correct
29 Correct 63 ms 30160 KB Output is correct
30 Correct 64 ms 30400 KB Output is correct
31 Correct 1369 ms 98008 KB Output is correct
32 Correct 1320 ms 104524 KB Output is correct
33 Correct 1235 ms 97520 KB Output is correct
34 Correct 1046 ms 101564 KB Output is correct
35 Correct 5518 ms 91524 KB Output is correct
36 Execution timed out 6047 ms 95620 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 26032 KB Output is correct
2 Correct 69 ms 30828 KB Output is correct
3 Correct 71 ms 30668 KB Output is correct
4 Correct 103 ms 30604 KB Output is correct
5 Correct 14 ms 24316 KB Output is correct
6 Correct 77 ms 30528 KB Output is correct
7 Correct 74 ms 26048 KB Output is correct
8 Correct 83 ms 30816 KB Output is correct
9 Correct 69 ms 30404 KB Output is correct
10 Correct 100 ms 30552 KB Output is correct
11 Correct 15 ms 24276 KB Output is correct
12 Correct 71 ms 30384 KB Output is correct
13 Correct 60 ms 30176 KB Output is correct
14 Correct 61 ms 30144 KB Output is correct
15 Correct 63 ms 30020 KB Output is correct
16 Correct 75 ms 30360 KB Output is correct
17 Correct 60 ms 30092 KB Output is correct
18 Correct 63 ms 30400 KB Output is correct
19 Correct 77 ms 26076 KB Output is correct
20 Correct 69 ms 30760 KB Output is correct
21 Correct 73 ms 30512 KB Output is correct
22 Correct 96 ms 30528 KB Output is correct
23 Correct 15 ms 24276 KB Output is correct
24 Correct 70 ms 30380 KB Output is correct
25 Correct 61 ms 30236 KB Output is correct
26 Correct 62 ms 30128 KB Output is correct
27 Correct 61 ms 29980 KB Output is correct
28 Correct 81 ms 30472 KB Output is correct
29 Correct 63 ms 30160 KB Output is correct
30 Correct 64 ms 30400 KB Output is correct
31 Correct 1369 ms 98008 KB Output is correct
32 Correct 1320 ms 104524 KB Output is correct
33 Correct 1235 ms 97520 KB Output is correct
34 Correct 1046 ms 101564 KB Output is correct
35 Correct 5518 ms 91524 KB Output is correct
36 Execution timed out 6047 ms 95620 KB Time limit exceeded
37 Halted 0 ms 0 KB -