oj.uz

답안 #955451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955451 2024-03-30T13:13:37 Z abczz 길고양이 (JOI20_stray) C++14
91 / 100
 44 ms 17020 KB 
#include "Anthony.h"
#include <iostream>
#include <vector>
#include <queue>
#include <array>
#define ll long long
using namespace std;

namespace {
  queue <array<ll, 2>> Q;
  bool visited[20000], heavy[20000];
  vector <int> E;
  vector <array<ll, 2>> adj[20000];

  void AmodeA() {
    Q.push({0, 0});
    while (!Q.empty()) {
      auto [u, w] = Q.front();
      Q.pop();
      for (auto [v, x] : adj[u]) {
        if (E[x] == -1) E[x] = w;
        if (!visited[v]) {
          visited[v] = 1;
          Q.push({v, (w+1) % 3});
        }
      }
    }
  }

  void dfs(ll u, ll p) {
    ll chd_cnt = 0;
    for (auto [v, x] : adj[u]) {
      if (v != p) {
        ++chd_cnt;
        dfs(v, u);
      }
    }
    if (chd_cnt != 1 || p == -1) heavy[u] = 1;
  }

  void solve(ll u, ll p, ll w, ll z) {
    for (auto [v, x] : adj[u]) {
      if (v != p) {
        if (heavy[u] && heavy[v]) {
          E[x] = w^1;
          solve(v, u, E[x], 0);
        }
        else if (heavy[u] && !heavy[v]) {
          E[x] = w^1;
          solve(v, u, E[x], 1);
        }
        else {
          if (z == 2 || z == 4 || z == 5) E[x] = w;
          else E[x] = w^1;
          solve(v, u, E[x], (z+1) % 6);
        }
      }
    }
  }

  void AmodeB() {
    dfs(0, -1);
    solve(0, -1, 1, 0);
  }
}

std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  E.resize(M);
  for (int i=0; i<M; ++i) {
    E[i] = -1;
    adj[U[i]].push_back({V[i], i});
    adj[V[i]].push_back({U[i], i});
  }
  if (!B) AmodeA();
  else AmodeB();
  return E;
}
#include "Catherine.h"
#include <iostream>
#include <vector>
#define ll long long
using namespace std;

namespace {
  bool mode;
  vector <ll> V;
  ll p = -1, dir = -1, x = 0, rev = 0, l = 1e18, r = 1e18;
  bool isinitSame;

  int CmodeA(vector <int> y) {
    ll cnt = 0, id;
    for (int i=0; i<3; ++i) {
      if (y[i] > 0) {
        ++cnt;
        id = i;
      }
    }
    if (cnt == 1) return id;
    if (y[0] && y[1]) return 0;
    else if (y[0] && y[2]) return 2;
    else return 1;
  }

  int CmodeB(vector <int> y) {
    if (dir == 1e18) {
      if (!y[0]) return p = 1;
      else if (!y[1]) return p = 0;
      p ^= 1;
      return p;
    }
    else if (dir == -1) {
      if (!y[0] && y[1] == 1) {
        dir = 1e18;
        return p = 1;
      }
      else if (y[0] == 1 && !y[1]) {
        dir = 1e18;
        return p = 0;
      }
      if (y[0] == 1 && y[1] > 1) {
        dir = 1e18;
        return p = 0;
      }
      else if (y[0] > 1 && y[1] == 1) {
        dir = 1e18;
        return p = 1;
      }
      dir = 0;
      if (!y[0] || !y[1]) {
        isinitSame = 1;
        if (y[0]) return p = 0;
        else return p = 1;
      }
      else {
        x = 1;
        return p = 0;
      }
    }
    if (!y[0] && !y[1]) {
      dir = 1e18;
      return -1;
    }
    else if (min(y[0], y[1]) == 0 && max(y[0], y[1]) > 1) {
      dir = 1e18;
      return -1;
    }
    else if (min(y[0], y[1]) >= 1) {
      dir = 1e18;
      p ^= 1;
      return p;
    }
    if (!isinitSame) {
      //cout << l << " " << r << " " << x << " " << rev << endl;
      if (rev) {
        --rev;
        if (y[0]) return p = 0;
        else return p = 1;
      }
      else if (l == 1e18) {
        if (y[0]) {
          if (x == 2) {
            l = 3;
            rev = 1, x = 0;
            return -1;
          }
          else {
            ++x;
            return p = 0;
          }
        }
        else {
          l = x;
          if (x == 2) rev = 1;
          x = 0;
          return -1;
        }
      }
      else if (r == 1e18) {
        if (y[1]) {
          ++x;
          if (x == 1) return p = 1;
          else if (x == 2) {
            if (l >= 2) {
              r = 2;
              return -1;
            }
            else {
              ++x;
              return p = 1;
            }
          }
          else {
            r = 3;
            rev = 1;
            return -1;
          }
        }
        else {
          r = x;
          if (x == 2) rev = 1;
          return -1;
        }
      }
      else {
        if (l == r) ++r;
        if ((l == 1 && r == 2) || (l == 2 && r == 3) || (l == 3 && r == 1)) {
          dir = 1e18;
          p = 0;
          if (y[0]) return 0;
          else return -1;
        }
        else {
          dir = 1e18;
          p = 1;
          if (y[1]) return 1;
          else return -1;
        }
      }
    }
    else {
      if (rev) {
        --rev;
        if (y[0]) return p = 0;
        else return p = 1;
      }
      else if (dir == 0) {
        if ((y[0] && !p) || (y[1] && p)) {
          dir = 1;
          return p;
        }
        else {
          dir = 2;
          if (y[0]) return p = 0;
          else return p = 1;
        }
      }
      else if (dir == 1) {
        if (V.size() == 2) {
          if (V[0] == V[1]) {
            dir = 1e18;
            if (y[0]) return p = 0;
            else return p = 1;
          }
          else {
            dir = -2;
            rev = 2;
            return -1;
          }
        }
        if (y[0]) {
          V.push_back(0);
          return p = 0;
        }
        else {
          V.push_back(1);
          return p = 1;
        }
      }
      else if (dir == 2) {
        if ((y[0] && !p) || (y[1] && p)) {
          dir = 3;
          return p;
        }
        else {
          dir = 4;
          rev = 1;
          return -1;
        }
      }
      else if (dir == 3) {
        if ((y[0] && !p) || (y[1] && p)) {
          dir = -2;
          rev = 2;
          return -1;
        }
        else {
          dir = 1e18;
          if (y[0]) return p = 0;
          else return p = 1;
        }
      }
      else if (dir == 4) {
        dir = 5;
        if (y[0]) return p = 0;
        else return p = 1;
      }
      else if (dir == 5) {
        if ((y[0] && !p) || (y[1] && p)) {
          dir = 1e18;
          if (y[0]) return p = 0;
          else return p = 1;
        }
        else {
          dir = -2;
          return -1;
        }
      }
      else if (dir == -2) {
        dir = 1e18;
        if (y[0]) return p = 0;
        else return p = 1;
      }
    }
    return -2;
  }
}

void Init(int A, int B) {
  if (!B) mode = 0;
  else mode = 1;
}

int Move(std::vector<int> y) {
  if (!mode) return CmodeA(y);
  else return CmodeB(y);
}

Compilation message

Anthony.cpp: In function 'void {anonymous}::AmodeA()':
Anthony.cpp:18:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |       auto [u, w] = Q.front();
      |            ^
Anthony.cpp:20:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |       for (auto [v, x] : adj[u]) {
      |                 ^
Anthony.cpp: In function 'void {anonymous}::dfs(long long int, long long int)':
Anthony.cpp:32:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |     for (auto [v, x] : adj[u]) {
      |               ^
Anthony.cpp: In function 'void {anonymous}::solve(long long int, long long int, long long int, long long int)':
Anthony.cpp:42:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for (auto [v, x] : adj[u]) {
      |               ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16000 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 27 ms 15476 KB Output is correct
4 Correct 36 ms 17016 KB Output is correct
5 Correct 35 ms 17020 KB Output is correct
6 Correct 28 ms 15728 KB Output is correct
7 Correct 28 ms 15732 KB Output is correct
8 Correct 33 ms 16500 KB Output is correct
9 Correct 37 ms 16304 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16000 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 27 ms 15476 KB Output is correct
4 Correct 36 ms 17016 KB Output is correct
5 Correct 35 ms 17020 KB Output is correct
6 Correct 28 ms 15728 KB Output is correct
7 Correct 28 ms 15732 KB Output is correct
8 Correct 33 ms 16500 KB Output is correct
9 Correct 37 ms 16304 KB Output is correct
10 Correct 26 ms 13936 KB Output is correct
11 Correct 27 ms 13948 KB Output is correct
12 Correct 27 ms 13932 KB Output is correct
13 Correct 26 ms 13760 KB Output is correct
14 Correct 27 ms 14192 KB Output is correct
15 Correct 30 ms 14448 KB Output is correct
16 Correct 34 ms 16516 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13440 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 28 ms 12880 KB Output is correct
4 Correct 44 ms 15084 KB Output is correct
5 Correct 34 ms 14932 KB Output is correct
6 Correct 27 ms 13524 KB Output is correct
7 Correct 28 ms 13400 KB Output is correct
8 Correct 31 ms 14196 KB Output is correct
9 Correct 32 ms 14192 KB Output is correct
10 Correct 30 ms 13940 KB Output is correct
11 Correct 30 ms 14196 KB Output is correct
12 Correct 30 ms 13936 KB Output is correct
13 Correct 30 ms 13928 KB Output is correct
14 Correct 32 ms 14204 KB Output is correct
15 Correct 31 ms 14204 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13440 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 28 ms 12880 KB Output is correct
4 Correct 44 ms 15084 KB Output is correct
5 Correct 34 ms 14932 KB Output is correct
6 Correct 27 ms 13524 KB Output is correct
7 Correct 28 ms 13400 KB Output is correct
8 Correct 31 ms 14196 KB Output is correct
9 Correct 32 ms 14192 KB Output is correct
10 Correct 30 ms 13940 KB Output is correct
11 Correct 30 ms 14196 KB Output is correct
12 Correct 30 ms 13936 KB Output is correct
13 Correct 30 ms 13928 KB Output is correct
14 Correct 32 ms 14204 KB Output is correct
15 Correct 31 ms 14204 KB Output is correct
16 Correct 25 ms 11892 KB Output is correct
17 Correct 25 ms 11992 KB Output is correct
18 Correct 30 ms 11888 KB Output is correct
19 Correct 26 ms 11888 KB Output is correct
20 Correct 28 ms 12664 KB Output is correct
21 Correct 27 ms 12416 KB Output is correct
22 Correct 31 ms 14612 KB Output is correct
23 Correct 26 ms 12284 KB Output is correct
24 Correct 26 ms 11968 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1556 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 1 ms 1568 KB Output is correct
4 Correct 2 ms 1560 KB Output is correct
5 Correct 2 ms 1772 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 2 ms 1568 KB Output is correct
9 Correct 2 ms 1568 KB Output is correct
10 Correct 2 ms 1568 KB Output is correct
11 Correct 2 ms 1560 KB Output is correct
12 Correct 2 ms 1568 KB Output is correct
13 Correct 2 ms 1576 KB Output is correct
14 Correct 2 ms 1568 KB Output is correct
15 Correct 2 ms 1564 KB Output is correct
16 Correct 2 ms 1564 KB Output is correct
17 Correct 2 ms 1564 KB Output is correct
18 Correct 2 ms 1556 KB Output is correct
19 Correct 2 ms 1572 KB Output is correct
20 Correct 1 ms 1556 KB Output is correct
21 Correct 2 ms 1572 KB Output is correct
22 Correct 3 ms 1572 KB Output is correct
23 Correct 2 ms 1556 KB Output is correct
24 Correct 1 ms 1564 KB Output is correct
25 Correct 2 ms 1564 KB Output is correct
26 Correct 2 ms 1572 KB Output is correct
27 Correct 2 ms 1572 KB Output is correct
28 Correct 2 ms 1564 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 11628 KB Output is correct
2 Correct 28 ms 13172 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 22 ms 11396 KB Output is correct
5 Correct 33 ms 14196 KB Output is correct
6 Correct 34 ms 14148 KB Output is correct
7 Correct 28 ms 13408 KB Output is correct
8 Correct 30 ms 13436 KB Output is correct
9 Correct 41 ms 14292 KB Output is correct
10 Correct 33 ms 14204 KB Output is correct
11 Correct 33 ms 14052 KB Output is correct
12 Correct 39 ms 14132 KB Output is correct
13 Correct 37 ms 14188 KB Output is correct
14 Correct 33 ms 14200 KB Output is correct
15 Correct 34 ms 14360 KB Output is correct
16 Correct 33 ms 14204 KB Output is correct
17 Correct 31 ms 13928 KB Output is correct
18 Correct 31 ms 13688 KB Output is correct
19 Correct 32 ms 13892 KB Output is correct
20 Correct 33 ms 13876 KB Output is correct
21 Correct 32 ms 13952 KB Output is correct
22 Correct 31 ms 14372 KB Output is correct
23 Correct 26 ms 12120 KB Output is correct
24 Correct 28 ms 11968 KB Output is correct
25 Correct 26 ms 12632 KB Output is correct
26 Correct 27 ms 12360 KB Output is correct
27 Correct 33 ms 13848 KB Output is correct
28 Correct 30 ms 13400 KB Output is correct
29 Correct 30 ms 13352 KB Output is correct
30 Correct 31 ms 13644 KB Output is correct
31 Correct 26 ms 12116 KB Output is correct
32 Correct 25 ms 12108 KB Output is correct
33 Correct 26 ms 12604 KB Output is correct
34 Correct 28 ms 12376 KB Output is correct
35 Correct 35 ms 13472 KB Output is correct
36 Correct 28 ms 13360 KB Output is correct
37 Correct 28 ms 13436 KB Output is correct
38 Correct 32 ms 13456 KB Output is correct
39 Correct 37 ms 13368 KB Output is correct
40 Correct 30 ms 13252 KB Output is correct
41 Correct 30 ms 13968 KB Output is correct
42 Correct 32 ms 13724 KB Output is correct
43 Correct 31 ms 13896 KB Output is correct
44 Correct 31 ms 13888 KB Output is correct
45 Correct 33 ms 13976 KB Output is correct
46 Correct 30 ms 14048 KB Output is correct
47 Correct 28 ms 13140 KB Output is correct
48 Correct 27 ms 13100 KB Output is correct
49 Correct 39 ms 12800 KB Output is correct
50 Correct 32 ms 13092 KB Output is correct
51 Correct 27 ms 12448 KB Output is correct
52 Correct 30 ms 12228 KB Output is correct
53 Correct 26 ms 12364 KB Output is correct
54 Correct 27 ms 12360 KB Output is correct
55 Correct 26 ms 12284 KB Output is correct
56 Correct 27 ms 12448 KB Output is correct
57 Correct 28 ms 12364 KB Output is correct
58 Correct 30 ms 12368 KB Output is correct
59 Correct 30 ms 12232 KB Output is correct
60 Correct 27 ms 12364 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11652 KB Output is correct
2 Correct 30 ms 12668 KB Output is correct
3 Correct 1 ms 1292 KB Output is correct
4 Correct 22 ms 11384 KB Output is correct
5 Correct 32 ms 14192 KB Output is correct
6 Correct 34 ms 14216 KB Output is correct
7 Correct 28 ms 13424 KB Output is correct
8 Correct 27 ms 13436 KB Output is correct
9 Correct 39 ms 14196 KB Output is correct
10 Correct 33 ms 14264 KB Output is correct
11 Correct 33 ms 14204 KB Output is correct
12 Correct 37 ms 14136 KB Output is correct
13 Correct 35 ms 14100 KB Output is correct
14 Correct 33 ms 14200 KB Output is correct
15 Correct 35 ms 14124 KB Output is correct
16 Correct 38 ms 14100 KB Output is correct
17 Correct 31 ms 13944 KB Output is correct
18 Incorrect 30 ms 13960 KB Wrong Answer [6]
19 Halted 0 ms 0 KB -