oj.uz

Submission #259476

# Submission time Handle Problem Language Result Execution time Memory
259476 2020-08-07T22:00:08 Z Bruteforceman Stray Cat (JOI20_stray) C++17
15 / 100
 66 ms 16976 KB 
#include "bits/stdc++.h"
#include "Anthony.h"
using namespace std;

namespace {
  const int maxn = 2e4 + 10;
  const int t[] = {1, 0, 0, 1, 1, 0};
  const int len = 6;
  int l[maxn], r[maxn];
  int dist[maxn];
  vector <int> g[maxn];
  int mark[maxn];

  void dfs(int x, int par, int idx) {
    int child = 0;
    for(auto e : g[x]) {
      if(e != par) {
        child += 1; 
      }
    }
    if(child == 1 && idx == -1) {
      for(idx = 0; idx < len; idx++) {
        if(t[idx] == mark[x]) {
          break;
        }
      }
    }
    for(auto e : g[x]) {
      int i = l[e] ^ r[e] ^ x; 
      if(e != par) {
        if(child == 1) {
          mark[e] = t[(idx + 1) % len];
          dfs(i, e, (idx + 1) % len);
        } else {
          mark[e] = mark[par] ^ 1;
          dfs(i, e, -1);
        }
      }
    }
  }
}  // namespace

std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  std::vector<int> X(M);
  for (int i = 0; i < N; i++) g[i].clear();
  for (int i = 0; i < M; ++i) {
    l[i] = U[i];
    r[i] = V[i];
    g[l[i]].push_back(i);
    g[r[i]].push_back(i);
  }
  if(A > 2) {
    for(int i = 0; i < N; i++) dist[i] = -1;
    queue <int> Q;
    Q.push(0);
    dist[0] = 0;
    while(!Q.empty()) {
      int x = Q.front();
      Q.pop();
      for(int e : g[x]) {
        int i = l[e] ^ r[e] ^ x;
        if(dist[i] == -1) {
          dist[i] = 1 + dist[x];
          Q.push(i);
        }
      }
    }
    for(int i = 0; i < M; i++) {
      if(dist[l[i]] == dist[r[i]]) X[i] = dist[l[i]] % 3;
      else X[i] = min(dist[l[i]], dist[r[i]]) % 3;
    }
    return X;
  }
  mark[M] = 0;
  dfs(0, M, -1);
  for(int i = 0; i < M; i++) X[i] = mark[i];
  return X;
}

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

namespace {
const int len = 6;
const int t[len] = {1, 0, 0, 1, 1, 0};
int arr[len];
int idx = -1;

int A, B;
int variable_example = 0;
vector <int> unpack(vector <int> y) {
  vector <int> v;
  for(int i = 0; i < y.size(); i++) {
    while(y[i]--) v.push_back(i);
  }
  return v;
}
bool check() {
  for(int i = 0; i < len; i++) {
    bool bad = false;
    for(int j = 0; j < len; j++) {
      if(t[(i + j) % len] != arr[j]) bad = true;
    }
    if(not bad) return true;
  }
  return false;
}
int last = -1;
}  // namespace

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

int Move(std::vector<int> y) {
  if(A > 2) {
    for(int i = 0; i < 3; i++) {
      if(y[i] > 0 && y[(2 + i) % 3] == 0) return i;
    }
  }
  ++variable_example;
  vector <int> v = unpack(y);
  if(variable_example == 1 && v.size() == 2) {
    idx = 1; 
    arr[idx - 1] = v[0];
    arr[idx] = v[1];
    return last = v[1];
  }
  if(idx != -1) {
    if(v.size() == 1) {
      arr[idx + 1] = v[0];
      idx += 1;
      if(idx == len - 2) {
        idx = -1;
        if(check()) return -1;
        else return last = v[0];
      } else {
        return last = v[0];
      }
    } else {
      idx = -1;
      if(y[0] == 0 || y[1] == 0) return -1;
      else return last = last ^ 1;
    }
  }
  if(v.size() == 1) return last = v[0];
  else if(last == -1) {
    for(int i = 0; i < y.size(); i++) if(y[i] == 1) return last = i;
  }
  else return last = last ^ 1;
}

Compilation message

Catherine.cpp: In function 'std::vector<int> {anonymous}::unpack(std::vector<int>)':
Catherine.cpp:15:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < y.size(); i++) {
                  ~~^~~~~~~~~~
Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:71:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < y.size(); i++) if(y[i] == 1) return last = i;
                    ~~^~~~~~~~~~
Catherine.cpp:74: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 52 ms 15812 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 40 ms 14968 KB Output is correct
4 Correct 62 ms 16968 KB Output is correct
5 Correct 62 ms 16976 KB Output is correct
6 Correct 51 ms 15532 KB Output is correct
7 Correct 47 ms 15484 KB Output is correct
8 Correct 56 ms 16324 KB Output is correct
9 Correct 57 ms 16324 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 15812 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 40 ms 14968 KB Output is correct
4 Correct 62 ms 16968 KB Output is correct
5 Correct 62 ms 16976 KB Output is correct
6 Correct 51 ms 15532 KB Output is correct
7 Correct 47 ms 15484 KB Output is correct
8 Correct 56 ms 16324 KB Output is correct
9 Correct 57 ms 16324 KB Output is correct
10 Correct 45 ms 13564 KB Output is correct
11 Correct 44 ms 13432 KB Output is correct
12 Correct 45 ms 13560 KB Output is correct
13 Correct 44 ms 13560 KB Output is correct
14 Correct 45 ms 13688 KB Output is correct
15 Correct 53 ms 14188 KB Output is correct
16 Correct 53 ms 16384 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13376 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 38 ms 12796 KB Output is correct
4 Correct 57 ms 14804 KB Output is correct
5 Correct 66 ms 14868 KB Output is correct
6 Correct 45 ms 13368 KB Output is correct
7 Correct 45 ms 13180 KB Output is correct
8 Correct 56 ms 14036 KB Output is correct
9 Correct 54 ms 13948 KB Output is correct
10 Correct 51 ms 13692 KB Output is correct
11 Correct 53 ms 13892 KB Output is correct
12 Correct 63 ms 13896 KB Output is correct
13 Correct 51 ms 13692 KB Output is correct
14 Correct 56 ms 14148 KB Output is correct
15 Correct 56 ms 14076 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13376 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 38 ms 12796 KB Output is correct
4 Correct 57 ms 14804 KB Output is correct
5 Correct 66 ms 14868 KB Output is correct
6 Correct 45 ms 13368 KB Output is correct
7 Correct 45 ms 13180 KB Output is correct
8 Correct 56 ms 14036 KB Output is correct
9 Correct 54 ms 13948 KB Output is correct
10 Correct 51 ms 13692 KB Output is correct
11 Correct 53 ms 13892 KB Output is correct
12 Correct 63 ms 13896 KB Output is correct
13 Correct 51 ms 13692 KB Output is correct
14 Correct 56 ms 14148 KB Output is correct
15 Correct 56 ms 14076 KB Output is correct
16 Correct 40 ms 11768 KB Output is correct
17 Correct 43 ms 11640 KB Output is correct
18 Correct 43 ms 11788 KB Output is correct
19 Correct 43 ms 11668 KB Output is correct
20 Correct 50 ms 12340 KB Output is correct
21 Correct 48 ms 12260 KB Output is correct
22 Correct 60 ms 14424 KB Output is correct
23 Correct 44 ms 11804 KB Output is correct
24 Correct 45 ms 11800 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1792 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 3 ms 1792 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 2 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 2 ms 1792 KB Output is correct
14 Incorrect 2 ms 1792 KB Wrong Answer [5]
15 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11416 KB Output is correct
2 Correct 48 ms 12668 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 36 ms 11380 KB Output is correct
5 Correct 57 ms 14268 KB Output is correct
6 Correct 59 ms 14384 KB Output is correct
7 Correct 44 ms 13492 KB Output is correct
8 Correct 45 ms 13496 KB Output is correct
9 Correct 58 ms 14196 KB Output is correct
10 Correct 55 ms 14196 KB Output is correct
11 Correct 57 ms 14268 KB Output is correct
12 Correct 63 ms 14204 KB Output is correct
13 Correct 58 ms 14264 KB Output is correct
14 Correct 57 ms 14324 KB Output is correct
15 Correct 56 ms 14204 KB Output is correct
16 Correct 58 ms 14320 KB Output is correct
17 Correct 55 ms 13972 KB Output is correct
18 Incorrect 56 ms 13668 KB Wrong Answer [5]
19 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11264 KB Output is correct
2 Correct 55 ms 12524 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 37 ms 11268 KB Output is correct
5 Correct 64 ms 14388 KB Output is correct
6 Correct 61 ms 14256 KB Output is correct
7 Correct 47 ms 13372 KB Output is correct
8 Correct 46 ms 13496 KB Output is correct
9 Correct 61 ms 14268 KB Output is correct
10 Correct 56 ms 14268 KB Output is correct
11 Correct 58 ms 14392 KB Output is correct
12 Correct 63 ms 14388 KB Output is correct
13 Correct 63 ms 14196 KB Output is correct
14 Correct 59 ms 14388 KB Output is correct
15 Correct 57 ms 14384 KB Output is correct
16 Correct 59 ms 14384 KB Output is correct
17 Correct 53 ms 14420 KB Output is correct
18 Incorrect 46 ms 14200 KB Wrong Answer [5]
19 Halted 0 ms 0 KB -