oj.uz

답안 #748699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748699 2023-05-26T18:21:58 Z piOOE 길고양이 (JOI20_stray) C++17
29 / 100
 48 ms 16384 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 c;
            } 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 38 ms 15420 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14824 KB Output is correct
4 Correct 48 ms 16384 KB Output is correct
5 Correct 47 ms 16332 KB Output is correct
6 Correct 40 ms 15216 KB Output is correct
7 Correct 36 ms 15152 KB Output is correct
8 Correct 46 ms 15884 KB Output is correct
9 Correct 41 ms 15936 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 15420 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14824 KB Output is correct
4 Correct 48 ms 16384 KB Output is correct
5 Correct 47 ms 16332 KB Output is correct
6 Correct 40 ms 15216 KB Output is correct
7 Correct 36 ms 15152 KB Output is correct
8 Correct 46 ms 15884 KB Output is correct
9 Correct 41 ms 15936 KB Output is correct
10 Correct 33 ms 13216 KB Output is correct
11 Correct 32 ms 13272 KB Output is correct
12 Correct 31 ms 13236 KB Output is correct
13 Correct 34 ms 13228 KB Output is correct
14 Correct 34 ms 13416 KB Output is correct
15 Correct 38 ms 13924 KB Output is correct
16 Correct 40 ms 15892 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12984 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 30 ms 12656 KB Output is correct
4 Correct 45 ms 14268 KB Output is correct
5 Correct 45 ms 14316 KB Output is correct
6 Correct 34 ms 13028 KB Output is correct
7 Correct 33 ms 12968 KB Output is correct
8 Correct 40 ms 13656 KB Output is correct
9 Correct 41 ms 13712 KB Output is correct
10 Correct 37 ms 13364 KB Output is correct
11 Correct 40 ms 13480 KB Output is correct
12 Correct 40 ms 13332 KB Output is correct
13 Correct 38 ms 13356 KB Output is correct
14 Correct 39 ms 13796 KB Output is correct
15 Correct 40 ms 13664 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12984 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 30 ms 12656 KB Output is correct
4 Correct 45 ms 14268 KB Output is correct
5 Correct 45 ms 14316 KB Output is correct
6 Correct 34 ms 13028 KB Output is correct
7 Correct 33 ms 12968 KB Output is correct
8 Correct 40 ms 13656 KB Output is correct
9 Correct 41 ms 13712 KB Output is correct
10 Correct 37 ms 13364 KB Output is correct
11 Correct 40 ms 13480 KB Output is correct
12 Correct 40 ms 13332 KB Output is correct
13 Correct 38 ms 13356 KB Output is correct
14 Correct 39 ms 13796 KB Output is correct
15 Correct 40 ms 13664 KB Output is correct
16 Correct 31 ms 11436 KB Output is correct
17 Correct 33 ms 11260 KB Output is correct
18 Correct 31 ms 11372 KB Output is correct
19 Correct 35 ms 11280 KB Output is correct
20 Correct 38 ms 11932 KB Output is correct
21 Correct 34 ms 11756 KB Output is correct
22 Correct 40 ms 13788 KB Output is correct
23 Correct 32 ms 11424 KB Output is correct
24 Correct 33 ms 11428 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 904 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 896 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 904 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 904 KB Output is correct
10 Correct 2 ms 904 KB Output is correct
11 Correct 2 ms 908 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 904 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 2 ms 896 KB Output is correct
17 Correct 2 ms 904 KB Output is correct
18 Correct 2 ms 896 KB Output is correct
19 Correct 2 ms 900 KB Output is correct
20 Correct 2 ms 868 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 904 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 904 KB Output is correct
26 Correct 2 ms 904 KB Output is correct
27 Correct 2 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 11208 KB Output is correct
2 Correct 36 ms 11708 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 28 ms 11120 KB Output is correct
5 Correct 46 ms 12376 KB Output is correct
6 Correct 42 ms 12212 KB Output is correct
7 Correct 35 ms 11348 KB Output is correct
8 Correct 34 ms 11372 KB Output is correct
9 Correct 43 ms 12240 KB Output is correct
10 Correct 44 ms 12360 KB Output is correct
11 Correct 45 ms 12284 KB Output is correct
12 Correct 44 ms 12324 KB Output is correct
13 Correct 41 ms 12316 KB Output is correct
14 Correct 41 ms 12276 KB Output is correct
15 Correct 45 ms 12216 KB Output is correct
16 Correct 44 ms 12264 KB Output is correct
17 Correct 41 ms 12028 KB Output is correct
18 Correct 43 ms 11928 KB Output is correct
19 Correct 42 ms 11980 KB Output is correct
20 Correct 46 ms 11948 KB Output is correct
21 Correct 43 ms 11908 KB Output is correct
22 Correct 41 ms 11912 KB Output is correct
23 Incorrect 31 ms 11376 KB Wrong Answer [3]
24 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 11056 KB Output is correct
2 Correct 38 ms 11400 KB Output is correct
3 Correct 0 ms 516 KB Output is correct
4 Correct 28 ms 11080 KB Output is correct
5 Correct 43 ms 12344 KB Output is correct
6 Correct 41 ms 12264 KB Output is correct
7 Correct 35 ms 11512 KB Output is correct
8 Correct 34 ms 11392 KB Output is correct
9 Correct 43 ms 12256 KB Output is correct
10 Correct 40 ms 12252 KB Output is correct
11 Correct 44 ms 12284 KB Output is correct
12 Correct 45 ms 12372 KB Output is correct
13 Correct 40 ms 12260 KB Output is correct
14 Correct 41 ms 12272 KB Output is correct
15 Correct 42 ms 12264 KB Output is correct
16 Correct 40 ms 12312 KB Output is correct
17 Correct 40 ms 11956 KB Output is correct
18 Correct 39 ms 11952 KB Output is correct
19 Correct 40 ms 11948 KB Output is correct
20 Correct 39 ms 12016 KB Output is correct
21 Correct 41 ms 12000 KB Output is correct
22 Correct 40 ms 11960 KB Output is correct
23 Correct 32 ms 11200 KB Output is correct
24 Correct 31 ms 11244 KB Output is correct
25 Correct 33 ms 11316 KB Output is correct
26 Correct 33 ms 11268 KB Output is correct
27 Correct 37 ms 11808 KB Output is correct
28 Correct 37 ms 11684 KB Output is correct
29 Correct 40 ms 11824 KB Output is correct
30 Correct 39 ms 11668 KB Output is correct
31 Correct 32 ms 11316 KB Output is correct
32 Correct 33 ms 11236 KB Output is correct
33 Correct 34 ms 11388 KB Output is correct
34 Correct 35 ms 11316 KB Output is correct
35 Correct 36 ms 11788 KB Output is correct
36 Correct 39 ms 11672 KB Output is correct
37 Correct 38 ms 11704 KB Output is correct
38 Correct 39 ms 11700 KB Output is correct
39 Correct 37 ms 11672 KB Output is correct
40 Correct 36 ms 11636 KB Output is correct
41 Correct 39 ms 11944 KB Output is correct
42 Correct 41 ms 11952 KB Output is correct
43 Correct 39 ms 12028 KB Output is correct
44 Correct 37 ms 11964 KB Output is correct
45 Correct 37 ms 11932 KB Output is correct
46 Correct 42 ms 12028 KB Output is correct
47 Correct 38 ms 11588 KB Output is correct
48 Correct 40 ms 11664 KB Output is correct
49 Correct 35 ms 11476 KB Output is correct
50 Correct 36 ms 11676 KB Output is correct
51 Correct 33 ms 11616 KB Output is correct
52 Correct 34 ms 11332 KB Output is correct
53 Correct 34 ms 11496 KB Output is correct
54 Correct 34 ms 11416 KB Output is correct
55 Correct 36 ms 11392 KB Output is correct
56 Correct 34 ms 11476 KB Output is correct
57 Correct 32 ms 11460 KB Output is correct
58 Correct 31 ms 11316 KB Output is correct
59 Correct 34 ms 11424 KB Output is correct
60 Correct 37 ms 11828 KB Output is correct