oj.uz

Submission #748652

# Submission time Handle Problem Language Result Execution time Memory
748652 2023-05-26T17:04:27 Z piOOE Stray Cat (JOI20_stray) C++17
15 / 100
 55 ms 19804 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

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, -1);
    vector<vector<pair<int, int>>> adj(N);

    for (int i = 0; i < M; ++i) {
        adj[U[i]].push_back({V[i], i});
        adj[V[i]].push_back({U[i], i});
    }

    vector<int> dist(N, -1), par(N), e(N, -1), ord;
    dist[0] = 0;
    queue<int> q;
    q.push(0);

    while (!q.empty()) {
        int v = q.front();
        q.pop();
        ord.push_back(v);

        for (auto [to, i] : adj[v]) {
            if (dist[to] == -1) {
                dist[to] = dist[v] + 1;
                par[to] = v;
                e[to] = i;
                q.push(to);
            }
        }
    }

    if (A >= 3) {
        for (int i = 0; i < M; ++i) {
            if (dist[U[i]] > dist[V[i]]) {
                swap(U[i], V[i]);
            }
            X[i] = dist[U[i]] % 3;
        }
    } else {
        for (int i = 1; i < N; ++i) {
            if (adj[i].size() > 2) {
                for (auto [to, j] : adj[i]) {
                    X[j] = (dist[i] % 2) ^ (e[i] != j);
                }
            }
        }

        vector<int> code{0, 1, 1, 0, 0, 1};
        vector<int> dp(N, -1);

        for (int x : ord) {
            if (e[x] == -1 || (par[x] && adj[par[x]].size() >= 3)) {
                if (e[x] == -1 || X[e[x]] == 1) {
                    dp[x] = -1;
                } else {
                    dp[x] = 0;
                }
            }
            
            dp[x] = (dp[x] + 1) % size(code);
            
            for (auto [to, i] : adj[x]) {
                if (i != e[x]) {
                    X[i] = code[dp[x]];
                    dp[to] = dp[x];
                }
            }
        }
    }

    assert(find(X.begin(), X.end(), -1) == X.end());

    return X;
}

#include "Catherine.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
    int A, B, e = -1;
    bool ok = false;

    vector<int> adj;
    vector<int> code{0, 1, 1, 0, 0, 1};

    bool extendable(vector<int> a) {
        for (int i = 0; i < size(code); ++i) {
            bool yay = true;

            for (int k = 0; k < size(a); ++k) {
                if (a[k] != code[(i + k) % size(code)]) {
                    yay = false;
                    break;
                }
            }

            if (yay) {
                return true;
            }
        }

        return false;
    }
}

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

int Move(std::vector<int> y) {
    if (e != -1) {
        y[e] += 1;
    }

    int deg = accumulate(y.begin(), y.end(), 0);

    if (A >= 3) {
        int fi = -1, se = -1, cnt = 0;

        for (int i = 0; i < A; ++i) {
            if (y[i]) {
                fi = fi == -1 ? i : fi;
                se = i;
                cnt += 1;
            }
        }

        if (fi != 0 || se != 2) {
            return e = fi;
        } else {
            return e = se;
        }
    } else {
        if (size(adj) >= size(code)) {
            ok = true;
        }
        if (deg > 2) {
            ok = true;
            for (int i = 0; i < A; ++i) {
                if (y[i] == 1) {
                    if (i == e) {
                        return -1;
                    } else {
                        return e = i;
                    }
                }
            }
        } else if (deg == 1) {
            ok = true;
            for (int i = 0; i < A; ++i) {
                if (y[i]) {
                    if (i == e) {
                        return -1;
                    } else {
                        return e = i;
                    }
                }
            }
        } else if (ok) {
            --y[e];
            for (int i = 0; i < A; ++i) {
                if (y[i]) {
                    return e = i;
                }
            }
        }  else {
            int a = -1, b = -1;

            for (int i = 0; i < A; ++i) {
                if (y[i]) {
                    a = a == -1 ? i : a;
                    b = i;
                }
            }

            if (e == -1) {
                adj.push_back(a);
                adj.push_back(b);
                return e = b;
            }

            int c = a ^ b ^ e;
            adj.push_back(c);

            if (extendable(adj)) {
                return e = c;
            } else {
                ok = true;
                return -1;
            }
        }

        assert(false);
    }
}

Compilation message

Catherine.cpp: In function 'bool {anonymous}::extendable(std::vector<int>)':
Catherine.cpp:14:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         for (int i = 0; i < size(code); ++i) {
      |                         ~~^~~~~~~~~~~~
Catherine.cpp:17:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             for (int k = 0; k < size(a); ++k) {
      |                             ~~^~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 15372 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 32 ms 14780 KB Output is correct
4 Correct 47 ms 16388 KB Output is correct
5 Correct 51 ms 16512 KB Output is correct
6 Correct 38 ms 15124 KB Output is correct
7 Correct 38 ms 15164 KB Output is correct
8 Correct 51 ms 15900 KB Output is correct
9 Correct 54 ms 15908 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 15372 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 32 ms 14780 KB Output is correct
4 Correct 47 ms 16388 KB Output is correct
5 Correct 51 ms 16512 KB Output is correct
6 Correct 38 ms 15124 KB Output is correct
7 Correct 38 ms 15164 KB Output is correct
8 Correct 51 ms 15900 KB Output is correct
9 Correct 54 ms 15908 KB Output is correct
10 Correct 34 ms 13268 KB Output is correct
11 Correct 38 ms 13228 KB Output is correct
12 Correct 36 ms 13300 KB Output is correct
13 Correct 44 ms 13208 KB Output is correct
14 Correct 35 ms 13488 KB Output is correct
15 Correct 42 ms 13872 KB Output is correct
16 Correct 43 ms 15920 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 12992 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 33 ms 12508 KB Output is correct
4 Correct 49 ms 14232 KB Output is correct
5 Correct 46 ms 14280 KB Output is correct
6 Correct 36 ms 13016 KB Output is correct
7 Correct 36 ms 12988 KB Output is correct
8 Correct 43 ms 13748 KB Output is correct
9 Correct 51 ms 13544 KB Output is correct
10 Correct 42 ms 13316 KB Output is correct
11 Correct 38 ms 13428 KB Output is correct
12 Correct 41 ms 13428 KB Output is correct
13 Correct 43 ms 13360 KB Output is correct
14 Correct 42 ms 13792 KB Output is correct
15 Correct 41 ms 13700 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 12992 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 33 ms 12508 KB Output is correct
4 Correct 49 ms 14232 KB Output is correct
5 Correct 46 ms 14280 KB Output is correct
6 Correct 36 ms 13016 KB Output is correct
7 Correct 36 ms 12988 KB Output is correct
8 Correct 43 ms 13748 KB Output is correct
9 Correct 51 ms 13544 KB Output is correct
10 Correct 42 ms 13316 KB Output is correct
11 Correct 38 ms 13428 KB Output is correct
12 Correct 41 ms 13428 KB Output is correct
13 Correct 43 ms 13360 KB Output is correct
14 Correct 42 ms 13792 KB Output is correct
15 Correct 41 ms 13700 KB Output is correct
16 Correct 32 ms 11492 KB Output is correct
17 Correct 28 ms 11460 KB Output is correct
18 Correct 31 ms 11344 KB Output is correct
19 Correct 30 ms 11360 KB Output is correct
20 Correct 35 ms 12028 KB Output is correct
21 Correct 38 ms 11724 KB Output is correct
22 Correct 55 ms 13824 KB Output is correct
23 Correct 35 ms 11488 KB Output is correct
24 Correct 34 ms 11500 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 2 ms 904 KB Output is correct
4 Correct 2 ms 904 KB Output is correct
5 Correct 2 ms 904 KB Output is correct
6 Correct 2 ms 908 KB Output is correct
7 Correct 2 ms 904 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 2 ms 904 KB Output is correct
11 Correct 2 ms 904 KB Output is correct
12 Runtime error 2 ms 1280 KB Execution killed with signal 6
13 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 19804 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 19764 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -