oj.uz

Submission #220269

# Submission time Handle Problem Language Result Execution time Memory
220269 2020-04-07T13:25:03 Z WLZ Stray Cat (JOI20_stray) C++14
15 / 100
 71 ms 17472 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();
      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;
}

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 (y[0] > 1) {
      start = 0;
      return 1;
    } else if (y[1] > 1) {
      start = 0;
      return 0;
    }
    if (start && !cur.empty() && y[0] > 0 && y[1] > 0) {
      start = 0;
      return !cur.back();
    }
    int leaf = 1;
    for (int i = 0; i < 2; i++) {
      if (y[i] > 0) {
        leaf = 0;
        if (!start) {
          return i;
        }
        if (cur.empty()) {
          cur.push_back(!i);
        }
        cur.push_back(i);
        break;
      }
    }
    if (leaf) {
      start = 0;
      return -1;
    }
    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 (cur[j] != period[(i + j) % 6]) {
            match = 0;
            break;
          }
        }
        if (match) {
          rev = 1;
          cur.pop_back();
          cur.pop_back();
        }
      }
    } else {
      return cur.back();
    }
    if (rev) {
      cur.pop_back();
      if (cur.empty()) {
        rev = 0;
      }
      return -1;
    }
  }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:85: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 59 ms 16396 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 46 ms 15756 KB Output is correct
4 Correct 67 ms 17468 KB Output is correct
5 Correct 71 ms 17472 KB Output is correct
6 Correct 64 ms 16200 KB Output is correct
7 Correct 58 ms 16104 KB Output is correct
8 Correct 66 ms 16724 KB Output is correct
9 Correct 63 ms 16948 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 16396 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 46 ms 15756 KB Output is correct
4 Correct 67 ms 17468 KB Output is correct
5 Correct 71 ms 17472 KB Output is correct
6 Correct 64 ms 16200 KB Output is correct
7 Correct 58 ms 16104 KB Output is correct
8 Correct 66 ms 16724 KB Output is correct
9 Correct 63 ms 16948 KB Output is correct
10 Correct 53 ms 14168 KB Output is correct
11 Correct 50 ms 14152 KB Output is correct
12 Correct 52 ms 14184 KB Output is correct
13 Correct 50 ms 14268 KB Output is correct
14 Correct 52 ms 14460 KB Output is correct
15 Correct 56 ms 14828 KB Output is correct
16 Correct 61 ms 16972 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13940 KB Output is correct
2 Correct 9 ms 780 KB Output is correct
3 Correct 46 ms 13556 KB Output is correct
4 Correct 66 ms 15180 KB Output is correct
5 Correct 66 ms 15296 KB Output is correct
6 Correct 52 ms 13972 KB Output is correct
7 Correct 59 ms 13940 KB Output is correct
8 Correct 60 ms 14600 KB Output is correct
9 Correct 60 ms 14660 KB Output is correct
10 Correct 56 ms 14532 KB Output is correct
11 Correct 56 ms 14532 KB Output is correct
12 Correct 56 ms 14420 KB Output is correct
13 Correct 57 ms 14532 KB Output is correct
14 Correct 59 ms 14668 KB Output is correct
15 Correct 66 ms 14792 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13940 KB Output is correct
2 Correct 9 ms 780 KB Output is correct
3 Correct 46 ms 13556 KB Output is correct
4 Correct 66 ms 15180 KB Output is correct
5 Correct 66 ms 15296 KB Output is correct
6 Correct 52 ms 13972 KB Output is correct
7 Correct 59 ms 13940 KB Output is correct
8 Correct 60 ms 14600 KB Output is correct
9 Correct 60 ms 14660 KB Output is correct
10 Correct 56 ms 14532 KB Output is correct
11 Correct 56 ms 14532 KB Output is correct
12 Correct 56 ms 14420 KB Output is correct
13 Correct 57 ms 14532 KB Output is correct
14 Correct 59 ms 14668 KB Output is correct
15 Correct 66 ms 14792 KB Output is correct
16 Correct 46 ms 12412 KB Output is correct
17 Correct 46 ms 12452 KB Output is correct
18 Correct 56 ms 12256 KB Output is correct
19 Correct 49 ms 12256 KB Output is correct
20 Correct 59 ms 12884 KB Output is correct
21 Correct 52 ms 12660 KB Output is correct
22 Correct 64 ms 14796 KB Output is correct
23 Correct 51 ms 12380 KB Output is correct
24 Correct 54 ms 12396 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1092 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 12312 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -