oj.uz

Submission #212377

# Submission time Handle Problem Language Result Execution time Memory
212377 2020-03-22T20:10:38 Z dolphingarlic Stray Cat (JOI20_stray) C++14
89 / 100
 95 ms 16720 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); 
        }
    }
}

}  // 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 68 ms 15740 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 47 ms 15000 KB Output is correct
4 Correct 76 ms 16628 KB Output is correct
5 Correct 89 ms 16720 KB Output is correct
6 Correct 54 ms 15624 KB Output is correct
7 Correct 60 ms 15484 KB Output is correct
8 Correct 79 ms 16244 KB Output is correct
9 Correct 95 ms 16244 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 15740 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 47 ms 15000 KB Output is correct
4 Correct 76 ms 16628 KB Output is correct
5 Correct 89 ms 16720 KB Output is correct
6 Correct 54 ms 15624 KB Output is correct
7 Correct 60 ms 15484 KB Output is correct
8 Correct 79 ms 16244 KB Output is correct
9 Correct 95 ms 16244 KB Output is correct
10 Incorrect 75 ms 13504 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 13308 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 48 ms 12924 KB Output is correct
4 Correct 85 ms 14464 KB Output is correct
5 Correct 80 ms 14580 KB Output is correct
6 Correct 76 ms 13164 KB Output is correct
7 Correct 52 ms 13300 KB Output is correct
8 Correct 76 ms 13960 KB Output is correct
9 Correct 70 ms 13940 KB Output is correct
10 Correct 72 ms 13772 KB Output is correct
11 Correct 66 ms 13812 KB Output is correct
12 Correct 68 ms 13820 KB Output is correct
13 Correct 67 ms 13656 KB Output is correct
14 Correct 65 ms 14068 KB Output is correct
15 Correct 64 ms 14052 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 13308 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 48 ms 12924 KB Output is correct
4 Correct 85 ms 14464 KB Output is correct
5 Correct 80 ms 14580 KB Output is correct
6 Correct 76 ms 13164 KB Output is correct
7 Correct 52 ms 13300 KB Output is correct
8 Correct 76 ms 13960 KB Output is correct
9 Correct 70 ms 13940 KB Output is correct
10 Correct 72 ms 13772 KB Output is correct
11 Correct 66 ms 13812 KB Output is correct
12 Correct 68 ms 13820 KB Output is correct
13 Correct 67 ms 13656 KB Output is correct
14 Correct 65 ms 14068 KB Output is correct
15 Correct 64 ms 14052 KB Output is correct
16 Incorrect 62 ms 11728 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 11488 KB Output is correct
2 Correct 63 ms 12472 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 48 ms 11240 KB Output is correct
5 Correct 76 ms 13684 KB Output is correct
6 Correct 72 ms 13908 KB Output is correct
7 Correct 57 ms 12884 KB Output is correct
8 Correct 53 ms 13036 KB Output is correct
9 Correct 68 ms 13696 KB Output is correct
10 Correct 66 ms 13884 KB Output is correct
11 Correct 75 ms 13956 KB Output is correct
12 Correct 80 ms 13936 KB Output is correct
13 Correct 84 ms 13828 KB Output is correct
14 Correct 78 ms 13908 KB Output is correct
15 Correct 77 ms 13740 KB Output is correct
16 Correct 73 ms 13800 KB Output is correct
17 Correct 74 ms 13532 KB Output is correct
18 Correct 88 ms 13544 KB Output is correct
19 Correct 66 ms 13480 KB Output is correct
20 Correct 66 ms 13428 KB Output is correct
21 Correct 64 ms 13396 KB Output is correct
22 Correct 76 ms 13388 KB Output is correct
23 Correct 55 ms 11508 KB Output is correct
24 Correct 57 ms 11508 KB Output is correct
25 Correct 57 ms 11784 KB Output is correct
26 Correct 59 ms 11852 KB Output is correct
27 Correct 59 ms 12532 KB Output is correct
28 Correct 68 ms 12612 KB Output is correct
29 Correct 67 ms 12660 KB Output is correct
30 Correct 66 ms 12652 KB Output is correct
31 Correct 53 ms 11512 KB Output is correct
32 Correct 50 ms 11500 KB Output is correct
33 Correct 52 ms 11644 KB Output is correct
34 Correct 61 ms 11884 KB Output is correct
35 Correct 59 ms 12540 KB Output is correct
36 Correct 68 ms 12496 KB Output is correct
37 Correct 56 ms 12540 KB Output is correct
38 Correct 59 ms 12492 KB Output is correct
39 Correct 71 ms 12492 KB Output is correct
40 Correct 61 ms 12492 KB Output is correct
41 Correct 71 ms 13044 KB Output is correct
42 Correct 73 ms 13132 KB Output is correct
43 Correct 67 ms 13052 KB Output is correct
44 Correct 69 ms 13132 KB Output is correct
45 Correct 71 ms 13140 KB Output is correct
46 Correct 68 ms 13152 KB Output is correct
47 Correct 59 ms 12408 KB Output is correct
48 Correct 62 ms 12276 KB Output is correct
49 Correct 54 ms 12156 KB Output is correct
50 Correct 61 ms 12276 KB Output is correct
51 Correct 63 ms 11636 KB Output is correct
52 Correct 64 ms 11548 KB Output is correct
53 Correct 51 ms 11644 KB Output is correct
54 Correct 58 ms 11516 KB Output is correct
55 Correct 51 ms 11516 KB Output is correct
56 Correct 52 ms 11676 KB Output is correct
57 Correct 52 ms 11508 KB Output is correct
58 Correct 52 ms 11516 KB Output is correct
59 Correct 54 ms 11628 KB Output is correct
60 Correct 54 ms 11732 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 11524 KB Output is correct
2 Correct 70 ms 12276 KB Output is correct
3 Correct 10 ms 1536 KB Output is correct
4 Correct 47 ms 11420 KB Output is correct
5 Correct 70 ms 13828 KB Output is correct
6 Correct 78 ms 13696 KB Output is correct
7 Correct 55 ms 12924 KB Output is correct
8 Correct 55 ms 12828 KB Output is correct
9 Correct 72 ms 13820 KB Output is correct
10 Correct 72 ms 13796 KB Output is correct
11 Correct 65 ms 13684 KB Output is correct
12 Correct 76 ms 13684 KB Output is correct
13 Correct 73 ms 13908 KB Output is correct
14 Correct 72 ms 13856 KB Output is correct
15 Correct 76 ms 13948 KB Output is correct
16 Correct 71 ms 13684 KB Output is correct
17 Correct 60 ms 13572 KB Output is correct
18 Correct 64 ms 13396 KB Output is correct
19 Correct 82 ms 13428 KB Output is correct
20 Correct 84 ms 13428 KB Output is correct
21 Correct 67 ms 13388 KB Output is correct
22 Correct 61 ms 13436 KB Output is correct
23 Correct 50 ms 11516 KB Output is correct
24 Correct 55 ms 11540 KB Output is correct
25 Correct 54 ms 11772 KB Output is correct
26 Correct 54 ms 11892 KB Output is correct
27 Correct 70 ms 12532 KB Output is correct
28 Correct 64 ms 12620 KB Output is correct
29 Correct 64 ms 12668 KB Output is correct
30 Correct 68 ms 12600 KB Output is correct
31 Correct 50 ms 11516 KB Output is correct
32 Correct 56 ms 11388 KB Output is correct
33 Correct 59 ms 11768 KB Output is correct
34 Correct 60 ms 11892 KB Output is correct
35 Correct 72 ms 12540 KB Output is correct
36 Correct 59 ms 12540 KB Output is correct
37 Correct 65 ms 12532 KB Output is correct
38 Correct 68 ms 12476 KB Output is correct
39 Correct 63 ms 12564 KB Output is correct
40 Correct 66 ms 12556 KB Output is correct
41 Correct 69 ms 13044 KB Output is correct
42 Correct 76 ms 13060 KB Output is correct
43 Correct 76 ms 13048 KB Output is correct
44 Correct 67 ms 13172 KB Output is correct
45 Correct 80 ms 13044 KB Output is correct
46 Correct 78 ms 13044 KB Output is correct
47 Correct 60 ms 12416 KB Output is correct
48 Correct 70 ms 12476 KB Output is correct
49 Correct 64 ms 12288 KB Output is correct
50 Correct 57 ms 12400 KB Output is correct
51 Correct 55 ms 11644 KB Output is correct
52 Correct 50 ms 11644 KB Output is correct
53 Correct 53 ms 11636 KB Output is correct
54 Correct 55 ms 11508 KB Output is correct
55 Correct 64 ms 11636 KB Output is correct
56 Correct 69 ms 11688 KB Output is correct
57 Correct 66 ms 11564 KB Output is correct
58 Correct 62 ms 11592 KB Output is correct
59 Correct 63 ms 11612 KB Output is correct
60 Correct 52 ms 11492 KB Output is correct