oj.uz

Submission #216317

# Submission time Handle Problem Language Result Execution time Memory
216317 2020-03-27T05:12:56 Z model_code Stray Cat (JOI20_stray) C++17
100 / 100
 98 ms 16380 KB 
#include "Anthony.h"
#include <queue>
#include <utility>
#include <vector>

namespace {

using std::vector;

}  // namespace

std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  vector<vector<int>> G(N);
  for (int i = 0; i < M; ++i) {
    G[U[i]].push_back(i);
    G[V[i]].push_back(i);
  }
  std::queue<int> que;
  vector<int> dist(N, N);
  vector<int> colors(N, -1);
  dist[0] = 0;
  que.push(0);
  for (; !que.empty(); ) {
    const int u = que.front();
    que.pop();
    for (const int i : G[u]) {
      const int v = U[i] ^ V[i] ^ u;
      if (dist[v] > dist[u] + 1) {
        dist[v] = dist[u] + 1;
        que.push(v);
        if (A == 2) {
          if (u == 0) {
            colors[v] = 0;
          } else if (G[u].size() >= 3) {
            colors[v] = ("010011"[colors[u]] == '0') ? 1 : 0;
          } else {
            colors[v] = (colors[u] + 1) % 6;
          }
        }
      }
    }
  }
  vector<int> x(M, -1);
  for (int i = 0; i < M; ++i) {
    int u = U[i], v = V[i];
    if (dist[u] > dist[v]) {
      std::swap(u, v);
    }
    if (A == 2) {
      x[i] = "010011"[colors[v]] - '0';
    } else {
      x[i] = dist[u] % 3;
    }
  }
  return x;
}
#include "Catherine.h"
#include <assert.h>
#include <algorithm>
#include <string>
#include <vector>

namespace {

using std::string;

int A, B;
int last = -1;
bool known = false;
string seq = "";

}  // namespace

void Init(int A, int B) {
  ::A = A;
  ::B = B;
}

int Move(std::vector<int> y) {
  int ans = -2;
  auto yy = y;
  if (last != -1) {
    ++yy[last];
  }
  if (A == 2) {
    int deg = 0;
    for (int k = 0; k < 2; ++k) {
      deg += yy[k];
    }
    if (deg == 2) {
      if (known) {
        assert(std::count(y.begin(), y.end(), 1) == 1);
        ans = std::find(y.begin(), y.end(), 1) - y.begin();
      } else {
        for (int k = 0; k < 2; ++k) {
          seq += string(y[k], static_cast<char>('0' + k));
        }
        if (seq.size() == 5) {
          bool rev = false;
          for (int rot = 0; rot < 6; ++rot) {
            if (seq == string("010011010011").substr(rot, 5)) {
              rev = true;
            }
          }
          known = true;
          if (rev) {
            ans = -1;
          } else {
            assert(std::count(y.begin(), y.end(), 1) == 1);
            ans = std::find(y.begin(), y.end(), 1) - y.begin();
          }
        } else {
          ans = seq.back() - '0';
        }
      }
    } else {
      known = true;
      assert(std::count(yy.begin(), yy.end(), 1) == 1);
      ans = std::find(yy.begin(), yy.end(), 1) - yy.begin();
      if (ans == last) {
        ans = -1;
      }
    }
  } else {
    int flag = 0;
    for (int k = 0; k < 3; ++k) {
      if (yy[k] > 0) {
        flag |= 1 << k;
      }
    }
    switch (flag) {
      case 0b001: case 0b011: ans = 0; break;
      case 0b010: case 0b110: ans = 1; break;
      case 0b100: case 0b101: ans = 2; break;
      default: assert(false);
    }
  }
  if (ans != -1) {
    last = ans;
  }
  return ans;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 15128 KB Output is correct
2 Correct 8 ms 908 KB Output is correct
3 Correct 52 ms 14704 KB Output is correct
4 Correct 76 ms 16332 KB Output is correct
5 Correct 70 ms 16380 KB Output is correct
6 Correct 62 ms 14968 KB Output is correct
7 Correct 63 ms 14976 KB Output is correct
8 Correct 79 ms 15744 KB Output is correct
9 Correct 68 ms 15868 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 15128 KB Output is correct
2 Correct 8 ms 908 KB Output is correct
3 Correct 52 ms 14704 KB Output is correct
4 Correct 76 ms 16332 KB Output is correct
5 Correct 70 ms 16380 KB Output is correct
6 Correct 62 ms 14968 KB Output is correct
7 Correct 63 ms 14976 KB Output is correct
8 Correct 79 ms 15744 KB Output is correct
9 Correct 68 ms 15868 KB Output is correct
10 Correct 71 ms 13040 KB Output is correct
11 Correct 61 ms 13012 KB Output is correct
12 Correct 59 ms 13004 KB Output is correct
13 Correct 54 ms 13040 KB Output is correct
14 Correct 66 ms 13256 KB Output is correct
15 Correct 83 ms 13680 KB Output is correct
16 Correct 76 ms 15860 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 12808 KB Output is correct
2 Correct 8 ms 772 KB Output is correct
3 Correct 50 ms 12392 KB Output is correct
4 Correct 71 ms 14068 KB Output is correct
5 Correct 85 ms 14204 KB Output is correct
6 Correct 62 ms 12876 KB Output is correct
7 Correct 55 ms 12936 KB Output is correct
8 Correct 62 ms 13428 KB Output is correct
9 Correct 69 ms 13428 KB Output is correct
10 Correct 61 ms 13260 KB Output is correct
11 Correct 72 ms 13300 KB Output is correct
12 Correct 60 ms 13180 KB Output is correct
13 Correct 60 ms 13308 KB Output is correct
14 Correct 68 ms 13556 KB Output is correct
15 Correct 70 ms 13604 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 12808 KB Output is correct
2 Correct 8 ms 772 KB Output is correct
3 Correct 50 ms 12392 KB Output is correct
4 Correct 71 ms 14068 KB Output is correct
5 Correct 85 ms 14204 KB Output is correct
6 Correct 62 ms 12876 KB Output is correct
7 Correct 55 ms 12936 KB Output is correct
8 Correct 62 ms 13428 KB Output is correct
9 Correct 69 ms 13428 KB Output is correct
10 Correct 61 ms 13260 KB Output is correct
11 Correct 72 ms 13300 KB Output is correct
12 Correct 60 ms 13180 KB Output is correct
13 Correct 60 ms 13308 KB Output is correct
14 Correct 68 ms 13556 KB Output is correct
15 Correct 70 ms 13604 KB Output is correct
16 Correct 56 ms 11200 KB Output is correct
17 Correct 59 ms 11192 KB Output is correct
18 Correct 54 ms 11144 KB Output is correct
19 Correct 54 ms 11128 KB Output is correct
20 Correct 59 ms 11872 KB Output is correct
21 Correct 62 ms 11700 KB Output is correct
22 Correct 86 ms 13812 KB Output is correct
23 Correct 53 ms 11336 KB Output is correct
24 Correct 61 ms 11332 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1108 KB Output is correct
2 Correct 9 ms 780 KB Output is correct
3 Correct 11 ms 1044 KB Output is correct
4 Correct 10 ms 1064 KB Output is correct
5 Correct 10 ms 1148 KB Output is correct
6 Correct 10 ms 1036 KB Output is correct
7 Correct 10 ms 1036 KB Output is correct
8 Correct 10 ms 1044 KB Output is correct
9 Correct 10 ms 1172 KB Output is correct
10 Correct 10 ms 1036 KB Output is correct
11 Correct 11 ms 1044 KB Output is correct
12 Correct 10 ms 1032 KB Output is correct
13 Correct 10 ms 1036 KB Output is correct
14 Correct 10 ms 1044 KB Output is correct
15 Correct 10 ms 1164 KB Output is correct
16 Correct 10 ms 1044 KB Output is correct
17 Correct 10 ms 1036 KB Output is correct
18 Correct 10 ms 1164 KB Output is correct
19 Correct 10 ms 956 KB Output is correct
20 Correct 10 ms 1044 KB Output is correct
21 Correct 10 ms 1164 KB Output is correct
22 Correct 11 ms 1044 KB Output is correct
23 Correct 10 ms 1048 KB Output is correct
24 Correct 10 ms 1044 KB Output is correct
25 Correct 10 ms 1044 KB Output is correct
26 Correct 11 ms 1036 KB Output is correct
27 Correct 11 ms 908 KB Output is correct
28 Correct 10 ms 1108 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 11028 KB Output is correct
2 Correct 57 ms 11400 KB Output is correct
3 Correct 9 ms 772 KB Output is correct
4 Correct 53 ms 11020 KB Output is correct
5 Correct 79 ms 12148 KB Output is correct
6 Correct 98 ms 12160 KB Output is correct
7 Correct 62 ms 11260 KB Output is correct
8 Correct 79 ms 11392 KB Output is correct
9 Correct 76 ms 12160 KB Output is correct
10 Correct 72 ms 12228 KB Output is correct
11 Correct 67 ms 12156 KB Output is correct
12 Correct 68 ms 12260 KB Output is correct
13 Correct 71 ms 12156 KB Output is correct
14 Correct 77 ms 12224 KB Output is correct
15 Correct 81 ms 12288 KB Output is correct
16 Correct 73 ms 12148 KB Output is correct
17 Correct 74 ms 11904 KB Output is correct
18 Correct 66 ms 11828 KB Output is correct
19 Correct 78 ms 11924 KB Output is correct
20 Correct 68 ms 11764 KB Output is correct
21 Correct 60 ms 11908 KB Output is correct
22 Correct 65 ms 11764 KB Output is correct
23 Correct 63 ms 11132 KB Output is correct
24 Correct 53 ms 11132 KB Output is correct
25 Correct 52 ms 11244 KB Output is correct
26 Correct 57 ms 11144 KB Output is correct
27 Correct 69 ms 11668 KB Output is correct
28 Correct 67 ms 11548 KB Output is correct
29 Correct 71 ms 11636 KB Output is correct
30 Correct 62 ms 11604 KB Output is correct
31 Correct 56 ms 11264 KB Output is correct
32 Correct 50 ms 11256 KB Output is correct
33 Correct 67 ms 11260 KB Output is correct
34 Correct 73 ms 11260 KB Output is correct
35 Correct 56 ms 11388 KB Output is correct
36 Correct 64 ms 11668 KB Output is correct
37 Correct 63 ms 11508 KB Output is correct
38 Correct 67 ms 11468 KB Output is correct
39 Correct 64 ms 11604 KB Output is correct
40 Correct 68 ms 11644 KB Output is correct
41 Correct 64 ms 11772 KB Output is correct
42 Correct 68 ms 11820 KB Output is correct
43 Correct 71 ms 11736 KB Output is correct
44 Correct 78 ms 11900 KB Output is correct
45 Correct 72 ms 11900 KB Output is correct
46 Correct 85 ms 11764 KB Output is correct
47 Correct 56 ms 11604 KB Output is correct
48 Correct 62 ms 11380 KB Output is correct
49 Correct 77 ms 11364 KB Output is correct
50 Correct 64 ms 11508 KB Output is correct
51 Correct 64 ms 11252 KB Output is correct
52 Correct 56 ms 11428 KB Output is correct
53 Correct 69 ms 11252 KB Output is correct
54 Correct 58 ms 11260 KB Output is correct
55 Correct 53 ms 11196 KB Output is correct
56 Correct 55 ms 11212 KB Output is correct
57 Correct 50 ms 11264 KB Output is correct
58 Correct 56 ms 11260 KB Output is correct
59 Correct 55 ms 11268 KB Output is correct
60 Correct 65 ms 11212 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 10956 KB Output is correct
2 Correct 64 ms 11352 KB Output is correct
3 Correct 9 ms 908 KB Output is correct
4 Correct 53 ms 10984 KB Output is correct
5 Correct 67 ms 12192 KB Output is correct
6 Correct 76 ms 12124 KB Output is correct
7 Correct 57 ms 11264 KB Output is correct
8 Correct 52 ms 11272 KB Output is correct
9 Correct 76 ms 12156 KB Output is correct
10 Correct 68 ms 12264 KB Output is correct
11 Correct 68 ms 12148 KB Output is correct
12 Correct 65 ms 12148 KB Output is correct
13 Correct 68 ms 12156 KB Output is correct
14 Correct 76 ms 12148 KB Output is correct
15 Correct 73 ms 12148 KB Output is correct
16 Correct 76 ms 12248 KB Output is correct
17 Correct 70 ms 11920 KB Output is correct
18 Correct 64 ms 11900 KB Output is correct
19 Correct 64 ms 11992 KB Output is correct
20 Correct 64 ms 11900 KB Output is correct
21 Correct 64 ms 11868 KB Output is correct
22 Correct 70 ms 11892 KB Output is correct
23 Correct 53 ms 11044 KB Output is correct
24 Correct 48 ms 11144 KB Output is correct
25 Correct 61 ms 11124 KB Output is correct
26 Correct 57 ms 11268 KB Output is correct
27 Correct 64 ms 11540 KB Output is correct
28 Correct 64 ms 11508 KB Output is correct
29 Correct 69 ms 11636 KB Output is correct
30 Correct 59 ms 11692 KB Output is correct
31 Correct 56 ms 11124 KB Output is correct
32 Correct 58 ms 11120 KB Output is correct
33 Correct 51 ms 11132 KB Output is correct
34 Correct 55 ms 11348 KB Output is correct
35 Correct 65 ms 11388 KB Output is correct
36 Correct 61 ms 11708 KB Output is correct
37 Correct 57 ms 11468 KB Output is correct
38 Correct 68 ms 11380 KB Output is correct
39 Correct 59 ms 11644 KB Output is correct
40 Correct 63 ms 11784 KB Output is correct
41 Correct 66 ms 11900 KB Output is correct
42 Correct 78 ms 11776 KB Output is correct
43 Correct 69 ms 11768 KB Output is correct
44 Correct 71 ms 11976 KB Output is correct
45 Correct 67 ms 11908 KB Output is correct
46 Correct 69 ms 11812 KB Output is correct
47 Correct 57 ms 11396 KB Output is correct
48 Correct 72 ms 11436 KB Output is correct
49 Correct 62 ms 11392 KB Output is correct
50 Correct 71 ms 11380 KB Output is correct
51 Correct 61 ms 11136 KB Output is correct
52 Correct 64 ms 11348 KB Output is correct
53 Correct 59 ms 11252 KB Output is correct
54 Correct 59 ms 11256 KB Output is correct
55 Correct 60 ms 11256 KB Output is correct
56 Correct 61 ms 11360 KB Output is correct
57 Correct 55 ms 11252 KB Output is correct
58 Correct 56 ms 11212 KB Output is correct
59 Correct 60 ms 11372 KB Output is correct
60 Correct 55 ms 11132 KB Output is correct