oj.uz

답안 #955463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955463 2024-03-30T13:46:47 Z abczz 길고양이 (JOI20_stray) C++14
15 / 100
 3000 ms 17028 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, f = 0;
  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 (f > 6) {
      while (true) {
        
      }
    }
    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;
      }
      ++f;
      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) {
      ++f;
      //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)) {
          --f;
          dir = 1e18;
          p = 0;
          if (y[0]) return 0;
          else return -1;
        }
        else {
          --f;
          dir = 1e18;
          p = 1;
          if (y[1]) return 1;
          else return -1;
        }
      }
    }
    else {
      ++f;
      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]) {
            --f;
            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 {
          --f;
          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) {
        --f;
        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 32 ms 15980 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 30 ms 15476 KB Output is correct
4 Correct 36 ms 17000 KB Output is correct
5 Correct 35 ms 17028 KB Output is correct
6 Correct 28 ms 15652 KB Output is correct
7 Correct 28 ms 15748 KB Output is correct
8 Correct 33 ms 16496 KB Output is correct
9 Correct 33 ms 16496 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 15980 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 30 ms 15476 KB Output is correct
4 Correct 36 ms 17000 KB Output is correct
5 Correct 35 ms 17028 KB Output is correct
6 Correct 28 ms 15652 KB Output is correct
7 Correct 28 ms 15748 KB Output is correct
8 Correct 33 ms 16496 KB Output is correct
9 Correct 33 ms 16496 KB Output is correct
10 Correct 27 ms 13936 KB Output is correct
11 Correct 26 ms 13944 KB Output is correct
12 Correct 27 ms 13936 KB Output is correct
13 Correct 26 ms 13944 KB Output is correct
14 Correct 27 ms 14128 KB Output is correct
15 Correct 32 ms 14684 KB Output is correct
16 Correct 34 ms 16420 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13508 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 24 ms 12932 KB Output is correct
4 Correct 33 ms 14900 KB Output is correct
5 Correct 37 ms 14932 KB Output is correct
6 Correct 27 ms 13428 KB Output is correct
7 Correct 27 ms 13432 KB Output is correct
8 Correct 31 ms 14216 KB Output is correct
9 Correct 33 ms 14204 KB Output is correct
10 Correct 30 ms 13792 KB Output is correct
11 Correct 30 ms 13936 KB Output is correct
12 Correct 31 ms 13936 KB Output is correct
13 Correct 37 ms 13900 KB Output is correct
14 Correct 32 ms 14328 KB Output is correct
15 Correct 33 ms 14140 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13508 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 24 ms 12932 KB Output is correct
4 Correct 33 ms 14900 KB Output is correct
5 Correct 37 ms 14932 KB Output is correct
6 Correct 27 ms 13428 KB Output is correct
7 Correct 27 ms 13432 KB Output is correct
8 Correct 31 ms 14216 KB Output is correct
9 Correct 33 ms 14204 KB Output is correct
10 Correct 30 ms 13792 KB Output is correct
11 Correct 30 ms 13936 KB Output is correct
12 Correct 31 ms 13936 KB Output is correct
13 Correct 37 ms 13900 KB Output is correct
14 Correct 32 ms 14328 KB Output is correct
15 Correct 33 ms 14140 KB Output is correct
16 Correct 25 ms 11892 KB Output is correct
17 Correct 24 ms 11896 KB Output is correct
18 Correct 26 ms 11884 KB Output is correct
19 Correct 26 ms 11896 KB Output is correct
20 Correct 30 ms 12664 KB Output is correct
21 Correct 27 ms 12380 KB Output is correct
22 Correct 31 ms 14420 KB Output is correct
23 Correct 26 ms 12148 KB Output is correct
24 Correct 27 ms 11976 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1564 KB Output is correct
2 Correct 0 ms 1296 KB Output is correct
3 Correct 2 ms 1572 KB Output is correct
4 Correct 2 ms 1568 KB Output is correct
5 Correct 2 ms 1568 KB Output is correct
6 Correct 2 ms 1560 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 2 ms 1560 KB Output is correct
9 Correct 2 ms 1568 KB Output is correct
10 Correct 2 ms 1560 KB Output is correct
11 Correct 1 ms 1560 KB Output is correct
12 Correct 2 ms 1556 KB Output is correct
13 Correct 2 ms 1568 KB Output is correct
14 Correct 2 ms 1820 KB Output is correct
15 Execution timed out 3080 ms 1564 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 11644 KB Output is correct
2 Correct 30 ms 12928 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 22 ms 11388 KB Output is correct
5 Correct 37 ms 14132 KB Output is correct
6 Correct 34 ms 14204 KB Output is correct
7 Correct 28 ms 13412 KB Output is correct
8 Correct 29 ms 13436 KB Output is correct
9 Correct 36 ms 14200 KB Output is correct
10 Correct 37 ms 14116 KB Output is correct
11 Correct 33 ms 14252 KB Output is correct
12 Correct 32 ms 14196 KB Output is correct
13 Correct 35 ms 14280 KB Output is correct
14 Correct 33 ms 14524 KB Output is correct
15 Correct 43 ms 14128 KB Output is correct
16 Correct 33 ms 14192 KB Output is correct
17 Correct 31 ms 13860 KB Output is correct
18 Execution timed out 3007 ms 13184 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11712 KB Output is correct
2 Correct 28 ms 12628 KB Output is correct
3 Correct 0 ms 1308 KB Output is correct
4 Correct 23 ms 11376 KB Output is correct
5 Correct 42 ms 14132 KB Output is correct
6 Correct 34 ms 14180 KB Output is correct
7 Correct 36 ms 13428 KB Output is correct
8 Correct 32 ms 13520 KB Output is correct
9 Correct 33 ms 14116 KB Output is correct
10 Correct 36 ms 14324 KB Output is correct
11 Correct 32 ms 14148 KB Output is correct
12 Correct 32 ms 14120 KB Output is correct
13 Correct 37 ms 14132 KB Output is correct
14 Correct 38 ms 14160 KB Output is correct
15 Correct 32 ms 14036 KB Output is correct
16 Correct 37 ms 14216 KB Output is correct
17 Correct 32 ms 13944 KB Output is correct
18 Execution timed out 3094 ms 13192 KB Time limit exceeded
19 Halted 0 ms 0 KB -