oj.uz

답안 #960975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960975 2024-04-11T10:21:55 Z alextodoran 길고양이 (JOI20_stray) C++17
91 / 100
 49 ms 17388 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;
    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[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 32 ms 16440 KB Output is correct
2 Correct 1 ms 1388 KB Output is correct
3 Correct 24 ms 15584 KB Output is correct
4 Correct 49 ms 17388 KB Output is correct
5 Correct 34 ms 17220 KB Output is correct
6 Correct 27 ms 16136 KB Output is correct
7 Correct 36 ms 16112 KB Output is correct
8 Correct 38 ms 16808 KB Output is correct
9 Correct 34 ms 16688 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16440 KB Output is correct
2 Correct 1 ms 1388 KB Output is correct
3 Correct 24 ms 15584 KB Output is correct
4 Correct 49 ms 17388 KB Output is correct
5 Correct 34 ms 17220 KB Output is correct
6 Correct 27 ms 16136 KB Output is correct
7 Correct 36 ms 16112 KB Output is correct
8 Correct 38 ms 16808 KB Output is correct
9 Correct 34 ms 16688 KB Output is correct
10 Correct 33 ms 14132 KB Output is correct
11 Correct 31 ms 14144 KB Output is correct
12 Correct 32 ms 13840 KB Output is correct
13 Correct 27 ms 14112 KB Output is correct
14 Correct 26 ms 14376 KB Output is correct
15 Correct 28 ms 14652 KB Output is correct
16 Correct 31 ms 16672 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13872 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 34 ms 13332 KB Output is correct
4 Correct 31 ms 14912 KB Output is correct
5 Correct 46 ms 14968 KB Output is correct
6 Correct 27 ms 13908 KB Output is correct
7 Correct 36 ms 13852 KB Output is correct
8 Correct 31 ms 14420 KB Output is correct
9 Correct 34 ms 14516 KB Output is correct
10 Correct 34 ms 14144 KB Output is correct
11 Correct 38 ms 14144 KB Output is correct
12 Correct 34 ms 14172 KB Output is correct
13 Correct 34 ms 14164 KB Output is correct
14 Correct 43 ms 14412 KB Output is correct
15 Correct 47 ms 14408 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13872 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 34 ms 13332 KB Output is correct
4 Correct 31 ms 14912 KB Output is correct
5 Correct 46 ms 14968 KB Output is correct
6 Correct 27 ms 13908 KB Output is correct
7 Correct 36 ms 13852 KB Output is correct
8 Correct 31 ms 14420 KB Output is correct
9 Correct 34 ms 14516 KB Output is correct
10 Correct 34 ms 14144 KB Output is correct
11 Correct 38 ms 14144 KB Output is correct
12 Correct 34 ms 14172 KB Output is correct
13 Correct 34 ms 14164 KB Output is correct
14 Correct 43 ms 14412 KB Output is correct
15 Correct 47 ms 14408 KB Output is correct
16 Correct 24 ms 12168 KB Output is correct
17 Correct 32 ms 12048 KB Output is correct
18 Correct 26 ms 12024 KB Output is correct
19 Correct 36 ms 12076 KB Output is correct
20 Correct 28 ms 12876 KB Output is correct
21 Correct 27 ms 12476 KB Output is correct
22 Correct 34 ms 14728 KB Output is correct
23 Correct 32 ms 12488 KB Output is correct
24 Correct 27 ms 12360 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 12028 KB Output is correct
2 Correct 26 ms 12692 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 23 ms 11808 KB Output is correct
5 Correct 36 ms 13172 KB Output is correct
6 Correct 37 ms 13116 KB Output is correct
7 Correct 26 ms 12204 KB Output is correct
8 Correct 34 ms 12332 KB Output is correct
9 Correct 37 ms 13300 KB Output is correct
10 Correct 42 ms 13212 KB Output is correct
11 Correct 34 ms 13332 KB Output is correct
12 Correct 44 ms 13256 KB Output is correct
13 Correct 34 ms 13116 KB Output is correct
14 Correct 33 ms 13044 KB Output is correct
15 Correct 34 ms 13188 KB Output is correct
16 Correct 39 ms 13288 KB Output is correct
17 Correct 37 ms 12780 KB Output is correct
18 Correct 34 ms 12952 KB Output is correct
19 Correct 31 ms 12812 KB Output is correct
20 Correct 31 ms 12872 KB Output is correct
21 Correct 30 ms 12792 KB Output is correct
22 Correct 35 ms 12720 KB Output is correct
23 Correct 28 ms 12024 KB Output is correct
24 Correct 30 ms 12024 KB Output is correct
25 Correct 31 ms 12248 KB Output is correct
26 Correct 28 ms 12156 KB Output is correct
27 Correct 30 ms 12728 KB Output is correct
28 Correct 32 ms 12520 KB Output is correct
29 Correct 35 ms 12528 KB Output is correct
30 Correct 27 ms 12556 KB Output is correct
31 Correct 27 ms 11932 KB Output is correct
32 Correct 33 ms 12044 KB Output is correct
33 Correct 33 ms 12300 KB Output is correct
34 Correct 34 ms 12132 KB Output is correct
35 Correct 32 ms 12800 KB Output is correct
36 Correct 27 ms 12824 KB Output is correct
37 Correct 35 ms 12440 KB Output is correct
38 Correct 34 ms 12684 KB Output is correct
39 Correct 35 ms 12608 KB Output is correct
40 Correct 34 ms 12604 KB Output is correct
41 Correct 34 ms 12784 KB Output is correct
42 Correct 33 ms 13084 KB Output is correct
43 Correct 31 ms 12800 KB Output is correct
44 Correct 38 ms 12876 KB Output is correct
45 Correct 36 ms 12868 KB Output is correct
46 Correct 47 ms 12792 KB Output is correct
47 Correct 32 ms 12536 KB Output is correct
48 Correct 27 ms 12280 KB Output is correct
49 Correct 30 ms 12452 KB Output is correct
50 Correct 26 ms 12620 KB Output is correct
51 Correct 27 ms 12352 KB Output is correct
52 Correct 27 ms 12216 KB Output is correct
53 Correct 26 ms 12184 KB Output is correct
54 Correct 27 ms 12280 KB Output is correct
55 Correct 26 ms 12080 KB Output is correct
56 Correct 25 ms 12376 KB Output is correct
57 Correct 30 ms 12228 KB Output is correct
58 Correct 26 ms 12372 KB Output is correct
59 Correct 28 ms 12100 KB Output is correct
60 Correct 25 ms 12192 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12036 KB Output is correct
2 Correct 30 ms 12556 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 22 ms 11824 KB Output is correct
5 Correct 32 ms 13056 KB Output is correct
6 Correct 32 ms 13196 KB Output is correct
7 Correct 31 ms 12064 KB Output is correct
8 Incorrect 24 ms 12268 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -