oj.uz

답안 #960954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960954 2024-04-11T09:49:38 Z alextodoran 길고양이 (JOI20_stray) C++17
91 / 100
 40 ms 17016 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];

void dfs (int u, int chain = -1) {
    if ((int) adj[u].size() == 2 && u != 0) {
        if (chain == -1) {
            chain = 1 - color[up_edge[u]];
        } else {
            chain++;
        }
    } else {
        chain = -1;
    }
    for (int i : adj[u]) {
        if (i != up_edge[u]) {
            int v = other(i, u);
            up_edge[v] = i;
            color[i] = (chain == -1 ? 1 - color[up_edge[u]] : pattern[chain % 6]);
            dfs(v, chain);
        }
    }
}
void dfs () {
    up_edge[0] = N; color[N] = 1;
    dfs(0);
}

int dist[N_MAX];
void bfs () {
    fill(dist, dist + N, -1);
    up_edge[0] = N; color[N] = 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());
    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[0] > 0 ? 0 : 1));
                return cols.back();
            }
            // If not crossroad, take any option
            if (deg == 2) {
                cols.push_back((cnt_col[0] > 0 ? 0 : 1));
                return cols.back();
            }
            // If crossroad, take the only option with frequency 1
            passed_test = true;
            cols.push_back((cnt_col[0] == 1 ? 0 : 1));
            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[0] > 0 ? 0 : 1));
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15984 KB Output is correct
2 Correct 0 ms 1296 KB Output is correct
3 Correct 27 ms 15008 KB Output is correct
4 Correct 35 ms 17016 KB Output is correct
5 Correct 34 ms 17004 KB Output is correct
6 Correct 38 ms 15600 KB Output is correct
7 Correct 30 ms 15668 KB Output is correct
8 Correct 34 ms 16488 KB Output is correct
9 Correct 37 ms 16508 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15984 KB Output is correct
2 Correct 0 ms 1296 KB Output is correct
3 Correct 27 ms 15008 KB Output is correct
4 Correct 35 ms 17016 KB Output is correct
5 Correct 34 ms 17004 KB Output is correct
6 Correct 38 ms 15600 KB Output is correct
7 Correct 30 ms 15668 KB Output is correct
8 Correct 34 ms 16488 KB Output is correct
9 Correct 37 ms 16508 KB Output is correct
10 Correct 26 ms 13536 KB Output is correct
11 Correct 28 ms 13484 KB Output is correct
12 Correct 30 ms 13520 KB Output is correct
13 Correct 31 ms 13544 KB Output is correct
14 Correct 29 ms 13860 KB Output is correct
15 Correct 36 ms 14276 KB Output is correct
16 Correct 31 ms 16732 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13332 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 25 ms 12824 KB Output is correct
4 Correct 37 ms 14756 KB Output is correct
5 Correct 37 ms 14932 KB Output is correct
6 Correct 28 ms 13436 KB Output is correct
7 Correct 28 ms 13432 KB Output is correct
8 Correct 35 ms 14044 KB Output is correct
9 Correct 32 ms 14216 KB Output is correct
10 Correct 36 ms 13876 KB Output is correct
11 Correct 34 ms 13792 KB Output is correct
12 Correct 31 ms 14024 KB Output is correct
13 Correct 35 ms 13708 KB Output is correct
14 Correct 32 ms 14208 KB Output is correct
15 Correct 32 ms 14216 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13332 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 25 ms 12824 KB Output is correct
4 Correct 37 ms 14756 KB Output is correct
5 Correct 37 ms 14932 KB Output is correct
6 Correct 28 ms 13436 KB Output is correct
7 Correct 28 ms 13432 KB Output is correct
8 Correct 35 ms 14044 KB Output is correct
9 Correct 32 ms 14216 KB Output is correct
10 Correct 36 ms 13876 KB Output is correct
11 Correct 34 ms 13792 KB Output is correct
12 Correct 31 ms 14024 KB Output is correct
13 Correct 35 ms 13708 KB Output is correct
14 Correct 32 ms 14208 KB Output is correct
15 Correct 32 ms 14216 KB Output is correct
16 Correct 25 ms 11896 KB Output is correct
17 Correct 27 ms 11736 KB Output is correct
18 Correct 27 ms 11780 KB Output is correct
19 Correct 24 ms 11636 KB Output is correct
20 Correct 33 ms 12316 KB Output is correct
21 Correct 33 ms 12088 KB Output is correct
22 Correct 32 ms 14692 KB Output is correct
23 Correct 30 ms 11872 KB Output is correct
24 Correct 31 ms 11672 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1564 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 2 ms 1560 KB Output is correct
4 Correct 2 ms 1560 KB Output is correct
5 Correct 2 ms 1568 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1552 KB Output is correct
8 Correct 2 ms 1560 KB Output is correct
9 Correct 2 ms 1552 KB Output is correct
10 Correct 2 ms 1560 KB Output is correct
11 Correct 1 ms 1552 KB Output is correct
12 Correct 2 ms 1560 KB Output is correct
13 Correct 2 ms 1568 KB Output is correct
14 Correct 2 ms 1560 KB Output is correct
15 Correct 2 ms 1808 KB Output is correct
16 Correct 2 ms 1564 KB Output is correct
17 Correct 2 ms 1556 KB Output is correct
18 Correct 2 ms 1568 KB Output is correct
19 Correct 1 ms 1560 KB Output is correct
20 Correct 1 ms 1560 KB Output is correct
21 Correct 2 ms 1556 KB Output is correct
22 Correct 2 ms 1552 KB Output is correct
23 Correct 2 ms 1564 KB Output is correct
24 Correct 1 ms 1556 KB Output is correct
25 Correct 2 ms 1552 KB Output is correct
26 Correct 2 ms 1564 KB Output is correct
27 Correct 2 ms 1820 KB Output is correct
28 Correct 2 ms 1560 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 11300 KB Output is correct
2 Correct 27 ms 12668 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 28 ms 11300 KB Output is correct
5 Correct 34 ms 14196 KB Output is correct
6 Correct 33 ms 14284 KB Output is correct
7 Correct 28 ms 13180 KB Output is correct
8 Correct 28 ms 13388 KB Output is correct
9 Correct 32 ms 14204 KB Output is correct
10 Correct 31 ms 14204 KB Output is correct
11 Correct 31 ms 14276 KB Output is correct
12 Correct 33 ms 14400 KB Output is correct
13 Correct 31 ms 14216 KB Output is correct
14 Correct 31 ms 14160 KB Output is correct
15 Correct 31 ms 14212 KB Output is correct
16 Correct 33 ms 14196 KB Output is correct
17 Correct 32 ms 14096 KB Output is correct
18 Correct 28 ms 13928 KB Output is correct
19 Correct 31 ms 13860 KB Output is correct
20 Correct 28 ms 14012 KB Output is correct
21 Correct 28 ms 13948 KB Output is correct
22 Correct 31 ms 13960 KB Output is correct
23 Correct 24 ms 11376 KB Output is correct
24 Correct 24 ms 11384 KB Output is correct
25 Correct 26 ms 12144 KB Output is correct
26 Correct 26 ms 12156 KB Output is correct
27 Correct 27 ms 12836 KB Output is correct
28 Correct 35 ms 12916 KB Output is correct
29 Correct 28 ms 12780 KB Output is correct
30 Correct 32 ms 12812 KB Output is correct
31 Correct 24 ms 11328 KB Output is correct
32 Correct 27 ms 11496 KB Output is correct
33 Correct 25 ms 12200 KB Output is correct
34 Correct 27 ms 12080 KB Output is correct
35 Correct 27 ms 12900 KB Output is correct
36 Correct 30 ms 12728 KB Output is correct
37 Correct 27 ms 12912 KB Output is correct
38 Correct 28 ms 12928 KB Output is correct
39 Correct 28 ms 13296 KB Output is correct
40 Correct 28 ms 12740 KB Output is correct
41 Correct 28 ms 13592 KB Output is correct
42 Correct 28 ms 13724 KB Output is correct
43 Correct 28 ms 13692 KB Output is correct
44 Correct 30 ms 13644 KB Output is correct
45 Correct 28 ms 13692 KB Output is correct
46 Correct 38 ms 13580 KB Output is correct
47 Correct 27 ms 12596 KB Output is correct
48 Correct 27 ms 12640 KB Output is correct
49 Correct 28 ms 12620 KB Output is correct
50 Correct 32 ms 12596 KB Output is correct
51 Correct 26 ms 11920 KB Output is correct
52 Correct 27 ms 11564 KB Output is correct
53 Correct 31 ms 11644 KB Output is correct
54 Correct 25 ms 11632 KB Output is correct
55 Correct 25 ms 11900 KB Output is correct
56 Correct 25 ms 11636 KB Output is correct
57 Correct 27 ms 11928 KB Output is correct
58 Correct 28 ms 11920 KB Output is correct
59 Correct 25 ms 11816 KB Output is correct
60 Correct 28 ms 11572 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11376 KB Output is correct
2 Correct 27 ms 12472 KB Output is correct
3 Correct 0 ms 1296 KB Output is correct
4 Correct 25 ms 11372 KB Output is correct
5 Correct 33 ms 14348 KB Output is correct
6 Correct 32 ms 14200 KB Output is correct
7 Correct 27 ms 13176 KB Output is correct
8 Incorrect 25 ms 13252 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -