oj.uz

답안 #960996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960996 2024-04-11T10:55:06 Z alextodoran 길고양이 (JOI20_stray) C++17
91 / 100
 43 ms 17360 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) {
            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 = {cols.back()};
                    return -1;
                }
            }
            cols.push_back((cnt_col[0] > 0 ? 0 : 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 31 ms 16460 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 30 ms 15668 KB Output is correct
4 Correct 40 ms 17196 KB Output is correct
5 Correct 40 ms 17360 KB Output is correct
6 Correct 28 ms 16248 KB Output is correct
7 Correct 30 ms 16212 KB Output is correct
8 Correct 34 ms 16720 KB Output is correct
9 Correct 43 ms 16708 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16460 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 30 ms 15668 KB Output is correct
4 Correct 40 ms 17196 KB Output is correct
5 Correct 40 ms 17360 KB Output is correct
6 Correct 28 ms 16248 KB Output is correct
7 Correct 30 ms 16212 KB Output is correct
8 Correct 34 ms 16720 KB Output is correct
9 Correct 43 ms 16708 KB Output is correct
10 Correct 31 ms 14184 KB Output is correct
11 Correct 26 ms 14152 KB Output is correct
12 Correct 26 ms 14220 KB Output is correct
13 Correct 33 ms 14068 KB Output is correct
14 Correct 34 ms 14332 KB Output is correct
15 Correct 32 ms 14584 KB Output is correct
16 Correct 33 ms 16716 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13700 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 23 ms 13356 KB Output is correct
4 Correct 35 ms 15080 KB Output is correct
5 Correct 32 ms 15108 KB Output is correct
6 Correct 26 ms 13800 KB Output is correct
7 Correct 27 ms 13884 KB Output is correct
8 Correct 35 ms 14676 KB Output is correct
9 Correct 30 ms 14316 KB Output is correct
10 Correct 30 ms 14588 KB Output is correct
11 Correct 31 ms 14152 KB Output is correct
12 Correct 30 ms 14388 KB Output is correct
13 Correct 30 ms 14016 KB Output is correct
14 Correct 31 ms 14412 KB Output is correct
15 Correct 39 ms 14328 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13700 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 23 ms 13356 KB Output is correct
4 Correct 35 ms 15080 KB Output is correct
5 Correct 32 ms 15108 KB Output is correct
6 Correct 26 ms 13800 KB Output is correct
7 Correct 27 ms 13884 KB Output is correct
8 Correct 35 ms 14676 KB Output is correct
9 Correct 30 ms 14316 KB Output is correct
10 Correct 30 ms 14588 KB Output is correct
11 Correct 31 ms 14152 KB Output is correct
12 Correct 30 ms 14388 KB Output is correct
13 Correct 30 ms 14016 KB Output is correct
14 Correct 31 ms 14412 KB Output is correct
15 Correct 39 ms 14328 KB Output is correct
16 Correct 25 ms 12096 KB Output is correct
17 Correct 24 ms 12088 KB Output is correct
18 Correct 25 ms 12108 KB Output is correct
19 Correct 25 ms 12096 KB Output is correct
20 Correct 27 ms 12764 KB Output is correct
21 Correct 27 ms 12624 KB Output is correct
22 Correct 28 ms 14748 KB Output is correct
23 Correct 34 ms 12272 KB Output is correct
24 Correct 33 ms 12256 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 1564 KB Output is correct
3 Correct 2 ms 1568 KB Output is correct
4 Correct 2 ms 1568 KB Output is correct
5 Correct 2 ms 1572 KB Output is correct
6 Correct 2 ms 1564 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 2 ms 1556 KB Output is correct
9 Correct 2 ms 1560 KB Output is correct
10 Correct 2 ms 1568 KB Output is correct
11 Correct 1 ms 1564 KB Output is correct
12 Correct 2 ms 1564 KB Output is correct
13 Correct 2 ms 1560 KB Output is correct
14 Correct 1 ms 1568 KB Output is correct
15 Correct 2 ms 1548 KB Output is correct
16 Correct 2 ms 1560 KB Output is correct
17 Correct 2 ms 1552 KB Output is correct
18 Correct 2 ms 1568 KB Output is correct
19 Correct 1 ms 1568 KB Output is correct
20 Correct 2 ms 1560 KB Output is correct
21 Correct 2 ms 1560 KB Output is correct
22 Correct 2 ms 1820 KB Output is correct
23 Correct 2 ms 1552 KB Output is correct
24 Correct 2 ms 1568 KB Output is correct
25 Correct 2 ms 1572 KB Output is correct
26 Correct 2 ms 1568 KB Output is correct
27 Correct 2 ms 1568 KB Output is correct
28 Correct 2 ms 1560 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11548 KB Output is correct
2 Correct 27 ms 12160 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 22 ms 11288 KB Output is correct
5 Correct 32 ms 12924 KB Output is correct
6 Correct 32 ms 12884 KB Output is correct
7 Correct 25 ms 11904 KB Output is correct
8 Correct 26 ms 11900 KB Output is correct
9 Correct 31 ms 12880 KB Output is correct
10 Correct 32 ms 12928 KB Output is correct
11 Correct 30 ms 12880 KB Output is correct
12 Correct 30 ms 13176 KB Output is correct
13 Correct 28 ms 13000 KB Output is correct
14 Correct 32 ms 12684 KB Output is correct
15 Correct 33 ms 12888 KB Output is correct
16 Correct 31 ms 12928 KB Output is correct
17 Correct 28 ms 12908 KB Output is correct
18 Correct 27 ms 12672 KB Output is correct
19 Correct 34 ms 12300 KB Output is correct
20 Correct 28 ms 12672 KB Output is correct
21 Correct 28 ms 12664 KB Output is correct
22 Correct 28 ms 12580 KB Output is correct
23 Correct 26 ms 11640 KB Output is correct
24 Correct 25 ms 11624 KB Output is correct
25 Correct 26 ms 11892 KB Output is correct
26 Correct 25 ms 11896 KB Output is correct
27 Correct 27 ms 12400 KB Output is correct
28 Correct 30 ms 12408 KB Output is correct
29 Correct 31 ms 12412 KB Output is correct
30 Correct 27 ms 12368 KB Output is correct
31 Correct 25 ms 11632 KB Output is correct
32 Correct 26 ms 11624 KB Output is correct
33 Correct 26 ms 11892 KB Output is correct
34 Correct 25 ms 11900 KB Output is correct
35 Correct 31 ms 12904 KB Output is correct
36 Correct 26 ms 12404 KB Output is correct
37 Correct 26 ms 12400 KB Output is correct
38 Correct 34 ms 12392 KB Output is correct
39 Correct 28 ms 12420 KB Output is correct
40 Correct 28 ms 12132 KB Output is correct
41 Correct 31 ms 12668 KB Output is correct
42 Correct 34 ms 12656 KB Output is correct
43 Correct 32 ms 12652 KB Output is correct
44 Correct 30 ms 12668 KB Output is correct
45 Correct 27 ms 12436 KB Output is correct
46 Correct 28 ms 12668 KB Output is correct
47 Correct 35 ms 12148 KB Output is correct
48 Correct 27 ms 12160 KB Output is correct
49 Correct 27 ms 12036 KB Output is correct
50 Correct 33 ms 12076 KB Output is correct
51 Correct 27 ms 11932 KB Output is correct
52 Correct 26 ms 11864 KB Output is correct
53 Correct 27 ms 12052 KB Output is correct
54 Correct 26 ms 11904 KB Output is correct
55 Correct 30 ms 11892 KB Output is correct
56 Correct 25 ms 11856 KB Output is correct
57 Correct 29 ms 12148 KB Output is correct
58 Correct 25 ms 12152 KB Output is correct
59 Correct 26 ms 11908 KB Output is correct
60 Correct 26 ms 11892 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 11624 KB Output is correct
2 Correct 33 ms 12156 KB Output is correct
3 Correct 1 ms 1292 KB Output is correct
4 Correct 27 ms 11400 KB Output is correct
5 Correct 31 ms 12920 KB Output is correct
6 Correct 30 ms 13036 KB Output is correct
7 Correct 32 ms 12224 KB Output is correct
8 Incorrect 25 ms 11884 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -