oj.uz

답안 #747825

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747825 2023-05-24T20:45:27 Z finn__ 길고양이 (JOI20_stray) C++17
15 / 100
 45 ms 16312 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;

constexpr bool pattern[6] = {0, 0, 1, 1, 0, 1};

vector<int> Mark(int n, int m, int a, int b, vector<int> u, vector<int> v)
{
    vector<vector<int>> g(n);
    for (size_t i = 0; i < m; ++i)
        g[u[i]].push_back(v[i]), g[v[i]].push_back(u[i]);

    queue<int> q;
    q.push(0);
    vector<int> d(n, -1), pattern_index(n, -1);
    vector<bool> color(n, 0);
    d[0] = pattern_index[0] = 0;
    while (!q.empty())
    {
        int const x = q.front();
        q.pop();

        for (auto const &y : g[x])
            if (d[y] == -1)
            {
                d[y] = d[x] + 1;
                q.push(y);

                if (g[y].size() <= 2)
                {
                    pattern_index[y] = (pattern_index[x] + 1) % 6;
                    color[y] = color[x];
                }
                else
                {
                    pattern_index[y] = 0;
                    color[y] = !color[x];
                }
            }
    }

    vector<int> ans(m);
    if (a >= 3)
    {
        for (size_t i = 0; i < m; ++i)
            ans[i] = min(d[u[i]], d[v[i]]) % 3;
    }
    else
    {
        for (size_t i = 0; i < m; ++i)
        {
            if (d[u[i]] > d[v[i]])
                swap(u[i], v[i]);
            ans[i] = pattern[pattern_index[u[i]]] ^ color[u[i]];
        }
    }

    return ans;
}

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;

bool is_tree, initialized;
vector<int> colors;

constexpr bool pattern[6] = {0, 0, 1, 1, 0, 1};

void Init(int a, int b)
{
    colors.clear();
    is_tree = a == 2;
    initialized = 0;
}

int Move(vector<int> y)
{
    if (!is_tree)
    {
        if (!colors.empty())
            y[colors.back()]++;

        if ((bool)y[0] + (bool)y[1] + (bool)y[2] == 1)
        {
            if (y[0])
            {
                colors.push_back(0);
                return 0;
            }
            else if (y[1])
            {
                colors.push_back(1);
                return 1;
            }
            else
            {
                colors.push_back(2);
                return 2;
            }
        }

        if (!y[0])
        {
            colors.push_back(1);
            return 1;
        }
        else if (!y[1])
        {
            colors.push_back(2);
            return 2;
        }
        else
        {
            colors.push_back(0);
            return 0;
        }
    }
    else
    {
        if (colors.empty() && y[0] + y[1] >= 3)
        {
            initialized = 1;
            if (y[0] == 1)
            {
                colors.push_back(0);
                return 0;
            }
            else
            {
                colors.push_back(1);
                return 1;
            }
        }
        if (!initialized)
        {
            if (y[0] + y[1] == 1)
            {
                initialized = 1;
                colors.push_back(y[1]);
                return y[1];
            }
            if (!colors.empty() && y[0] + y[1] >= 2)
            {
                initialized = 1;
                if (!y[colors.back()])
                    return -1;
                else
                    return !colors.back();
            }
            else
            {
                if (!(y[0] + y[1]))
                {
                    initialized = 1;
                    return -1;
                }
                if (colors.size() == 4)
                {
                    initialized = 1;
                    for (size_t i = 0; i < 6; ++i) /*  pattern */
                    {
                        bool correct = 1;
                        for (size_t j = 0; j < 4; ++j)
                            correct &= colors[j] == pattern[(i + j) % 6];
                        if (correct)
                            return -1;
                    }
                    for (size_t i = 0; i < 6; ++i) /* inverted pattern */
                    {
                        bool correct = 1;
                        for (size_t j = 0; j < 4; ++j)
                            correct &= colors[j] == !pattern[(i + j) % 6];
                        if (correct)
                            return -1;
                    }
                    return Move(y);
                }
                if (colors.empty())
                {
                    if (y[0] == 2)
                        colors.push_back(0);
                    else
                        colors.push_back(1);
                }
                if (y[0])
                {
                    colors.push_back(0);
                    return 0;
                }
                else
                {
                    colors.push_back(1);
                    return 1;
                }
            }
        }
        else
        {
            if (y[0] + y[1] >= 2)
            {
                colors.push_back(!colors.back());
                return colors.back();
            }
            colors.push_back(y[1]);
            return y[1];
        }
    }
}

Compilation message

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:10:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   10 |     for (size_t i = 0; i < m; ++i)
      |                        ~~^~~
Anthony.cpp:45:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |         for (size_t i = 0; i < m; ++i)
      |                            ~~^~~
Anthony.cpp:50:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         for (size_t i = 0; i < m; ++i)
      |                            ~~^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15056 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 28 ms 14312 KB Output is correct
4 Correct 43 ms 16312 KB Output is correct
5 Correct 45 ms 16220 KB Output is correct
6 Correct 37 ms 14868 KB Output is correct
7 Correct 38 ms 14796 KB Output is correct
8 Correct 41 ms 15620 KB Output is correct
9 Correct 40 ms 15716 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15056 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 28 ms 14312 KB Output is correct
4 Correct 43 ms 16312 KB Output is correct
5 Correct 45 ms 16220 KB Output is correct
6 Correct 37 ms 14868 KB Output is correct
7 Correct 38 ms 14796 KB Output is correct
8 Correct 41 ms 15620 KB Output is correct
9 Correct 40 ms 15716 KB Output is correct
10 Correct 31 ms 12860 KB Output is correct
11 Correct 31 ms 12856 KB Output is correct
12 Correct 31 ms 12784 KB Output is correct
13 Correct 32 ms 12764 KB Output is correct
14 Correct 33 ms 13164 KB Output is correct
15 Correct 38 ms 13456 KB Output is correct
16 Correct 41 ms 15696 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 12556 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 27 ms 12080 KB Output is correct
4 Correct 41 ms 14004 KB Output is correct
5 Correct 40 ms 13940 KB Output is correct
6 Correct 31 ms 12636 KB Output is correct
7 Correct 31 ms 12668 KB Output is correct
8 Correct 37 ms 13420 KB Output is correct
9 Correct 38 ms 13428 KB Output is correct
10 Correct 39 ms 13172 KB Output is correct
11 Correct 36 ms 13136 KB Output is correct
12 Correct 38 ms 13108 KB Output is correct
13 Correct 35 ms 13080 KB Output is correct
14 Correct 38 ms 13424 KB Output is correct
15 Correct 37 ms 13416 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 12556 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 27 ms 12080 KB Output is correct
4 Correct 41 ms 14004 KB Output is correct
5 Correct 40 ms 13940 KB Output is correct
6 Correct 31 ms 12636 KB Output is correct
7 Correct 31 ms 12668 KB Output is correct
8 Correct 37 ms 13420 KB Output is correct
9 Correct 38 ms 13428 KB Output is correct
10 Correct 39 ms 13172 KB Output is correct
11 Correct 36 ms 13136 KB Output is correct
12 Correct 38 ms 13108 KB Output is correct
13 Correct 35 ms 13080 KB Output is correct
14 Correct 38 ms 13424 KB Output is correct
15 Correct 37 ms 13416 KB Output is correct
16 Correct 27 ms 11072 KB Output is correct
17 Correct 28 ms 11088 KB Output is correct
18 Correct 31 ms 11088 KB Output is correct
19 Correct 30 ms 10992 KB Output is correct
20 Correct 34 ms 11624 KB Output is correct
21 Correct 32 ms 11392 KB Output is correct
22 Correct 39 ms 13448 KB Output is correct
23 Correct 34 ms 11052 KB Output is correct
24 Correct 31 ms 11156 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 904 KB Output is correct
2 Incorrect 0 ms 516 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 10684 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 10648 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -