oj.uz

Submission #220380

# Submission time Handle Problem Language Result Execution time Memory
220380 2020-04-07T19:06:49 Z WLZ Stray Cat (JOI20_stray) C++14
91 / 100
 71 ms 16936 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
  const vector<int> period = {0, 1, 0, 0, 1, 1};

  struct edge {
    int from, to, idx;
  };
  vector< vector<edge> > g;

  vector<int> solve1234(int N, int M, vector<int> U, vector<int> V) {
    queue<int> q;
    q.push(0);
    vector<int> dist(N, -1), ans(M, -1);
    dist[0] = 0;
    while (!q.empty()) {
      int u = q.front(); q.pop();
      for (auto& e : g[u]) {
        if (dist[e.to] == -1) {
          dist[e.to] = dist[u] + 1;
          q.push(e.to);
        }
      }
    }
    for (int i = 0; i < M; i++) {
      ans[i] = min(dist[U[i]], dist[V[i]]) % 3;
    }
    return ans;
  }

  vector<int> solve567(int N, int M, vector<int> U, vector<int> V) {
    vector<int> prev(N, 1), was(N, 0), len(N, 0), ans(M, -1);
    queue<int> q; q.push(0);
    was[0] = 1;
    while (!q.empty()) {
      int u = q.front(); q.pop();
      if ((int) g[u].size() == 2) {
        if (len[u] == 0) {
          if (prev[u] == 0) {
            len[u] = 1;
          }
        }
      }
      for (auto& e : g[u]) {
        if (!was[e.to]) {
          if ((int) g[u].size() == 2 || u == 0) {
            len[e.to] = len[u] + 1;
            ans[e.idx] = period[len[u] % 6];
          } else {
            ans[e.idx] = !prev[u];
          }
          q.push(e.to);
          was[e.to] = 1;
          prev[e.to] = ans[e.idx];
        }
      }
    }
    return ans;
  }
}

vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
  g.resize(N);
  for (int i = 0; i < M; i++) {
    g[U[i]].push_back({U[i], V[i], i});
    g[V[i]].push_back({V[i], U[i], i});
  }
  if (A >= 3) {
    return solve1234(N, M, U, V);
  } else {
    return solve567(N, M, U, V);
  }
}

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;

namespace {
  const vector<int> period = {0, 1, 0, 0, 1, 1};
  vector<int> cur;

  int A, B, start = 1, rev = 0, last;
}

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

int Move(vector<int> y) {
  if (A >= 3) {
    for (int i = 0; i < 3; i++) {
      if (y[i] > 0 && y[(i + 1) % 3] > 0) {
        return i;
      }
    }
    for (int i = 0; i < 3; i++) {
      if (y[i] > 0) {
        return i;
      }
    }
  } else {
    if (rev) {
      int tmp = cur.back();
      cur.pop_back();
      if (cur.empty()) {
        rev = 0;
      }
      return (last = tmp);
    }
    if (y[0] > 1 && y[1] > 0) {
      start = 0;
      return (last = 1);
    }
    if (y[0] > 1 && y[1] > 0) {
      start = 0;
      return (last = 0);
    }
    if (y[0] == 0 && y[1] == 0) {
      start = 0;
      return (last = -1);
    }
    if (start) {
      if (y[0] > 0 && y[1] > 0 && !cur.empty()) {
        start = 0;
        return (last = !cur.back());
      }
      if (cur.empty()) {
        if (y[0] == 1 && y[1] == 0) {
          start = 0;
          return 0;
        }
        if (y[1] == 1 && y[0] == 0) {
          start = 0;
          return 1;
        }
      }
      for (int i = 0; i < 2; i++) {
        if (y[i] > 0) {
          if (cur.empty()) {
            if (y[i] > 1) {
              cur.push_back(i);
            } else {
              cur.push_back(!i);
            }
          }
          cur.push_back(i);
          break;
        }
      }
      if ((int) cur.size() == 5) {
        start = 0;
        for (int i = 0; i < 6; i++) {
          int match = 1;
          for (int j = 0; j < 5; j++) {
            if (period[(i + j) % 6] != cur[j]) {
              match = 0;
              break;
            }
          }
          if (match) {
            rev = 1;
            cur.pop_back();
            cur.pop_back();
            return -1;
          }
        }
      }
      if (!rev) {
        return (last = cur.back());
      }
    } else {
      if (y[0] == 1 && y[1] == 1) {
        last = !last;
        return last;
      }
      if (y[0] > 0) {
        return (last = 0);
      }
      return (last = 1);
    }
  }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:109:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15860 KB Output is correct
2 Correct 9 ms 908 KB Output is correct
3 Correct 45 ms 15276 KB Output is correct
4 Correct 69 ms 16936 KB Output is correct
5 Correct 67 ms 16908 KB Output is correct
6 Correct 54 ms 15612 KB Output is correct
7 Correct 53 ms 15744 KB Output is correct
8 Correct 63 ms 16600 KB Output is correct
9 Correct 63 ms 16440 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15860 KB Output is correct
2 Correct 9 ms 908 KB Output is correct
3 Correct 45 ms 15276 KB Output is correct
4 Correct 69 ms 16936 KB Output is correct
5 Correct 67 ms 16908 KB Output is correct
6 Correct 54 ms 15612 KB Output is correct
7 Correct 53 ms 15744 KB Output is correct
8 Correct 63 ms 16600 KB Output is correct
9 Correct 63 ms 16440 KB Output is correct
10 Correct 51 ms 13916 KB Output is correct
11 Correct 56 ms 13908 KB Output is correct
12 Correct 50 ms 13924 KB Output is correct
13 Correct 50 ms 13780 KB Output is correct
14 Correct 52 ms 14064 KB Output is correct
15 Correct 56 ms 14460 KB Output is correct
16 Correct 61 ms 16452 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13592 KB Output is correct
2 Correct 8 ms 780 KB Output is correct
3 Correct 45 ms 13072 KB Output is correct
4 Correct 64 ms 14708 KB Output is correct
5 Correct 63 ms 14800 KB Output is correct
6 Correct 52 ms 13308 KB Output is correct
7 Correct 51 ms 13436 KB Output is correct
8 Correct 57 ms 14132 KB Output is correct
9 Correct 61 ms 14276 KB Output is correct
10 Correct 67 ms 14144 KB Output is correct
11 Correct 60 ms 14012 KB Output is correct
12 Correct 56 ms 14020 KB Output is correct
13 Correct 54 ms 14024 KB Output is correct
14 Correct 66 ms 14120 KB Output is correct
15 Correct 60 ms 14248 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13592 KB Output is correct
2 Correct 8 ms 780 KB Output is correct
3 Correct 45 ms 13072 KB Output is correct
4 Correct 64 ms 14708 KB Output is correct
5 Correct 63 ms 14800 KB Output is correct
6 Correct 52 ms 13308 KB Output is correct
7 Correct 51 ms 13436 KB Output is correct
8 Correct 57 ms 14132 KB Output is correct
9 Correct 61 ms 14276 KB Output is correct
10 Correct 67 ms 14144 KB Output is correct
11 Correct 60 ms 14012 KB Output is correct
12 Correct 56 ms 14020 KB Output is correct
13 Correct 54 ms 14024 KB Output is correct
14 Correct 66 ms 14120 KB Output is correct
15 Correct 60 ms 14248 KB Output is correct
16 Correct 47 ms 11896 KB Output is correct
17 Correct 49 ms 11920 KB Output is correct
18 Correct 49 ms 12000 KB Output is correct
19 Correct 49 ms 11980 KB Output is correct
20 Correct 56 ms 12776 KB Output is correct
21 Correct 52 ms 12368 KB Output is correct
22 Correct 57 ms 14268 KB Output is correct
23 Correct 55 ms 12164 KB Output is correct
24 Correct 50 ms 12112 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1112 KB Output is correct
2 Correct 8 ms 772 KB Output is correct
3 Correct 10 ms 1124 KB Output is correct
4 Correct 10 ms 1124 KB Output is correct
5 Correct 10 ms 1116 KB Output is correct
6 Correct 10 ms 1096 KB Output is correct
7 Correct 11 ms 1244 KB Output is correct
8 Correct 10 ms 1120 KB Output is correct
9 Correct 10 ms 1128 KB Output is correct
10 Correct 10 ms 1132 KB Output is correct
11 Correct 11 ms 1096 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 10 ms 1128 KB Output is correct
14 Correct 10 ms 1124 KB Output is correct
15 Correct 10 ms 1124 KB Output is correct
16 Correct 10 ms 1124 KB Output is correct
17 Correct 10 ms 1036 KB Output is correct
18 Correct 10 ms 1124 KB Output is correct
19 Correct 10 ms 1224 KB Output is correct
20 Correct 10 ms 1120 KB Output is correct
21 Correct 10 ms 1116 KB Output is correct
22 Correct 10 ms 1128 KB Output is correct
23 Correct 10 ms 1036 KB Output is correct
24 Correct 10 ms 1100 KB Output is correct
25 Correct 10 ms 1120 KB Output is correct
26 Correct 10 ms 1116 KB Output is correct
27 Correct 10 ms 1124 KB Output is correct
28 Correct 10 ms 1096 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 11940 KB Output is correct
2 Correct 54 ms 12532 KB Output is correct
3 Correct 9 ms 792 KB Output is correct
4 Correct 44 ms 11880 KB Output is correct
5 Correct 61 ms 12972 KB Output is correct
6 Correct 61 ms 12844 KB Output is correct
7 Correct 53 ms 12068 KB Output is correct
8 Correct 50 ms 12076 KB Output is correct
9 Correct 63 ms 12832 KB Output is correct
10 Correct 62 ms 12972 KB Output is correct
11 Correct 61 ms 12836 KB Output is correct
12 Correct 61 ms 12836 KB Output is correct
13 Correct 61 ms 12976 KB Output is correct
14 Correct 61 ms 12848 KB Output is correct
15 Correct 59 ms 12924 KB Output is correct
16 Correct 62 ms 12924 KB Output is correct
17 Correct 56 ms 12560 KB Output is correct
18 Correct 55 ms 12692 KB Output is correct
19 Correct 55 ms 12584 KB Output is correct
20 Correct 59 ms 12740 KB Output is correct
21 Correct 56 ms 12428 KB Output is correct
22 Correct 59 ms 12592 KB Output is correct
23 Correct 49 ms 11944 KB Output is correct
24 Correct 52 ms 11956 KB Output is correct
25 Correct 50 ms 12140 KB Output is correct
26 Correct 52 ms 12156 KB Output is correct
27 Correct 57 ms 12412 KB Output is correct
28 Correct 54 ms 12420 KB Output is correct
29 Correct 57 ms 12552 KB Output is correct
30 Correct 55 ms 12628 KB Output is correct
31 Correct 52 ms 12108 KB Output is correct
32 Correct 49 ms 12096 KB Output is correct
33 Correct 53 ms 12028 KB Output is correct
34 Correct 50 ms 11972 KB Output is correct
35 Correct 54 ms 12664 KB Output is correct
36 Correct 71 ms 12792 KB Output is correct
37 Correct 62 ms 13144 KB Output is correct
38 Correct 54 ms 13000 KB Output is correct
39 Correct 57 ms 12900 KB Output is correct
40 Correct 55 ms 12896 KB Output is correct
41 Correct 65 ms 13492 KB Output is correct
42 Correct 56 ms 13088 KB Output is correct
43 Correct 56 ms 13236 KB Output is correct
44 Correct 56 ms 13228 KB Output is correct
45 Correct 59 ms 13116 KB Output is correct
46 Correct 57 ms 13232 KB Output is correct
47 Correct 54 ms 12748 KB Output is correct
48 Correct 53 ms 12764 KB Output is correct
49 Correct 59 ms 12652 KB Output is correct
50 Correct 53 ms 12880 KB Output is correct
51 Correct 49 ms 12596 KB Output is correct
52 Correct 51 ms 12600 KB Output is correct
53 Correct 54 ms 12620 KB Output is correct
54 Correct 50 ms 12600 KB Output is correct
55 Correct 52 ms 12600 KB Output is correct
56 Correct 50 ms 12604 KB Output is correct
57 Correct 51 ms 12528 KB Output is correct
58 Correct 49 ms 12632 KB Output is correct
59 Correct 50 ms 12416 KB Output is correct
60 Correct 50 ms 12436 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 11920 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -