oj.uz

답안 #748648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748648 2023-05-26T16:53:23 Z piOOE 길고양이 (JOI20_stray) C++17
20 / 100
 80 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 {
        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);

        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, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15348 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 36 ms 14748 KB Output is correct
4 Correct 46 ms 16480 KB Output is correct
5 Correct 47 ms 16416 KB Output is correct
6 Correct 38 ms 15200 KB Output is correct
7 Correct 37 ms 15204 KB Output is correct
8 Correct 51 ms 15908 KB Output is correct
9 Correct 47 ms 15852 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15348 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 36 ms 14748 KB Output is correct
4 Correct 46 ms 16480 KB Output is correct
5 Correct 47 ms 16416 KB Output is correct
6 Correct 38 ms 15200 KB Output is correct
7 Correct 37 ms 15204 KB Output is correct
8 Correct 51 ms 15908 KB Output is correct
9 Correct 47 ms 15852 KB Output is correct
10 Correct 38 ms 13200 KB Output is correct
11 Correct 41 ms 13164 KB Output is correct
12 Correct 39 ms 13208 KB Output is correct
13 Correct 33 ms 13292 KB Output is correct
14 Correct 43 ms 13500 KB Output is correct
15 Correct 46 ms 13856 KB Output is correct
16 Correct 41 ms 15892 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 13000 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 31 ms 12580 KB Output is correct
4 Correct 53 ms 14236 KB Output is correct
5 Correct 80 ms 14116 KB Output is correct
6 Correct 36 ms 12976 KB Output is correct
7 Correct 43 ms 12988 KB Output is correct
8 Correct 40 ms 13612 KB Output is correct
9 Correct 62 ms 13608 KB Output is correct
10 Correct 46 ms 13416 KB Output is correct
11 Correct 39 ms 13368 KB Output is correct
12 Correct 41 ms 13360 KB Output is correct
13 Correct 38 ms 13360 KB Output is correct
14 Correct 52 ms 13640 KB Output is correct
15 Correct 44 ms 13716 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 13000 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 31 ms 12580 KB Output is correct
4 Correct 53 ms 14236 KB Output is correct
5 Correct 80 ms 14116 KB Output is correct
6 Correct 36 ms 12976 KB Output is correct
7 Correct 43 ms 12988 KB Output is correct
8 Correct 40 ms 13612 KB Output is correct
9 Correct 62 ms 13608 KB Output is correct
10 Correct 46 ms 13416 KB Output is correct
11 Correct 39 ms 13368 KB Output is correct
12 Correct 41 ms 13360 KB Output is correct
13 Correct 38 ms 13360 KB Output is correct
14 Correct 52 ms 13640 KB Output is correct
15 Correct 44 ms 13716 KB Output is correct
16 Correct 28 ms 11432 KB Output is correct
17 Correct 32 ms 11368 KB Output is correct
18 Correct 33 ms 11364 KB Output is correct
19 Correct 32 ms 11344 KB Output is correct
20 Correct 43 ms 11860 KB Output is correct
21 Correct 39 ms 11660 KB Output is correct
22 Correct 41 ms 13740 KB Output is correct
23 Correct 30 ms 11500 KB Output is correct
24 Correct 38 ms 11340 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 896 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 896 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 896 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 844 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 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 904 KB Output is correct
20 Correct 2 ms 904 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 908 KB Output is correct
23 Correct 2 ms 896 KB Output is correct
24 Correct 2 ms 900 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 896 KB Output is correct
28 Correct 2 ms 904 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 11352 KB Output is correct
2 Correct 41 ms 11612 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 30 ms 11084 KB Output is correct
5 Correct 39 ms 12196 KB Output is correct
6 Correct 41 ms 12312 KB Output is correct
7 Correct 33 ms 11368 KB Output is correct
8 Correct 33 ms 11324 KB Output is correct
9 Correct 41 ms 12188 KB Output is correct
10 Correct 39 ms 12180 KB Output is correct
11 Correct 40 ms 12236 KB Output is correct
12 Correct 41 ms 12296 KB Output is correct
13 Correct 39 ms 12272 KB Output is correct
14 Correct 40 ms 12228 KB Output is correct
15 Correct 56 ms 12188 KB Output is correct
16 Correct 42 ms 12288 KB Output is correct
17 Correct 40 ms 11900 KB Output is correct
18 Correct 38 ms 11920 KB Output is correct
19 Correct 41 ms 11996 KB Output is correct
20 Correct 40 ms 11900 KB Output is correct
21 Correct 37 ms 11928 KB Output is correct
22 Correct 37 ms 12008 KB Output is correct
23 Correct 31 ms 11120 KB Output is correct
24 Correct 32 ms 11100 KB Output is correct
25 Correct 32 ms 11176 KB Output is correct
26 Correct 39 ms 11364 KB Output is correct
27 Correct 39 ms 11672 KB Output is correct
28 Correct 41 ms 11732 KB Output is correct
29 Correct 40 ms 11708 KB Output is correct
30 Correct 40 ms 11756 KB Output is correct
31 Correct 46 ms 11052 KB Output is correct
32 Correct 31 ms 11248 KB Output is correct
33 Correct 33 ms 11228 KB Output is correct
34 Correct 32 ms 11248 KB Output is correct
35 Correct 39 ms 11620 KB Output is correct
36 Correct 38 ms 11604 KB Output is correct
37 Correct 41 ms 11540 KB Output is correct
38 Correct 48 ms 11656 KB Output is correct
39 Correct 39 ms 11596 KB Output is correct
40 Correct 47 ms 11584 KB Output is correct
41 Correct 42 ms 11832 KB Output is correct
42 Correct 41 ms 11892 KB Output is correct
43 Correct 39 ms 11932 KB Output is correct
44 Correct 44 ms 11912 KB Output is correct
45 Correct 44 ms 11768 KB Output is correct
46 Correct 46 ms 11836 KB Output is correct
47 Correct 41 ms 11452 KB Output is correct
48 Correct 39 ms 11460 KB Output is correct
49 Correct 36 ms 11424 KB Output is correct
50 Correct 36 ms 11472 KB Output is correct
51 Correct 33 ms 11312 KB Output is correct
52 Correct 36 ms 11256 KB Output is correct
53 Correct 35 ms 11312 KB Output is correct
54 Correct 37 ms 11320 KB Output is correct
55 Correct 39 ms 11188 KB Output is correct
56 Correct 38 ms 11224 KB Output is correct
57 Correct 36 ms 11076 KB Output is correct
58 Correct 39 ms 11084 KB Output is correct
59 Correct 33 ms 11292 KB Output is correct
60 Incorrect 39 ms 11368 KB Wrong Answer [6]
61 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 11196 KB Output is correct
2 Correct 35 ms 11412 KB Output is correct
3 Correct 0 ms 516 KB Output is correct
4 Correct 30 ms 11084 KB Output is correct
5 Correct 41 ms 12244 KB Output is correct
6 Correct 46 ms 12212 KB Output is correct
7 Correct 38 ms 11312 KB Output is correct
8 Correct 39 ms 11360 KB Output is correct
9 Correct 41 ms 12168 KB Output is correct
10 Correct 47 ms 12248 KB Output is correct
11 Correct 44 ms 12188 KB Output is correct
12 Correct 51 ms 12188 KB Output is correct
13 Correct 51 ms 12236 KB Output is correct
14 Correct 46 ms 12252 KB Output is correct
15 Correct 40 ms 12248 KB Output is correct
16 Correct 43 ms 12260 KB Output is correct
17 Correct 44 ms 11872 KB Output is correct
18 Correct 42 ms 12000 KB Output is correct
19 Correct 37 ms 12020 KB Output is correct
20 Correct 43 ms 11992 KB Output is correct
21 Correct 47 ms 11940 KB Output is correct
22 Correct 44 ms 11960 KB Output is correct
23 Correct 33 ms 11112 KB Output is correct
24 Correct 32 ms 11088 KB Output is correct
25 Correct 36 ms 11292 KB Output is correct
26 Correct 44 ms 11240 KB Output is correct
27 Correct 41 ms 11616 KB Output is correct
28 Correct 38 ms 11760 KB Output is correct
29 Correct 48 ms 11668 KB Output is correct
30 Correct 37 ms 11708 KB Output is correct
31 Incorrect 29 ms 11140 KB Wrong Answer [6]
32 Halted 0 ms 0 KB -