oj.uz

답안 #748702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748702 2023-05-26T18:26:47 Z piOOE 길고양이 (JOI20_stray) C++17
100 / 100
 55 ms 16480 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 {
        vector<int> code{0, 1, 0, 0, 1, 1};
        vector<int> dp(N, -1);

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

            if (dp[x] >= 0) {
                X[e[x]] = code[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, 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> yy) {
    vector<int> y = yy;
    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 (deg == 2) {
            if (ok) {
                return e = find(yy.begin(), yy.end(), 1) - yy.begin();
            }

            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 (adj.size() == 5) {
                ok = true;
                if (extendable(adj)) {
                    return -1;
                }
                return e = find(yy.begin(), yy.end(), 1) - yy.begin();
            } else {
                return e = c;
            }
        } else {
            ok = true;
            int ans = find(y.begin(), y.end(), 1) - y.begin();
            if (ans == e) {
                return -1;
            } else {
                return e = ans;
            }
        }

        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 39 ms 15420 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14840 KB Output is correct
4 Correct 46 ms 16448 KB Output is correct
5 Correct 47 ms 16480 KB Output is correct
6 Correct 41 ms 15124 KB Output is correct
7 Correct 36 ms 15232 KB Output is correct
8 Correct 55 ms 15824 KB Output is correct
9 Correct 44 ms 15976 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15420 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14840 KB Output is correct
4 Correct 46 ms 16448 KB Output is correct
5 Correct 47 ms 16480 KB Output is correct
6 Correct 41 ms 15124 KB Output is correct
7 Correct 36 ms 15232 KB Output is correct
8 Correct 55 ms 15824 KB Output is correct
9 Correct 44 ms 15976 KB Output is correct
10 Correct 34 ms 13304 KB Output is correct
11 Correct 33 ms 13188 KB Output is correct
12 Correct 33 ms 13200 KB Output is correct
13 Correct 34 ms 13284 KB Output is correct
14 Correct 34 ms 13556 KB Output is correct
15 Correct 39 ms 13868 KB Output is correct
16 Correct 41 ms 15960 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 13020 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 27 ms 12512 KB Output is correct
4 Correct 45 ms 14244 KB Output is correct
5 Correct 49 ms 14224 KB Output is correct
6 Correct 35 ms 12976 KB Output is correct
7 Correct 34 ms 13056 KB Output is correct
8 Correct 43 ms 13544 KB Output is correct
9 Correct 53 ms 13652 KB Output is correct
10 Correct 44 ms 13408 KB Output is correct
11 Correct 43 ms 13372 KB Output is correct
12 Correct 44 ms 13344 KB Output is correct
13 Correct 41 ms 13360 KB Output is correct
14 Correct 42 ms 13788 KB Output is correct
15 Correct 41 ms 13660 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 13020 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 27 ms 12512 KB Output is correct
4 Correct 45 ms 14244 KB Output is correct
5 Correct 49 ms 14224 KB Output is correct
6 Correct 35 ms 12976 KB Output is correct
7 Correct 34 ms 13056 KB Output is correct
8 Correct 43 ms 13544 KB Output is correct
9 Correct 53 ms 13652 KB Output is correct
10 Correct 44 ms 13408 KB Output is correct
11 Correct 43 ms 13372 KB Output is correct
12 Correct 44 ms 13344 KB Output is correct
13 Correct 41 ms 13360 KB Output is correct
14 Correct 42 ms 13788 KB Output is correct
15 Correct 41 ms 13660 KB Output is correct
16 Correct 31 ms 11352 KB Output is correct
17 Correct 31 ms 11436 KB Output is correct
18 Correct 33 ms 11372 KB Output is correct
19 Correct 32 ms 11272 KB Output is correct
20 Correct 48 ms 11904 KB Output is correct
21 Correct 38 ms 11684 KB Output is correct
22 Correct 42 ms 13840 KB Output is correct
23 Correct 34 ms 11504 KB Output is correct
24 Correct 36 ms 11484 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 988 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 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 2 ms 904 KB Output is correct
8 Correct 2 ms 908 KB Output is correct
9 Correct 2 ms 904 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 904 KB Output is correct
13 Correct 2 ms 904 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 2 ms 904 KB Output is correct
16 Correct 2 ms 904 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 2 ms 904 KB Output is correct
19 Correct 2 ms 904 KB Output is correct
20 Correct 2 ms 900 KB Output is correct
21 Correct 2 ms 904 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 2 ms 904 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 896 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
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 11200 KB Output is correct
2 Correct 39 ms 11624 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 30 ms 11020 KB Output is correct
5 Correct 51 ms 12240 KB Output is correct
6 Correct 42 ms 12212 KB Output is correct
7 Correct 34 ms 11448 KB Output is correct
8 Correct 33 ms 11356 KB Output is correct
9 Correct 43 ms 12308 KB Output is correct
10 Correct 44 ms 12256 KB Output is correct
11 Correct 41 ms 12232 KB Output is correct
12 Correct 42 ms 12160 KB Output is correct
13 Correct 44 ms 12268 KB Output is correct
14 Correct 47 ms 12160 KB Output is correct
15 Correct 42 ms 12208 KB Output is correct
16 Correct 49 ms 12308 KB Output is correct
17 Correct 36 ms 11936 KB Output is correct
18 Correct 39 ms 11944 KB Output is correct
19 Correct 37 ms 11952 KB Output is correct
20 Correct 38 ms 11956 KB Output is correct
21 Correct 39 ms 11988 KB Output is correct
22 Correct 44 ms 11996 KB Output is correct
23 Correct 32 ms 11256 KB Output is correct
24 Correct 36 ms 11220 KB Output is correct
25 Correct 33 ms 11348 KB Output is correct
26 Correct 34 ms 11344 KB Output is correct
27 Correct 39 ms 11684 KB Output is correct
28 Correct 46 ms 11760 KB Output is correct
29 Correct 48 ms 11748 KB Output is correct
30 Correct 44 ms 11664 KB Output is correct
31 Correct 33 ms 11128 KB Output is correct
32 Correct 37 ms 11164 KB Output is correct
33 Correct 39 ms 11320 KB Output is correct
34 Correct 38 ms 11284 KB Output is correct
35 Correct 39 ms 11672 KB Output is correct
36 Correct 38 ms 11676 KB Output is correct
37 Correct 36 ms 11760 KB Output is correct
38 Correct 40 ms 11688 KB Output is correct
39 Correct 40 ms 11676 KB Output is correct
40 Correct 38 ms 11660 KB Output is correct
41 Correct 38 ms 12012 KB Output is correct
42 Correct 42 ms 11952 KB Output is correct
43 Correct 45 ms 11936 KB Output is correct
44 Correct 41 ms 12004 KB Output is correct
45 Correct 41 ms 11912 KB Output is correct
46 Correct 38 ms 11956 KB Output is correct
47 Correct 37 ms 11592 KB Output is correct
48 Correct 38 ms 11592 KB Output is correct
49 Correct 36 ms 11492 KB Output is correct
50 Correct 39 ms 11628 KB Output is correct
51 Correct 33 ms 11504 KB Output is correct
52 Correct 41 ms 11452 KB Output is correct
53 Correct 34 ms 11496 KB Output is correct
54 Correct 33 ms 11464 KB Output is correct
55 Correct 33 ms 11452 KB Output is correct
56 Correct 33 ms 11456 KB Output is correct
57 Correct 34 ms 11428 KB Output is correct
58 Correct 33 ms 11376 KB Output is correct
59 Correct 33 ms 11444 KB Output is correct
60 Correct 34 ms 11516 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 11292 KB Output is correct
2 Correct 34 ms 11456 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 29 ms 11028 KB Output is correct
5 Correct 42 ms 12208 KB Output is correct
6 Correct 41 ms 12196 KB Output is correct
7 Correct 34 ms 11332 KB Output is correct
8 Correct 38 ms 11328 KB Output is correct
9 Correct 46 ms 12252 KB Output is correct
10 Correct 43 ms 12240 KB Output is correct
11 Correct 42 ms 12244 KB Output is correct
12 Correct 41 ms 12296 KB Output is correct
13 Correct 41 ms 12252 KB Output is correct
14 Correct 46 ms 12340 KB Output is correct
15 Correct 41 ms 12252 KB Output is correct
16 Correct 40 ms 12284 KB Output is correct
17 Correct 39 ms 11948 KB Output is correct
18 Correct 37 ms 11996 KB Output is correct
19 Correct 38 ms 12004 KB Output is correct
20 Correct 39 ms 11976 KB Output is correct
21 Correct 41 ms 11992 KB Output is correct
22 Correct 40 ms 11924 KB Output is correct
23 Correct 31 ms 11388 KB Output is correct
24 Correct 33 ms 11196 KB Output is correct
25 Correct 33 ms 11320 KB Output is correct
26 Correct 33 ms 11332 KB Output is correct
27 Correct 39 ms 11688 KB Output is correct
28 Correct 39 ms 11736 KB Output is correct
29 Correct 41 ms 11668 KB Output is correct
30 Correct 37 ms 11740 KB Output is correct
31 Correct 32 ms 11412 KB Output is correct
32 Correct 32 ms 11152 KB Output is correct
33 Correct 33 ms 11376 KB Output is correct
34 Correct 33 ms 11400 KB Output is correct
35 Correct 37 ms 11780 KB Output is correct
36 Correct 36 ms 11752 KB Output is correct
37 Correct 37 ms 11736 KB Output is correct
38 Correct 37 ms 11752 KB Output is correct
39 Correct 37 ms 11788 KB Output is correct
40 Correct 38 ms 11688 KB Output is correct
41 Correct 38 ms 11944 KB Output is correct
42 Correct 40 ms 11940 KB Output is correct
43 Correct 40 ms 12004 KB Output is correct
44 Correct 39 ms 12012 KB Output is correct
45 Correct 42 ms 11944 KB Output is correct
46 Correct 43 ms 11928 KB Output is correct
47 Correct 39 ms 11624 KB Output is correct
48 Correct 37 ms 11600 KB Output is correct
49 Correct 37 ms 11464 KB Output is correct
50 Correct 41 ms 11760 KB Output is correct
51 Correct 34 ms 11372 KB Output is correct
52 Correct 37 ms 11412 KB Output is correct
53 Correct 34 ms 11436 KB Output is correct
54 Correct 40 ms 11440 KB Output is correct
55 Correct 45 ms 11364 KB Output is correct
56 Correct 34 ms 11484 KB Output is correct
57 Correct 41 ms 11312 KB Output is correct
58 Correct 34 ms 11376 KB Output is correct
59 Correct 34 ms 11368 KB Output is correct
60 Correct 36 ms 11396 KB Output is correct