oj.uz

답안 #259468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259468 2020-08-07T21:50:44 Z Bruteforceman 길고양이 (JOI20_stray) C++17
87 / 100
 65 ms 16572 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 == 3) {
    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];
  for(int i = 0; i < M; i++) {
    // cout << U[i] << ' ' << V[i] << ' ' << X[i] << endl;
  }
  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 == 3) {
    for(int i = 0; i < y.size(); 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:40:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < y.size(); i++) {
                    ~~^~~~~~~~~~
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
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 16572 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 16572 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 13640 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 53 ms 13112 KB Output is correct
4 Correct 64 ms 15052 KB Output is correct
5 Correct 63 ms 15052 KB Output is correct
6 Correct 47 ms 13852 KB Output is correct
7 Correct 46 ms 13772 KB Output is correct
8 Correct 55 ms 14676 KB Output is correct
9 Correct 57 ms 14548 KB Output is correct
10 Correct 50 ms 14292 KB Output is correct
11 Correct 62 ms 14400 KB Output is correct
12 Correct 51 ms 14400 KB Output is correct
13 Correct 61 ms 14404 KB Output is correct
14 Correct 58 ms 14664 KB Output is correct
15 Correct 57 ms 14656 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 13640 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 53 ms 13112 KB Output is correct
4 Correct 64 ms 15052 KB Output is correct
5 Correct 63 ms 15052 KB Output is correct
6 Correct 47 ms 13852 KB Output is correct
7 Correct 46 ms 13772 KB Output is correct
8 Correct 55 ms 14676 KB Output is correct
9 Correct 57 ms 14548 KB Output is correct
10 Correct 50 ms 14292 KB Output is correct
11 Correct 62 ms 14400 KB Output is correct
12 Correct 51 ms 14400 KB Output is correct
13 Correct 61 ms 14404 KB Output is correct
14 Correct 58 ms 14664 KB Output is correct
15 Correct 57 ms 14656 KB Output is correct
16 Correct 41 ms 12352 KB Output is correct
17 Correct 50 ms 12100 KB Output is correct
18 Correct 43 ms 12176 KB Output is correct
19 Correct 43 ms 12196 KB Output is correct
20 Correct 50 ms 12844 KB Output is correct
21 Correct 48 ms 12492 KB Output is correct
22 Correct 53 ms 14800 KB Output is correct
23 Correct 44 ms 12312 KB Output is correct
24 Correct 44 ms 12228 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 2 ms 1792 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 3 ms 1792 KB Output is correct
10 Correct 2 ms 1792 KB Output is correct
11 Correct 3 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 Correct 3 ms 1792 KB Output is correct
15 Correct 3 ms 1792 KB Output is correct
16 Correct 2 ms 1792 KB Output is correct
17 Correct 2 ms 1792 KB Output is correct
18 Correct 2 ms 1792 KB Output is correct
19 Correct 2 ms 1792 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 2 ms 1792 KB Output is correct
23 Correct 2 ms 1792 KB Output is correct
24 Correct 2 ms 1792 KB Output is correct
25 Correct 2 ms 1792 KB Output is correct
26 Correct 2 ms 1792 KB Output is correct
27 Correct 2 ms 1792 KB Output is correct
28 Correct 2 ms 1792 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 11488 KB Output is correct
2 Correct 54 ms 12984 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 39 ms 11364 KB Output is correct
5 Correct 60 ms 14904 KB Output is correct
6 Correct 59 ms 14892 KB Output is correct
7 Correct 48 ms 14016 KB Output is correct
8 Correct 46 ms 13900 KB Output is correct
9 Correct 61 ms 14668 KB Output is correct
10 Correct 58 ms 14760 KB Output is correct
11 Correct 57 ms 14664 KB Output is correct
12 Correct 58 ms 14732 KB Output is correct
13 Correct 56 ms 14796 KB Output is correct
14 Correct 56 ms 14668 KB Output is correct
15 Correct 60 ms 14892 KB Output is correct
16 Correct 57 ms 14784 KB Output is correct
17 Correct 54 ms 14420 KB Output is correct
18 Correct 54 ms 14528 KB Output is correct
19 Correct 57 ms 14516 KB Output is correct
20 Correct 57 ms 14532 KB Output is correct
21 Correct 53 ms 14524 KB Output is correct
22 Correct 53 ms 14524 KB Output is correct
23 Correct 44 ms 12204 KB Output is correct
24 Correct 43 ms 11860 KB Output is correct
25 Correct 45 ms 12416 KB Output is correct
26 Correct 44 ms 12532 KB Output is correct
27 Correct 51 ms 13132 KB Output is correct
28 Correct 51 ms 13644 KB Output is correct
29 Correct 50 ms 13344 KB Output is correct
30 Correct 51 ms 13352 KB Output is correct
31 Correct 45 ms 11988 KB Output is correct
32 Correct 45 ms 11860 KB Output is correct
33 Correct 45 ms 12264 KB Output is correct
34 Correct 43 ms 12240 KB Output is correct
35 Correct 51 ms 13056 KB Output is correct
36 Correct 53 ms 13056 KB Output is correct
37 Correct 52 ms 13052 KB Output is correct
38 Correct 57 ms 13052 KB Output is correct
39 Correct 50 ms 13184 KB Output is correct
40 Correct 51 ms 13056 KB Output is correct
41 Correct 54 ms 13840 KB Output is correct
42 Correct 53 ms 13860 KB Output is correct
43 Correct 57 ms 13816 KB Output is correct
44 Correct 54 ms 13836 KB Output is correct
45 Correct 59 ms 13824 KB Output is correct
46 Correct 65 ms 13844 KB Output is correct
47 Correct 52 ms 13128 KB Output is correct
48 Correct 49 ms 12884 KB Output is correct
49 Correct 48 ms 12760 KB Output is correct
50 Correct 49 ms 13128 KB Output is correct
51 Correct 45 ms 12236 KB Output is correct
52 Correct 44 ms 12244 KB Output is correct
53 Correct 45 ms 12348 KB Output is correct
54 Correct 46 ms 12364 KB Output is correct
55 Correct 43 ms 12360 KB Output is correct
56 Correct 44 ms 12252 KB Output is correct
57 Correct 43 ms 11988 KB Output is correct
58 Correct 45 ms 12108 KB Output is correct
59 Correct 52 ms 12400 KB Output is correct
60 Correct 45 ms 12368 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 11608 KB Output is correct
2 Correct 48 ms 12708 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 37 ms 11364 KB Output is correct
5 Correct 56 ms 14900 KB Output is correct
6 Correct 55 ms 14792 KB Output is correct
7 Correct 47 ms 13908 KB Output is correct
8 Correct 47 ms 13780 KB Output is correct
9 Correct 55 ms 14916 KB Output is correct
10 Correct 55 ms 14784 KB Output is correct
11 Correct 56 ms 14676 KB Output is correct
12 Correct 56 ms 14788 KB Output is correct
13 Correct 56 ms 14660 KB Output is correct
14 Correct 65 ms 14848 KB Output is correct
15 Correct 57 ms 14908 KB Output is correct
16 Incorrect 54 ms 14768 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -