oj.uz

Submission #747831

# Submission time Handle Problem Language Result Execution time Memory
747831 2023-05-24T21:13:46 Z finn__ Stray Cat (JOI20_stray) C++17
15 / 100
 44 ms 16300 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);
    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;
                else
                    pattern_index[y] = pattern[pattern_index[x]] ? 4 : 5;
            }
    }

    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]]];
        }
    }

    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 (colors.empty() && y[0] + y[1] == 1)
        {
            initialized = 1;
            colors.push_back(y[1]);
            return y[1];
        }
        if (!initialized)
        {
            if (!colors.empty() && y[0] + y[1] >= 2)
            {
                initialized = 1;
                if (!y[colors.back()])
                    return -1;
                else
                {
                    colors.push_back(!colors.back());
                    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;
                    }
                    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:38:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |         for (size_t i = 0; i < m; ++i)
      |                            ~~^~~
Anthony.cpp:43:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         for (size_t i = 0; i < m; ++i)
      |                            ~~^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 15056 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 14416 KB Output is correct
4 Correct 43 ms 16160 KB Output is correct
5 Correct 44 ms 16300 KB Output is correct
6 Correct 34 ms 14824 KB Output is correct
7 Correct 36 ms 14960 KB Output is correct
8 Correct 40 ms 15556 KB Output is correct
9 Correct 40 ms 15516 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 15056 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 14416 KB Output is correct
4 Correct 43 ms 16160 KB Output is correct
5 Correct 44 ms 16300 KB Output is correct
6 Correct 34 ms 14824 KB Output is correct
7 Correct 36 ms 14960 KB Output is correct
8 Correct 40 ms 15556 KB Output is correct
9 Correct 40 ms 15516 KB Output is correct
10 Correct 31 ms 12880 KB Output is correct
11 Correct 34 ms 12856 KB Output is correct
12 Correct 40 ms 12856 KB Output is correct
13 Correct 32 ms 12788 KB Output is correct
14 Correct 36 ms 13156 KB Output is correct
15 Correct 37 ms 13592 KB Output is correct
16 Correct 41 ms 15764 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 12644 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 27 ms 12200 KB Output is correct
4 Correct 41 ms 14048 KB Output is correct
5 Correct 40 ms 14024 KB Output is correct
6 Correct 34 ms 12668 KB Output is correct
7 Correct 33 ms 12592 KB Output is correct
8 Correct 38 ms 13432 KB Output is correct
9 Correct 41 ms 13220 KB Output is correct
10 Correct 36 ms 13148 KB Output is correct
11 Correct 38 ms 13136 KB Output is correct
12 Correct 36 ms 12968 KB Output is correct
13 Correct 37 ms 13112 KB Output is correct
14 Correct 40 ms 13400 KB Output is correct
15 Correct 38 ms 13472 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 12644 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 27 ms 12200 KB Output is correct
4 Correct 41 ms 14048 KB Output is correct
5 Correct 40 ms 14024 KB Output is correct
6 Correct 34 ms 12668 KB Output is correct
7 Correct 33 ms 12592 KB Output is correct
8 Correct 38 ms 13432 KB Output is correct
9 Correct 41 ms 13220 KB Output is correct
10 Correct 36 ms 13148 KB Output is correct
11 Correct 38 ms 13136 KB Output is correct
12 Correct 36 ms 12968 KB Output is correct
13 Correct 37 ms 13112 KB Output is correct
14 Correct 40 ms 13400 KB Output is correct
15 Correct 38 ms 13472 KB Output is correct
16 Correct 30 ms 11056 KB Output is correct
17 Correct 30 ms 10924 KB Output is correct
18 Correct 30 ms 10984 KB Output is correct
19 Correct 30 ms 10984 KB Output is correct
20 Correct 35 ms 11680 KB Output is correct
21 Correct 32 ms 11352 KB Output is correct
22 Correct 39 ms 13484 KB Output is correct
23 Correct 32 ms 11060 KB Output is correct
24 Correct 34 ms 11096 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 0 ms 520 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 896 KB Output is correct
10 Incorrect 2 ms 896 KB Wrong Answer [5]
11 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 10836 KB Output is correct
2 Correct 35 ms 11376 KB Output is correct
3 Correct 0 ms 516 KB Output is correct
4 Correct 28 ms 10680 KB Output is correct
5 Correct 39 ms 12124 KB Output is correct
6 Correct 39 ms 12044 KB Output is correct
7 Correct 33 ms 11156 KB Output is correct
8 Incorrect 28 ms 11120 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 10704 KB Output is correct
2 Correct 35 ms 11112 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 26 ms 10736 KB Output is correct
5 Correct 38 ms 12132 KB Output is correct
6 Correct 40 ms 12116 KB Output is correct
7 Correct 33 ms 11132 KB Output is correct
8 Incorrect 28 ms 11088 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -