oj.uz

Submission #212376

# Submission time Handle Problem Language Result Execution time Memory
212376 2020-03-22T20:08:24 Z dolphingarlic Stray Cat (JOI20_stray) C++14
85 / 100
 3000 ms 14296 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();
        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
0 / 2.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3068 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3068 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3083 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3083 ms 1920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 11516 KB Output is correct
2 Correct 61 ms 12876 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 53 ms 11556 KB Output is correct
5 Correct 76 ms 14176 KB Output is correct
6 Correct 79 ms 14156 KB Output is correct
7 Correct 56 ms 13236 KB Output is correct
8 Correct 55 ms 13396 KB Output is correct
9 Correct 71 ms 14268 KB Output is correct
10 Correct 84 ms 14236 KB Output is correct
11 Correct 78 ms 14156 KB Output is correct
12 Correct 77 ms 14200 KB Output is correct
13 Correct 73 ms 14156 KB Output is correct
14 Correct 78 ms 14296 KB Output is correct
15 Correct 78 ms 14220 KB Output is correct
16 Correct 76 ms 13908 KB Output is correct
17 Correct 72 ms 13564 KB Output is correct
18 Correct 76 ms 13412 KB Output is correct
19 Correct 69 ms 13500 KB Output is correct
20 Correct 66 ms 13324 KB Output is correct
21 Correct 69 ms 13424 KB Output is correct
22 Correct 68 ms 13428 KB Output is correct
23 Correct 52 ms 11388 KB Output is correct
24 Correct 62 ms 11612 KB Output is correct
25 Correct 60 ms 11880 KB Output is correct
26 Correct 59 ms 11772 KB Output is correct
27 Correct 59 ms 12692 KB Output is correct
28 Correct 63 ms 12668 KB Output is correct
29 Correct 75 ms 12796 KB Output is correct
30 Correct 66 ms 12628 KB Output is correct
31 Correct 67 ms 11508 KB Output is correct
32 Correct 51 ms 11884 KB Output is correct
33 Correct 57 ms 12076 KB Output is correct
34 Correct 67 ms 12180 KB Output is correct
35 Correct 62 ms 13012 KB Output is correct
36 Correct 77 ms 12868 KB Output is correct
37 Correct 58 ms 12928 KB Output is correct
38 Correct 60 ms 12880 KB Output is correct
39 Correct 64 ms 12884 KB Output is correct
40 Correct 68 ms 13060 KB Output is correct
41 Correct 61 ms 13636 KB Output is correct
42 Correct 74 ms 13388 KB Output is correct
43 Correct 67 ms 13516 KB Output is correct
44 Correct 68 ms 13644 KB Output is correct
45 Correct 65 ms 13440 KB Output is correct
46 Correct 69 ms 13500 KB Output is correct
47 Correct 72 ms 12800 KB Output is correct
48 Correct 59 ms 12764 KB Output is correct
49 Correct 57 ms 12748 KB Output is correct
50 Correct 60 ms 12876 KB Output is correct
51 Correct 53 ms 12116 KB Output is correct
52 Correct 50 ms 11988 KB Output is correct
53 Correct 59 ms 12108 KB Output is correct
54 Correct 60 ms 12100 KB Output is correct
55 Correct 57 ms 12108 KB Output is correct
56 Correct 64 ms 12084 KB Output is correct
57 Correct 61 ms 11952 KB Output is correct
58 Correct 57 ms 11980 KB Output is correct
59 Correct 54 ms 11952 KB Output is correct
60 Correct 55 ms 12092 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 11400 KB Output is correct
2 Correct 62 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 70 ms 13812 KB Output is correct
6 Correct 74 ms 13772 KB Output is correct
7 Correct 62 ms 12900 KB Output is correct
8 Correct 65 ms 13052 KB Output is correct
9 Correct 78 ms 14148 KB Output is correct
10 Correct 78 ms 14284 KB Output is correct
11 Correct 74 ms 14156 KB Output is correct
12 Correct 87 ms 14276 KB Output is correct
13 Correct 67 ms 14284 KB Output is correct
14 Correct 91 ms 14284 KB Output is correct
15 Correct 86 ms 14168 KB Output is correct
16 Correct 71 ms 14244 KB Output is correct
17 Correct 62 ms 13900 KB Output is correct
18 Correct 66 ms 13884 KB Output is correct
19 Correct 74 ms 13544 KB Output is correct
20 Correct 68 ms 13420 KB Output is correct
21 Correct 68 ms 13588 KB Output is correct
22 Correct 71 ms 13540 KB Output is correct
23 Correct 64 ms 11516 KB Output is correct
24 Correct 50 ms 11388 KB Output is correct
25 Correct 59 ms 11852 KB Output is correct
26 Correct 52 ms 11900 KB Output is correct
27 Correct 64 ms 12532 KB Output is correct
28 Correct 62 ms 12620 KB Output is correct
29 Correct 67 ms 12772 KB Output is correct
30 Correct 68 ms 12772 KB Output is correct
31 Correct 62 ms 11372 KB Output is correct
32 Correct 59 ms 11484 KB Output is correct
33 Correct 55 ms 11900 KB Output is correct
34 Correct 57 ms 11772 KB Output is correct
35 Correct 62 ms 12460 KB Output is correct
36 Correct 66 ms 12520 KB Output is correct
37 Correct 70 ms 12604 KB Output is correct
38 Correct 62 ms 12412 KB Output is correct
39 Correct 59 ms 12632 KB Output is correct
40 Correct 60 ms 12552 KB Output is correct
41 Correct 69 ms 13044 KB Output is correct
42 Correct 61 ms 13052 KB Output is correct
43 Correct 64 ms 13044 KB Output is correct
44 Correct 69 ms 13044 KB Output is correct
45 Correct 62 ms 13060 KB Output is correct
46 Correct 66 ms 13100 KB Output is correct
47 Correct 55 ms 12284 KB Output is correct
48 Correct 61 ms 12276 KB Output is correct
49 Correct 61 ms 12140 KB Output is correct
50 Correct 59 ms 12404 KB Output is correct
51 Correct 51 ms 11644 KB Output is correct
52 Correct 65 ms 11592 KB Output is correct
53 Correct 54 ms 11644 KB Output is correct
54 Correct 56 ms 11604 KB Output is correct
55 Correct 54 ms 11516 KB Output is correct
56 Correct 53 ms 11644 KB Output is correct
57 Correct 54 ms 11636 KB Output is correct
58 Correct 59 ms 11552 KB Output is correct
59 Correct 60 ms 11640 KB Output is correct
60 Correct 51 ms 11604 KB Output is correct