oj.uz

Submission #910906

# Submission time Handle Problem Language Result Execution time Memory
910906 2024-01-18T09:11:20 Z gawr_gura Stray Cat (JOI20_stray) C++17
20 / 100
 47 ms 16256 KB 
#include "Anthony.h"

#include <bits/stdc++.h>
using namespace std;

namespace std {

template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
        static_assert(D >= 1, "Dimension must be positive");
        template <typename... Args>
        Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};

template <typename T>
struct Vec<1, T> : public vector<T> {
        Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
};

/* Example
        Vec<4, int64_t> f(n, k, 2, 2); // = f[n][k][2][2];
        Vec<2, int> adj(n); // graph
*/

template <class Fun>
class y_combinator_result {
        Fun fun_;

       public:
        template <class T>
        explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

        template <class... Args>
        decltype(auto) operator()(Args &&...args) {
                return fun_(std::ref(*this), std::forward<Args>(args)...);
        }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
        return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

/* Example
        auto fun = y_combinator([&](auto self, int x) -> void {
                self(x + 1);
        });
*/

}  // namespace std

namespace {

int FunctionExample(int i, int A) {
        return i % A;
}

}  // namespace

std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
        vector<vector<pair<int, int>>> adj(N);
        for (int i = 0; i < M; i++) adj[U[i]].emplace_back(V[i], i);
        for (int i = 0; i < M; i++) adj[V[i]].emplace_back(U[i], i);
        vector<int> depth(M, -1);
        vector<int> d(N, -1);
        if (A == 4) A = 3;
        if (A == 3) {
                queue<int> q;
                q.emplace(0);
                d[0] = 0;
                while (q.size()) {
                        int u = q.front();
                        q.pop();
                        for (auto &&[v, i] : adj[u]) {
                                if (d[v] == -1) {
                                        d[v] = d[u] + 1;
                                        depth[i] = d[u];
                                        q.emplace(v);
                                }
                        }
                }

                vector<int> ans(M);
                for (int i = 0; i < M; i++) {
                        if (depth[i] == -1) {
                                if (d[U[i]] == d[V[i]]) {
                                        ans[i] = d[U[i]] % 3;
                                } else {
                                        ans[i] = min(d[U[i]], d[V[i]]) % 3;
                                }
                        } else {
                                ans[i] = depth[i] % 3;
                        }
                }

                return ans;
        } else {
                queue<int> q;
                q.emplace(0);
                d[0] = 0;
                while (q.size()) {
                        int u = q.front();
                        q.pop();
                        for (auto &&[v, i] : adj[u]) {
                                if (d[v] == -1) {
                                        d[v] = d[u] + 1;
                                        depth[i] = d[u];
                                        q.emplace(v);
                                }
                        }
                }

                vector<int> ans(M);
                for (int i = 0; i < M; i++) {
                        ans[i] = depth[i] % A;
                }

                return ans;
        }
}

#include "Catherine.h"

#include <bits/stdc++.h>
using namespace std;

namespace std {

template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
        static_assert(D >= 1, "Dimension must be positive");
        template <typename... Args>
        Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};

template <typename T>
struct Vec<1, T> : public vector<T> {
        Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
};

/* Example
        Vec<4, int64_t> f(n, k, 2, 2); // = f[n][k][2][2];
        Vec<2, int> adj(n); // graph
*/

template <class Fun>
class y_combinator_result {
        Fun fun_;

       public:
        template <class T>
        explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

        template <class... Args>
        decltype(auto) operator()(Args &&...args) {
                return fun_(std::ref(*this), std::forward<Args>(args)...);
        }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
        return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

/* Example
        auto fun = y_combinator([&](auto self, int x) -> void {
                self(x + 1);
        });
*/

}  // namespace std

namespace {

int A, B;
stack<int> st;
int last = -1;

}  // namespace

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

int Move(std::vector<int> y) {
        if (A == 3) {
                int cnt = 0;
                for (int i = 0; i < A; i++) {
                        cnt += y[i] > 0;
                }
                if (cnt == 1) {
                        for (int i = 0; i < A; i++) {
                                if (y[i] > 0) return i;
                        }
                } else {
                        for (int i = 0; i < A; i++) {
                                if (y[i] > 0 && y[(i + 1) % A] > 0) return i;
                        }
                }
        } else {
                int cnt = 0;
                for (int i = 0; i < A; i++) {
                        cnt += y[i] > 0;
                }
                if (cnt == 0) {
                        last = st.top();
                        st.pop();
                        return -1;
                } else if (cnt == 1) {
                        for (int i = 0; i < A; i++) {
                                if (y[i] > 0) {
                                        if (y[i] == 1) {
                                                return i;
                                                st.emplace(i);
                                        } else {
                                                last = st.top();
                                                st.pop();
                                                return -1;
                                        }
                                }
                        }
                } else {
                        cnt = 0;
                        for (int i = 0; i < A; i++) {
                                cnt += y[i] == 1;
                        }
                        assert(cnt > 0);
                        if (cnt == 1) {
                                for (int i = 0; i < A; i++) {
                                        if (y[i] == 1) {
                                                st.emplace(i);
                                                return i;
                                        }
                                }
                        } else {
                                if (last != -1) {
                                        st.emplace(last ^ 1);
                                        return last ^ 1;
                                } else {
                                        st.emplace(0);
                                        return 0;
                                }
                        }
                }
        }
}

Compilation message

Anthony.cpp:54:5: warning: 'int {anonymous}::FunctionExample(int, int)' defined but not used [-Wunused-function]
   54 | int FunctionExample(int i, int A) {
      |     ^~~~~~~~~~~~~~~

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:127:1: warning: control reaches end of non-void function [-Wreturn-type]
  127 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15436 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 25 ms 14708 KB Output is correct
4 Correct 37 ms 16256 KB Output is correct
5 Correct 39 ms 16252 KB Output is correct
6 Correct 32 ms 15228 KB Output is correct
7 Correct 34 ms 15220 KB Output is correct
8 Correct 37 ms 15904 KB Output is correct
9 Correct 32 ms 15820 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 15436 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 25 ms 14708 KB Output is correct
4 Correct 37 ms 16256 KB Output is correct
5 Correct 39 ms 16252 KB Output is correct
6 Correct 32 ms 15228 KB Output is correct
7 Correct 34 ms 15220 KB Output is correct
8 Correct 37 ms 15904 KB Output is correct
9 Correct 32 ms 15820 KB Output is correct
10 Correct 32 ms 12948 KB Output is correct
11 Correct 31 ms 13216 KB Output is correct
12 Correct 27 ms 13292 KB Output is correct
13 Correct 31 ms 13244 KB Output is correct
14 Correct 26 ms 13412 KB Output is correct
15 Correct 39 ms 13888 KB Output is correct
16 Correct 39 ms 15764 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 12896 KB Output is correct
2 Correct 1 ms 792 KB Output is correct
3 Correct 25 ms 12420 KB Output is correct
4 Correct 34 ms 14136 KB Output is correct
5 Correct 47 ms 14032 KB Output is correct
6 Correct 28 ms 12848 KB Output is correct
7 Correct 30 ms 12908 KB Output is correct
8 Correct 33 ms 13680 KB Output is correct
9 Correct 32 ms 13700 KB Output is correct
10 Correct 40 ms 13420 KB Output is correct
11 Correct 32 ms 13420 KB Output is correct
12 Correct 31 ms 13680 KB Output is correct
13 Correct 32 ms 13440 KB Output is correct
14 Correct 35 ms 13676 KB Output is correct
15 Correct 39 ms 13604 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 12896 KB Output is correct
2 Correct 1 ms 792 KB Output is correct
3 Correct 25 ms 12420 KB Output is correct
4 Correct 34 ms 14136 KB Output is correct
5 Correct 47 ms 14032 KB Output is correct
6 Correct 28 ms 12848 KB Output is correct
7 Correct 30 ms 12908 KB Output is correct
8 Correct 33 ms 13680 KB Output is correct
9 Correct 32 ms 13700 KB Output is correct
10 Correct 40 ms 13420 KB Output is correct
11 Correct 32 ms 13420 KB Output is correct
12 Correct 31 ms 13680 KB Output is correct
13 Correct 32 ms 13440 KB Output is correct
14 Correct 35 ms 13676 KB Output is correct
15 Correct 39 ms 13604 KB Output is correct
16 Correct 24 ms 11380 KB Output is correct
17 Correct 24 ms 11552 KB Output is correct
18 Correct 25 ms 11224 KB Output is correct
19 Correct 26 ms 11204 KB Output is correct
20 Correct 38 ms 11928 KB Output is correct
21 Correct 26 ms 11752 KB Output is correct
22 Correct 33 ms 13732 KB Output is correct
23 Correct 27 ms 11420 KB Output is correct
24 Correct 26 ms 11492 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1048 KB Output is correct
2 Correct 1 ms 784 KB Output is correct
3 Correct 2 ms 1048 KB Output is correct
4 Correct 2 ms 1048 KB Output is correct
5 Correct 2 ms 1040 KB Output is correct
6 Correct 2 ms 1048 KB Output is correct
7 Correct 2 ms 1048 KB Output is correct
8 Correct 2 ms 1048 KB Output is correct
9 Correct 2 ms 1048 KB Output is correct
10 Correct 2 ms 1048 KB Output is correct
11 Correct 2 ms 1048 KB Output is correct
12 Correct 2 ms 1040 KB Output is correct
13 Correct 2 ms 1040 KB Output is correct
14 Correct 2 ms 1048 KB Output is correct
15 Correct 2 ms 1048 KB Output is correct
16 Correct 2 ms 1048 KB Output is correct
17 Correct 2 ms 1040 KB Output is correct
18 Correct 2 ms 1056 KB Output is correct
19 Correct 2 ms 1052 KB Output is correct
20 Correct 2 ms 1040 KB Output is correct
21 Correct 2 ms 1060 KB Output is correct
22 Correct 2 ms 1052 KB Output is correct
23 Correct 2 ms 1048 KB Output is correct
24 Correct 2 ms 1056 KB Output is correct
25 Correct 2 ms 1048 KB Output is correct
26 Correct 2 ms 1060 KB Output is correct
27 Correct 2 ms 1040 KB Output is correct
28 Correct 2 ms 1056 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 11124 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 11148 KB Output is correct
2 Incorrect 33 ms 11912 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -