oj.uz

Submission #961000

# Submission time Handle Problem Language Result Execution time Memory
961000 2024-04-11T11:13:39 Z alextodoran Stray Cat (JOI20_stray) C++17
91 / 100
 42 ms 17020 KB 
#include <bits/stdc++.h>
#include "Anthony.h"

using namespace std;

namespace {

const int N_MAX = 20000;
const int pattern[] = {0, 1, 0, 0, 1, 1};

int N, M, A, B;
int edge_u[N_MAX], edge_v[N_MAX];
vector <int> adj[N_MAX];
int other (int i, int u) {
    return (u != edge_v[i] ? edge_v[i] : edge_u[i]);
}

int up_edge[N_MAX];
int color[N_MAX + 1];

int chain[N_MAX];

void dfs () {
    fill(up_edge, up_edge + N, -1);
    up_edge[0] = M; color[M] = 1 - N % 2;
    chain[0] = -1;
    queue <int> q;
    q.push(0);
    while (q.empty() == false) {
        int u = q.front();
        q.pop();
        if ((int) adj[u].size() == 2 && u != 0) {
            if (chain[u] == -1) {
                chain[u] = (1 - color[up_edge[u]]);
            } else {
                chain[u]++;
            }
        } else {
            chain[u] = -1;
        }
        for (int i : adj[u]) {
            int v = other(i, u);
            if (up_edge[v] == -1) {
                up_edge[v] = i;
                color[i] = (chain[u] == -1 ? 1 - color[up_edge[u]] : pattern[chain[u] % 6]);
                chain[v] = chain[u];
                q.push(v);
            }
        }
    }
}

int dist[N_MAX];
void bfs () {
    fill(dist, dist + N, -1);
    up_edge[0] = M; color[M] = 2;
    dist[0] = 0;
    queue <int> q;
    q.push(0);
    while (q.empty() == false) {
        int u = q.front();
        q.pop();
        for (int i : adj[u]) {
            int v = other(i, u);
            if (dist[v] == -1) {
                up_edge[v] = i;
                dist[v] = dist[u] + 1;
                color[i] = (color[up_edge[u]] + 1) % 3;
                q.push(v);
            } else if (dist[u] <= dist[v]){
                color[i] = (color[up_edge[u]] + 1) % 3;
            }
        }
    }
}

}

vector <int> Mark (int _N, int _M, int _A, int _B, vector <int> _U, vector <int> _V) {
    N = _N; M = _M; A = _A; B = _B;
    for (int i = 0; i < M; i++) {
        edge_u[i] = _U[i]; edge_v[i] = _V[i];
        adj[edge_u[i]].push_back(i);
        adj[edge_v[i]].push_back(i);
    }
    if (B > 0) {
        dfs();
    } else {
        bfs();
    }
    vector <int> X(M);
    copy(color, color + M, X.begin());
    for (int u = 0; u < N; u++) {
        adj[u].clear();
        up_edge[u] = 0;
    }
    return X;
}

#include <bits/stdc++.h>
#include "Catherine.h"

using namespace std;

namespace {
    int A, B;
    vector <int> cols;
    bool passed_test;
}


void Init (int _A, int _B) {
    A = _A; B = _B;
    cols.clear();
    passed_test = false;
}

int Move (vector <int> cnt_col) {
    if (B > 0) {
        int deg = cnt_col[0] + cnt_col[1] + 1;
        // First move
        if (cols.empty() == true) {
            deg--;
            // If leaf, take the only option
            if (deg == 1) {
                passed_test = true;
                cols.push_back((cnt_col[1] > 0 ? 1 : 0));
                return cols.back();
            }
            // If not crossroad, take any option
            if (deg == 2) {
                cols.push_back((cnt_col[1] > 0 ? 1 : 0));
                return cols.back();
            }
            // If crossroad, take the only option with frequency 1
            passed_test = true;
            cols.push_back((cnt_col[1] == 1 ? 1 : 0));
            return cols.back();
        }
        // If leaf, turn back
        if (deg == 1) {
            passed_test = true;
            cols = {cols.back()};
            return -1;
        }
        // If not crossroad, check for pattern
        if (deg == 2) {
            cols.push_back((cnt_col[1] > 0 ? 1 : 0));
            if (passed_test == false && (int) cols.size() == 6) {
                int ok = -1;
                for (int i = 0; i < 6; i++) {
                    if (cols[i] == 0 && cols[(i + 1) % 6] == 0) {
                        ok = (cols[(i + 2) % 6] != cols[(i + 3) % 6]);
                        break;
                    }
                }
                assert(ok != -1);
                passed_test = true;
                if (ok == false) {
                    cols.pop_back();
                    cols = {cols.back()};
                    return -1;
                }
            }
            return cols.back();
        }
        // If crossroad, check for count
        passed_test = true;
        if (cnt_col[0] == 0 || cnt_col[1] == 0) {
            cols = {cols.back()};
            return -1;
        } else {
            cols.push_back(1 - cols.back());
            return cols.back();
        }
    } else {
        if ((cnt_col[0] > 0) + (cnt_col[1] > 0) + (cnt_col[2] > 0) == 1) {
            return (cnt_col[0] > 0 ? 0 : (cnt_col[1] > 0 ? 1 : 2));
        } else {
            return (cnt_col[0] == 0 ? 1 : (cnt_col[1] == 0 ? 2 : 0));
        }
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15984 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 30 ms 15200 KB Output is correct
4 Correct 38 ms 17016 KB Output is correct
5 Correct 36 ms 17020 KB Output is correct
6 Correct 28 ms 15736 KB Output is correct
7 Correct 28 ms 15688 KB Output is correct
8 Correct 33 ms 16484 KB Output is correct
9 Correct 33 ms 16508 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15984 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 30 ms 15200 KB Output is correct
4 Correct 38 ms 17016 KB Output is correct
5 Correct 36 ms 17020 KB Output is correct
6 Correct 28 ms 15736 KB Output is correct
7 Correct 28 ms 15688 KB Output is correct
8 Correct 33 ms 16484 KB Output is correct
9 Correct 33 ms 16508 KB Output is correct
10 Correct 27 ms 13648 KB Output is correct
11 Correct 27 ms 13648 KB Output is correct
12 Correct 26 ms 13688 KB Output is correct
13 Correct 25 ms 13684 KB Output is correct
14 Correct 26 ms 13936 KB Output is correct
15 Correct 28 ms 14200 KB Output is correct
16 Correct 37 ms 16508 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13428 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 26 ms 12924 KB Output is correct
4 Correct 33 ms 14800 KB Output is correct
5 Correct 38 ms 15228 KB Output is correct
6 Correct 27 ms 13384 KB Output is correct
7 Correct 28 ms 13424 KB Output is correct
8 Correct 31 ms 14200 KB Output is correct
9 Correct 32 ms 14040 KB Output is correct
10 Correct 31 ms 13936 KB Output is correct
11 Correct 27 ms 13948 KB Output is correct
12 Correct 28 ms 13940 KB Output is correct
13 Correct 31 ms 13976 KB Output is correct
14 Correct 30 ms 14204 KB Output is correct
15 Correct 31 ms 14052 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13428 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 26 ms 12924 KB Output is correct
4 Correct 33 ms 14800 KB Output is correct
5 Correct 38 ms 15228 KB Output is correct
6 Correct 27 ms 13384 KB Output is correct
7 Correct 28 ms 13424 KB Output is correct
8 Correct 31 ms 14200 KB Output is correct
9 Correct 32 ms 14040 KB Output is correct
10 Correct 31 ms 13936 KB Output is correct
11 Correct 27 ms 13948 KB Output is correct
12 Correct 28 ms 13940 KB Output is correct
13 Correct 31 ms 13976 KB Output is correct
14 Correct 30 ms 14204 KB Output is correct
15 Correct 31 ms 14052 KB Output is correct
16 Correct 24 ms 11892 KB Output is correct
17 Correct 24 ms 11800 KB Output is correct
18 Correct 28 ms 11628 KB Output is correct
19 Correct 31 ms 11740 KB Output is correct
20 Correct 27 ms 12480 KB Output is correct
21 Correct 27 ms 12148 KB Output is correct
22 Correct 32 ms 14412 KB Output is correct
23 Correct 25 ms 11892 KB Output is correct
24 Correct 26 ms 11892 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1556 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 2 ms 1560 KB Output is correct
4 Correct 2 ms 1552 KB Output is correct
5 Correct 2 ms 1564 KB Output is correct
6 Correct 2 ms 1552 KB Output is correct
7 Correct 4 ms 1568 KB Output is correct
8 Correct 2 ms 1560 KB Output is correct
9 Correct 2 ms 1560 KB Output is correct
10 Correct 2 ms 1560 KB Output is correct
11 Correct 2 ms 1568 KB Output is correct
12 Correct 2 ms 1564 KB Output is correct
13 Correct 2 ms 1552 KB Output is correct
14 Correct 2 ms 1560 KB Output is correct
15 Correct 2 ms 1572 KB Output is correct
16 Correct 2 ms 1568 KB Output is correct
17 Correct 2 ms 1560 KB Output is correct
18 Correct 1 ms 1552 KB Output is correct
19 Correct 1 ms 1568 KB Output is correct
20 Correct 2 ms 1568 KB Output is correct
21 Correct 2 ms 1556 KB Output is correct
22 Correct 1 ms 1568 KB Output is correct
23 Correct 2 ms 1568 KB Output is correct
24 Correct 2 ms 1568 KB Output is correct
25 Correct 2 ms 1568 KB Output is correct
26 Correct 2 ms 1568 KB Output is correct
27 Correct 2 ms 1380 KB Output is correct
28 Correct 2 ms 1552 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11632 KB Output is correct
2 Correct 26 ms 12156 KB Output is correct
3 Correct 1 ms 1300 KB Output is correct
4 Correct 20 ms 11384 KB Output is correct
5 Correct 31 ms 12904 KB Output is correct
6 Correct 30 ms 12912 KB Output is correct
7 Correct 25 ms 11900 KB Output is correct
8 Correct 26 ms 11896 KB Output is correct
9 Correct 32 ms 12920 KB Output is correct
10 Correct 32 ms 12868 KB Output is correct
11 Correct 42 ms 13120 KB Output is correct
12 Correct 28 ms 12924 KB Output is correct
13 Correct 31 ms 12936 KB Output is correct
14 Correct 30 ms 12920 KB Output is correct
15 Correct 31 ms 12916 KB Output is correct
16 Correct 31 ms 12928 KB Output is correct
17 Correct 30 ms 12664 KB Output is correct
18 Correct 27 ms 12660 KB Output is correct
19 Correct 31 ms 12664 KB Output is correct
20 Correct 30 ms 12620 KB Output is correct
21 Correct 28 ms 12740 KB Output is correct
22 Correct 28 ms 12560 KB Output is correct
23 Correct 26 ms 11696 KB Output is correct
24 Correct 24 ms 11652 KB Output is correct
25 Correct 26 ms 11900 KB Output is correct
26 Correct 34 ms 11888 KB Output is correct
27 Correct 28 ms 12444 KB Output is correct
28 Correct 28 ms 12420 KB Output is correct
29 Correct 30 ms 12412 KB Output is correct
30 Correct 28 ms 12412 KB Output is correct
31 Correct 25 ms 11632 KB Output is correct
32 Correct 25 ms 11636 KB Output is correct
33 Correct 26 ms 11860 KB Output is correct
34 Correct 25 ms 11908 KB Output is correct
35 Correct 27 ms 12084 KB Output is correct
36 Correct 31 ms 12532 KB Output is correct
37 Correct 27 ms 12148 KB Output is correct
38 Correct 26 ms 12128 KB Output is correct
39 Correct 34 ms 12220 KB Output is correct
40 Correct 27 ms 12152 KB Output is correct
41 Correct 32 ms 12608 KB Output is correct
42 Correct 28 ms 12388 KB Output is correct
43 Correct 28 ms 12668 KB Output is correct
44 Correct 28 ms 12396 KB Output is correct
45 Correct 28 ms 12664 KB Output is correct
46 Correct 28 ms 12480 KB Output is correct
47 Correct 30 ms 11996 KB Output is correct
48 Correct 31 ms 12168 KB Output is correct
49 Correct 26 ms 12152 KB Output is correct
50 Correct 26 ms 12156 KB Output is correct
51 Correct 26 ms 12224 KB Output is correct
52 Correct 25 ms 12152 KB Output is correct
53 Correct 26 ms 11948 KB Output is correct
54 Correct 30 ms 12040 KB Output is correct
55 Correct 26 ms 11968 KB Output is correct
56 Correct 25 ms 12128 KB Output is correct
57 Correct 25 ms 12148 KB Output is correct
58 Correct 25 ms 12152 KB Output is correct
59 Correct 25 ms 11864 KB Output is correct
60 Correct 25 ms 11948 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11632 KB Output is correct
2 Correct 30 ms 12068 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 23 ms 11376 KB Output is correct
5 Correct 30 ms 12924 KB Output is correct
6 Correct 30 ms 12960 KB Output is correct
7 Correct 26 ms 11888 KB Output is correct
8 Correct 31 ms 11852 KB Output is correct
9 Correct 32 ms 12996 KB Output is correct
10 Correct 30 ms 12916 KB Output is correct
11 Correct 33 ms 13176 KB Output is correct
12 Correct 33 ms 12916 KB Output is correct
13 Correct 28 ms 12924 KB Output is correct
14 Correct 30 ms 12824 KB Output is correct
15 Incorrect 32 ms 12908 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -