oj.uz

Submission #212378

# Submission time Handle Problem Language Result Execution time Memory
212378 2020-03-22T20:12:45 Z dolphingarlic Stray Cat (JOI20_stray) C++14
100 / 100
 111 ms 16796 KB 
#include "Anthony.h"

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

namespace {

vector<int> X, perm = {0, 1, 0, 0, 1, 1};
vector<pair<int, int>> graph[20000];

void mark_tree(int node = 0, int par_id = -1, int depth = 0) {
    if (~par_id) X[par_id] = perm[depth];
    for (pair<int, int> i : graph[node]) if (i.second != par_id) {
        if (graph[node].size() == 2)
            mark_tree(i.first, i.second, (depth + 1) % 6);
        else
            mark_tree(i.first, i.second, 1 ^ perm[depth]);
    }
}

int visited[20000];

void mark_graph() {
    queue<int> q;
    q.push(0);
    visited[0] = 1;
    while (q.size()) {
        int curr = q.front();
        q.pop();
        for (pair<int, int> i : graph[curr]) if (!visited[i.first]) {
            X[i.second] = (visited[curr] - 1) % 3;
            visited[i.first] = visited[curr] + 1;
            q.push(i.first); 
        } else X[i.second] = (visited[i.first] - 1) % 3;
    }
}

}  // namespace

vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
    FOR(i, 0, M) {
        graph[U[i]].push_back({V[i], i});
        graph[V[i]].push_back({U[i], i});
    }

    X.resize(M);
    if (B) mark_tree();
    else mark_graph();
    return X;
}

#include "Catherine.h"

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

namespace {

int A, B, last;
bool going_up;
vector<int> seen;
vector<vector<int>> good = {
    {1, 1, 0, 0, 1},
    {1, 0, 0, 1, 0},
    {0, 0, 1, 0, 1},
    {0, 1, 0, 1, 1},
    {1, 0, 1, 1, 0},
    {0, 1, 1, 0, 0},
};

int move_tree(vector<int> y) {
    vector<int> new_y = y;
    if (~last) new_y[last]++;

    int deg = accumulate(new_y.begin(), new_y.end(), 0);
    if (deg != 2) going_up = true;

    if (going_up) {
        if (deg == 1) {
            if (last == -1) FOR(i, 0, A) if (y[i]) return last = i;
            return -1;
        } else if (deg == 2) {
            FOR(i, 0, A) if (y[i]) return last = i;
        } else {
            FOR(i, 0, A) if (new_y[i] == 1) {
                if (!y[i]) return -1;
                return last = i;
            }
        }
    } else {
        if (~last) {
            FOR(i, 0, A) if (y[i]) {
                seen.push_back(i);
                if (seen.size() < 5) return last = i;
                else {
                    going_up = true;
                    for (vector<int> v : good)
                        if (v == seen) return last = i;
                    return -1;
                }
            }
        } else {
            FOR(i, 0, A) if (y[i]) {
                seen.push_back(i);
                y[i]--;
                FOR(j, 0, A) if (y[j]) {
                    seen.push_back(j);
                    return last = j;
                }
            }
        }
    }
}

int move_graph(vector<int> y) {
    if (~last) y[last]++;
    FOR(i, 0, 3) if (y[i] && y[(i + 1) % 3]) return last = i;
    FOR(i, 0, 3) if (y[i]) return last = i;
}

}  // namespace

void Init(int A, int B) {
    ::A = A;
    ::B = B;
    going_up = false;
    last = -1;
}

int Move(vector<int> y) {
    if (B) return move_tree(y);
    return move_graph(y);
}

Compilation message

Catherine.cpp: In function 'int {anonymous}::move_tree(std::vector<int>)':
Catherine.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
Catherine.cpp: In function 'int {anonymous}::move_graph(std::vector<int>)':
Catherine.cpp:70:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 15796 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 50 ms 15088 KB Output is correct
4 Correct 90 ms 16796 KB Output is correct
5 Correct 83 ms 16760 KB Output is correct
6 Correct 61 ms 15476 KB Output is correct
7 Correct 61 ms 15604 KB Output is correct
8 Correct 81 ms 16244 KB Output is correct
9 Correct 77 ms 16176 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 15796 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 50 ms 15088 KB Output is correct
4 Correct 90 ms 16796 KB Output is correct
5 Correct 83 ms 16760 KB Output is correct
6 Correct 61 ms 15476 KB Output is correct
7 Correct 61 ms 15604 KB Output is correct
8 Correct 81 ms 16244 KB Output is correct
9 Correct 77 ms 16176 KB Output is correct
10 Correct 56 ms 13740 KB Output is correct
11 Correct 56 ms 13552 KB Output is correct
12 Correct 66 ms 13640 KB Output is correct
13 Correct 62 ms 13652 KB Output is correct
14 Correct 65 ms 13968 KB Output is correct
15 Correct 67 ms 14348 KB Output is correct
16 Correct 66 ms 16372 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 13308 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 64 ms 12924 KB Output is correct
4 Correct 72 ms 14576 KB Output is correct
5 Correct 70 ms 14500 KB Output is correct
6 Correct 56 ms 13172 KB Output is correct
7 Correct 58 ms 13316 KB Output is correct
8 Correct 76 ms 13940 KB Output is correct
9 Correct 76 ms 13940 KB Output is correct
10 Correct 63 ms 13812 KB Output is correct
11 Correct 61 ms 13772 KB Output is correct
12 Correct 62 ms 13812 KB Output is correct
13 Correct 77 ms 13840 KB Output is correct
14 Correct 71 ms 14104 KB Output is correct
15 Correct 63 ms 13948 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 13308 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 64 ms 12924 KB Output is correct
4 Correct 72 ms 14576 KB Output is correct
5 Correct 70 ms 14500 KB Output is correct
6 Correct 56 ms 13172 KB Output is correct
7 Correct 58 ms 13316 KB Output is correct
8 Correct 76 ms 13940 KB Output is correct
9 Correct 76 ms 13940 KB Output is correct
10 Correct 63 ms 13812 KB Output is correct
11 Correct 61 ms 13772 KB Output is correct
12 Correct 62 ms 13812 KB Output is correct
13 Correct 77 ms 13840 KB Output is correct
14 Correct 71 ms 14104 KB Output is correct
15 Correct 63 ms 13948 KB Output is correct
16 Correct 55 ms 11740 KB Output is correct
17 Correct 50 ms 11648 KB Output is correct
18 Correct 62 ms 11776 KB Output is correct
19 Correct 54 ms 11880 KB Output is correct
20 Correct 72 ms 12488 KB Output is correct
21 Correct 64 ms 12124 KB Output is correct
22 Correct 68 ms 14160 KB Output is correct
23 Correct 57 ms 11764 KB Output is correct
24 Correct 59 ms 11992 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1536 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 11 ms 1888 KB Output is correct
5 Correct 10 ms 1792 KB Output is correct
6 Correct 10 ms 1792 KB Output is correct
7 Correct 11 ms 1896 KB Output is correct
8 Correct 11 ms 1792 KB Output is correct
9 Correct 11 ms 1792 KB Output is correct
10 Correct 11 ms 1888 KB Output is correct
11 Correct 11 ms 1792 KB Output is correct
12 Correct 11 ms 1536 KB Output is correct
13 Correct 11 ms 1548 KB Output is correct
14 Correct 11 ms 1792 KB Output is correct
15 Correct 12 ms 2048 KB Output is correct
16 Correct 11 ms 1536 KB Output is correct
17 Correct 11 ms 1536 KB Output is correct
18 Correct 10 ms 1536 KB Output is correct
19 Correct 11 ms 1564 KB Output is correct
20 Correct 11 ms 1536 KB Output is correct
21 Correct 11 ms 1548 KB Output is correct
22 Correct 10 ms 1536 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 11 ms 1536 KB Output is correct
25 Correct 10 ms 1792 KB Output is correct
26 Correct 10 ms 1536 KB Output is correct
27 Correct 10 ms 1536 KB Output is correct
28 Correct 11 ms 1536 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 11516 KB Output is correct
2 Correct 75 ms 12444 KB Output is correct
3 Correct 10 ms 1536 KB Output is correct
4 Correct 44 ms 11136 KB Output is correct
5 Correct 79 ms 13796 KB Output is correct
6 Correct 69 ms 13684 KB Output is correct
7 Correct 75 ms 13052 KB Output is correct
8 Correct 61 ms 12904 KB Output is correct
9 Correct 88 ms 13664 KB Output is correct
10 Correct 80 ms 13684 KB Output is correct
11 Correct 68 ms 13948 KB Output is correct
12 Correct 70 ms 13692 KB Output is correct
13 Correct 70 ms 13812 KB Output is correct
14 Correct 78 ms 13792 KB Output is correct
15 Correct 78 ms 13816 KB Output is correct
16 Correct 72 ms 13900 KB Output is correct
17 Correct 71 ms 13656 KB Output is correct
18 Correct 67 ms 13452 KB Output is correct
19 Correct 63 ms 13436 KB Output is correct
20 Correct 68 ms 13400 KB Output is correct
21 Correct 73 ms 13300 KB Output is correct
22 Correct 74 ms 13440 KB Output is correct
23 Correct 50 ms 11500 KB Output is correct
24 Correct 52 ms 11516 KB Output is correct
25 Correct 63 ms 11888 KB Output is correct
26 Correct 55 ms 11752 KB Output is correct
27 Correct 72 ms 12660 KB Output is correct
28 Correct 62 ms 12620 KB Output is correct
29 Correct 60 ms 12764 KB Output is correct
30 Correct 61 ms 12668 KB Output is correct
31 Correct 67 ms 11508 KB Output is correct
32 Correct 61 ms 11648 KB Output is correct
33 Correct 55 ms 11776 KB Output is correct
34 Correct 51 ms 11784 KB Output is correct
35 Correct 60 ms 12572 KB Output is correct
36 Correct 57 ms 12512 KB Output is correct
37 Correct 59 ms 12540 KB Output is correct
38 Correct 59 ms 12524 KB Output is correct
39 Correct 71 ms 12532 KB Output is correct
40 Correct 57 ms 12548 KB Output is correct
41 Correct 73 ms 13060 KB Output is correct
42 Correct 69 ms 12968 KB Output is correct
43 Correct 62 ms 13044 KB Output is correct
44 Correct 68 ms 13052 KB Output is correct
45 Correct 66 ms 13140 KB Output is correct
46 Correct 67 ms 13044 KB Output is correct
47 Correct 60 ms 12416 KB Output is correct
48 Correct 59 ms 12296 KB Output is correct
49 Correct 56 ms 12156 KB Output is correct
50 Correct 56 ms 12412 KB Output is correct
51 Correct 50 ms 11516 KB Output is correct
52 Correct 50 ms 11636 KB Output is correct
53 Correct 50 ms 11516 KB Output is correct
54 Correct 73 ms 11692 KB Output is correct
55 Correct 66 ms 11636 KB Output is correct
56 Correct 56 ms 11656 KB Output is correct
57 Correct 61 ms 11652 KB Output is correct
58 Correct 58 ms 11604 KB Output is correct
59 Correct 79 ms 11500 KB Output is correct
60 Correct 71 ms 11636 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 11516 KB Output is correct
2 Correct 63 ms 12284 KB Output is correct
3 Correct 10 ms 1536 KB Output is correct
4 Correct 45 ms 11320 KB Output is correct
5 Correct 77 ms 13796 KB Output is correct
6 Correct 68 ms 13948 KB Output is correct
7 Correct 70 ms 13060 KB Output is correct
8 Correct 65 ms 12852 KB Output is correct
9 Correct 78 ms 13692 KB Output is correct
10 Correct 93 ms 13812 KB Output is correct
11 Correct 78 ms 13820 KB Output is correct
12 Correct 90 ms 13940 KB Output is correct
13 Correct 74 ms 13912 KB Output is correct
14 Correct 105 ms 13684 KB Output is correct
15 Correct 100 ms 13764 KB Output is correct
16 Correct 111 ms 13936 KB Output is correct
17 Correct 94 ms 13544 KB Output is correct
18 Correct 91 ms 13584 KB Output is correct
19 Correct 84 ms 13556 KB Output is correct
20 Correct 79 ms 13448 KB Output is correct
21 Correct 66 ms 13428 KB Output is correct
22 Correct 79 ms 13532 KB Output is correct
23 Correct 59 ms 11460 KB Output is correct
24 Correct 59 ms 11396 KB Output is correct
25 Correct 59 ms 11776 KB Output is correct
26 Correct 63 ms 11772 KB Output is correct
27 Correct 64 ms 12648 KB Output is correct
28 Correct 70 ms 12620 KB Output is correct
29 Correct 66 ms 12668 KB Output is correct
30 Correct 68 ms 12660 KB Output is correct
31 Correct 64 ms 11512 KB Output is correct
32 Correct 56 ms 11592 KB Output is correct
33 Correct 55 ms 11844 KB Output is correct
34 Correct 53 ms 11908 KB Output is correct
35 Correct 84 ms 12492 KB Output is correct
36 Correct 61 ms 12492 KB Output is correct
37 Correct 62 ms 12536 KB Output is correct
38 Correct 68 ms 12416 KB Output is correct
39 Correct 70 ms 12520 KB Output is correct
40 Correct 55 ms 12532 KB Output is correct
41 Correct 72 ms 13056 KB Output is correct
42 Correct 63 ms 13060 KB Output is correct
43 Correct 70 ms 13060 KB Output is correct
44 Correct 73 ms 13068 KB Output is correct
45 Correct 71 ms 13152 KB Output is correct
46 Correct 68 ms 13052 KB Output is correct
47 Correct 66 ms 12284 KB Output is correct
48 Correct 66 ms 12608 KB Output is correct
49 Correct 59 ms 12140 KB Output is correct
50 Correct 65 ms 12276 KB Output is correct
51 Correct 59 ms 11596 KB Output is correct
52 Correct 65 ms 11596 KB Output is correct
53 Correct 55 ms 11644 KB Output is correct
54 Correct 51 ms 11612 KB Output is correct
55 Correct 57 ms 11652 KB Output is correct
56 Correct 64 ms 11628 KB Output is correct
57 Correct 60 ms 11632 KB Output is correct
58 Correct 54 ms 11604 KB Output is correct
59 Correct 57 ms 11700 KB Output is correct
60 Correct 51 ms 11516 KB Output is correct