oj.uz

답안 #259474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259474 2020-08-07T21:56:47 Z Bruteforceman 길고양이 (JOI20_stray) C++17
15 / 100
 68 ms 16980 KB 
#include "bits/stdc++.h"
#include "Anthony.h"
using namespace std;

namespace {
  const int maxn = 2e4 + 10;
  const int t[] = {1, 0, 1, 1, 0};
  const int len = 5;
  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 = 5;
const int t[len] = {1, 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 - 1) {
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 15808 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 40 ms 15152 KB Output is correct
4 Correct 61 ms 16980 KB Output is correct
5 Correct 61 ms 16756 KB Output is correct
6 Correct 47 ms 15612 KB Output is correct
7 Correct 49 ms 15524 KB Output is correct
8 Correct 55 ms 16328 KB Output is correct
9 Correct 55 ms 16244 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 15808 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 40 ms 15152 KB Output is correct
4 Correct 61 ms 16980 KB Output is correct
5 Correct 61 ms 16756 KB Output is correct
6 Correct 47 ms 15612 KB Output is correct
7 Correct 49 ms 15524 KB Output is correct
8 Correct 55 ms 16328 KB Output is correct
9 Correct 55 ms 16244 KB Output is correct
10 Correct 44 ms 13432 KB Output is correct
11 Correct 46 ms 13540 KB Output is correct
12 Correct 44 ms 13588 KB Output is correct
13 Correct 47 ms 13576 KB Output is correct
14 Correct 46 ms 13688 KB Output is correct
15 Correct 54 ms 14192 KB Output is correct
16 Correct 55 ms 16372 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 13384 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 47 ms 12924 KB Output is correct
4 Correct 68 ms 14712 KB Output is correct
5 Correct 62 ms 14792 KB Output is correct
6 Correct 50 ms 13352 KB Output is correct
7 Correct 52 ms 13368 KB Output is correct
8 Correct 53 ms 14144 KB Output is correct
9 Correct 54 ms 14324 KB Output is correct
10 Correct 50 ms 13684 KB Output is correct
11 Correct 49 ms 13900 KB Output is correct
12 Correct 53 ms 13896 KB Output is correct
13 Correct 50 ms 13684 KB Output is correct
14 Correct 53 ms 14076 KB Output is correct
15 Correct 54 ms 14160 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 13384 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 47 ms 12924 KB Output is correct
4 Correct 68 ms 14712 KB Output is correct
5 Correct 62 ms 14792 KB Output is correct
6 Correct 50 ms 13352 KB Output is correct
7 Correct 52 ms 13368 KB Output is correct
8 Correct 53 ms 14144 KB Output is correct
9 Correct 54 ms 14324 KB Output is correct
10 Correct 50 ms 13684 KB Output is correct
11 Correct 49 ms 13900 KB Output is correct
12 Correct 53 ms 13896 KB Output is correct
13 Correct 50 ms 13684 KB Output is correct
14 Correct 53 ms 14076 KB Output is correct
15 Correct 54 ms 14160 KB Output is correct
16 Correct 40 ms 11928 KB Output is correct
17 Correct 40 ms 11640 KB Output is correct
18 Correct 43 ms 11640 KB Output is correct
19 Correct 52 ms 11632 KB Output is correct
20 Correct 48 ms 12284 KB Output is correct
21 Correct 53 ms 12328 KB Output is correct
22 Correct 53 ms 14248 KB Output is correct
23 Correct 45 ms 11800 KB Output is correct
24 Correct 44 ms 11792 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 Incorrect 2 ms 1792 KB Wrong Answer [5]
8 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 11388 KB Output is correct
2 Correct 50 ms 12736 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 36 ms 11256 KB Output is correct
5 Correct 57 ms 14452 KB Output is correct
6 Correct 63 ms 14500 KB Output is correct
7 Correct 46 ms 13432 KB Output is correct
8 Incorrect 43 ms 13620 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 11420 KB Output is correct
2 Correct 52 ms 12600 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 42 ms 11272 KB Output is correct
5 Correct 58 ms 14324 KB Output is correct
6 Incorrect 43 ms 13504 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -