oj.uz

답안 #747834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747834 2023-05-24T21:15:54 Z piOOE 길고양이 (JOI20_stray) C++17
20 / 100
 48 ms 16488 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 (B == 0) {
        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, 0, 1, 0, 0, 1, 1};
        vector<int> dp(N, -1);

        reverse(ord.begin(), ord.end());

        for (int x : ord) {
            if (e[x] == -1 || X[e[x]] != -1) {
                continue;
            }
            dp[x] = (dp[x] + 1) % size(code);
            X[e[x]] = code[dp[x]];
            dp[par[x]] = 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, 0, 1, 0, 0, 1, 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 (B == 0) {
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15460 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 32 ms 14812 KB Output is correct
4 Correct 44 ms 16404 KB Output is correct
5 Correct 48 ms 16488 KB Output is correct
6 Correct 36 ms 15128 KB Output is correct
7 Correct 37 ms 15236 KB Output is correct
8 Correct 44 ms 15904 KB Output is correct
9 Correct 45 ms 15908 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15460 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 32 ms 14812 KB Output is correct
4 Correct 44 ms 16404 KB Output is correct
5 Correct 48 ms 16488 KB Output is correct
6 Correct 36 ms 15128 KB Output is correct
7 Correct 37 ms 15236 KB Output is correct
8 Correct 44 ms 15904 KB Output is correct
9 Correct 45 ms 15908 KB Output is correct
10 Correct 33 ms 13252 KB Output is correct
11 Correct 33 ms 13240 KB Output is correct
12 Correct 33 ms 13296 KB Output is correct
13 Correct 36 ms 13220 KB Output is correct
14 Correct 37 ms 13432 KB Output is correct
15 Correct 37 ms 13872 KB Output is correct
16 Correct 43 ms 15944 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12976 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12636 KB Output is correct
4 Correct 48 ms 14300 KB Output is correct
5 Correct 41 ms 14256 KB Output is correct
6 Correct 34 ms 13036 KB Output is correct
7 Correct 35 ms 12964 KB Output is correct
8 Correct 40 ms 13772 KB Output is correct
9 Correct 38 ms 13604 KB Output is correct
10 Correct 38 ms 13428 KB Output is correct
11 Correct 37 ms 13392 KB Output is correct
12 Correct 37 ms 13360 KB Output is correct
13 Correct 38 ms 13404 KB Output is correct
14 Correct 38 ms 13736 KB Output is correct
15 Correct 39 ms 13800 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12976 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12636 KB Output is correct
4 Correct 48 ms 14300 KB Output is correct
5 Correct 41 ms 14256 KB Output is correct
6 Correct 34 ms 13036 KB Output is correct
7 Correct 35 ms 12964 KB Output is correct
8 Correct 40 ms 13772 KB Output is correct
9 Correct 38 ms 13604 KB Output is correct
10 Correct 38 ms 13428 KB Output is correct
11 Correct 37 ms 13392 KB Output is correct
12 Correct 37 ms 13360 KB Output is correct
13 Correct 38 ms 13404 KB Output is correct
14 Correct 38 ms 13736 KB Output is correct
15 Correct 39 ms 13800 KB Output is correct
16 Correct 28 ms 11448 KB Output is correct
17 Correct 30 ms 11360 KB Output is correct
18 Correct 37 ms 11424 KB Output is correct
19 Correct 30 ms 11400 KB Output is correct
20 Correct 37 ms 11936 KB Output is correct
21 Correct 35 ms 11812 KB Output is correct
22 Correct 43 ms 13728 KB Output is correct
23 Correct 31 ms 11512 KB Output is correct
24 Correct 34 ms 11508 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 912 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 904 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 2 ms 904 KB Output is correct
7 Correct 2 ms 900 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 904 KB Output is correct
10 Correct 1 ms 904 KB Output is correct
11 Correct 2 ms 904 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 2 ms 900 KB Output is correct
14 Correct 3 ms 896 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 2 ms 904 KB Output is correct
17 Correct 2 ms 900 KB Output is correct
18 Correct 2 ms 904 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 2 ms 896 KB Output is correct
21 Correct 2 ms 904 KB Output is correct
22 Correct 2 ms 904 KB Output is correct
23 Correct 2 ms 908 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 900 KB Output is correct
26 Correct 2 ms 904 KB Output is correct
27 Correct 2 ms 904 KB Output is correct
28 Correct 2 ms 896 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 11240 KB Output is correct
2 Correct 35 ms 11480 KB Output is correct
3 Correct 0 ms 520 KB Output is correct
4 Correct 27 ms 11132 KB Output is correct
5 Correct 43 ms 12168 KB Output is correct
6 Correct 39 ms 12032 KB Output is correct
7 Correct 32 ms 11216 KB Output is correct
8 Incorrect 30 ms 11320 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 10972 KB Output is correct
2 Correct 34 ms 11360 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 28 ms 11064 KB Output is correct
5 Correct 39 ms 12184 KB Output is correct
6 Correct 38 ms 12128 KB Output is correct
7 Correct 31 ms 11340 KB Output is correct
8 Incorrect 29 ms 11252 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -