oj.uz

Submission #220367

# Submission time Handle Problem Language Result Execution time Memory
220367 2020-04-07T18:35:13 Z WLZ Stray Cat (JOI20_stray) C++14
20 / 100
 73 ms 17012 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 (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 16116 KB Output is correct
2 Correct 8 ms 792 KB Output is correct
3 Correct 47 ms 15236 KB Output is correct
4 Correct 73 ms 17012 KB Output is correct
5 Correct 66 ms 16972 KB Output is correct
6 Correct 61 ms 15624 KB Output is correct
7 Correct 54 ms 15856 KB Output is correct
8 Correct 64 ms 16376 KB Output is correct
9 Correct 62 ms 16380 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 16116 KB Output is correct
2 Correct 8 ms 792 KB Output is correct
3 Correct 47 ms 15236 KB Output is correct
4 Correct 73 ms 17012 KB Output is correct
5 Correct 66 ms 16972 KB Output is correct
6 Correct 61 ms 15624 KB Output is correct
7 Correct 54 ms 15856 KB Output is correct
8 Correct 64 ms 16376 KB Output is correct
9 Correct 62 ms 16380 KB Output is correct
10 Correct 51 ms 13900 KB Output is correct
11 Correct 53 ms 13904 KB Output is correct
12 Correct 51 ms 13816 KB Output is correct
13 Correct 53 ms 13772 KB Output is correct
14 Correct 51 ms 14192 KB Output is correct
15 Correct 56 ms 14328 KB Output is correct
16 Correct 61 ms 16460 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13588 KB Output is correct
2 Correct 8 ms 788 KB Output is correct
3 Correct 45 ms 13076 KB Output is correct
4 Correct 63 ms 14780 KB Output is correct
5 Correct 63 ms 14800 KB Output is correct
6 Correct 56 ms 13436 KB Output is correct
7 Correct 54 ms 13436 KB Output is correct
8 Correct 57 ms 14196 KB Output is correct
9 Correct 57 ms 14272 KB Output is correct
10 Correct 55 ms 13944 KB Output is correct
11 Correct 54 ms 13864 KB Output is correct
12 Correct 54 ms 14032 KB Output is correct
13 Correct 55 ms 14024 KB Output is correct
14 Correct 70 ms 14400 KB Output is correct
15 Correct 63 ms 14196 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13588 KB Output is correct
2 Correct 8 ms 788 KB Output is correct
3 Correct 45 ms 13076 KB Output is correct
4 Correct 63 ms 14780 KB Output is correct
5 Correct 63 ms 14800 KB Output is correct
6 Correct 56 ms 13436 KB Output is correct
7 Correct 54 ms 13436 KB Output is correct
8 Correct 57 ms 14196 KB Output is correct
9 Correct 57 ms 14272 KB Output is correct
10 Correct 55 ms 13944 KB Output is correct
11 Correct 54 ms 13864 KB Output is correct
12 Correct 54 ms 14032 KB Output is correct
13 Correct 55 ms 14024 KB Output is correct
14 Correct 70 ms 14400 KB Output is correct
15 Correct 63 ms 14196 KB Output is correct
16 Correct 47 ms 11924 KB Output is correct
17 Correct 48 ms 11928 KB Output is correct
18 Correct 48 ms 11996 KB Output is correct
19 Correct 50 ms 11896 KB Output is correct
20 Correct 55 ms 12620 KB Output is correct
21 Correct 51 ms 12172 KB Output is correct
22 Correct 55 ms 14276 KB Output is correct
23 Correct 50 ms 12132 KB Output is correct
24 Correct 50 ms 12140 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1252 KB Output is correct
2 Correct 8 ms 792 KB Output is correct
3 Correct 10 ms 1116 KB Output is correct
4 Correct 10 ms 1036 KB Output is correct
5 Correct 10 ms 1104 KB Output is correct
6 Correct 10 ms 1224 KB Output is correct
7 Correct 10 ms 1104 KB Output is correct
8 Correct 10 ms 1120 KB Output is correct
9 Correct 10 ms 1108 KB Output is correct
10 Correct 10 ms 1124 KB Output is correct
11 Correct 10 ms 1228 KB Output is correct
12 Correct 10 ms 1248 KB Output is correct
13 Correct 10 ms 1152 KB Output is correct
14 Correct 10 ms 1120 KB Output is correct
15 Correct 10 ms 1100 KB Output is correct
16 Correct 12 ms 1240 KB Output is correct
17 Correct 10 ms 1124 KB Output is correct
18 Correct 10 ms 1116 KB Output is correct
19 Correct 10 ms 1104 KB Output is correct
20 Correct 11 ms 1040 KB Output is correct
21 Correct 11 ms 1120 KB Output is correct
22 Correct 10 ms 1092 KB Output is correct
23 Correct 10 ms 1256 KB Output is correct
24 Correct 10 ms 1092 KB Output is correct
25 Correct 10 ms 1112 KB Output is correct
26 Correct 11 ms 1116 KB Output is correct
27 Correct 10 ms 1040 KB Output is correct
28 Correct 10 ms 1040 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 11824 KB Output is correct
2 Correct 55 ms 12404 KB Output is correct
3 Correct 8 ms 780 KB Output is correct
4 Correct 45 ms 12048 KB Output is correct
5 Correct 65 ms 12796 KB Output is correct
6 Correct 63 ms 12828 KB Output is correct
7 Correct 50 ms 12584 KB Output is correct
8 Correct 50 ms 12460 KB Output is correct
9 Correct 59 ms 13328 KB Output is correct
10 Correct 60 ms 13480 KB Output is correct
11 Correct 60 ms 13388 KB Output is correct
12 Correct 62 ms 13496 KB Output is correct
13 Correct 64 ms 13308 KB Output is correct
14 Correct 62 ms 13364 KB Output is correct
15 Correct 61 ms 13352 KB Output is correct
16 Correct 61 ms 13356 KB Output is correct
17 Correct 56 ms 13004 KB Output is correct
18 Correct 60 ms 13060 KB Output is correct
19 Correct 56 ms 13092 KB Output is correct
20 Correct 57 ms 13096 KB Output is correct
21 Correct 57 ms 13060 KB Output is correct
22 Correct 59 ms 13104 KB Output is correct
23 Correct 49 ms 12336 KB Output is correct
24 Correct 49 ms 12336 KB Output is correct
25 Correct 50 ms 12388 KB Output is correct
26 Correct 51 ms 12376 KB Output is correct
27 Correct 57 ms 12788 KB Output is correct
28 Correct 55 ms 12792 KB Output is correct
29 Correct 56 ms 12796 KB Output is correct
30 Correct 56 ms 12756 KB Output is correct
31 Correct 49 ms 12480 KB Output is correct
32 Correct 49 ms 12380 KB Output is correct
33 Correct 50 ms 12248 KB Output is correct
34 Correct 50 ms 12352 KB Output is correct
35 Incorrect 52 ms 12784 KB Wrong Answer [6]
36 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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