oj.uz

답안 #960923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960923 2024-04-11T08:49:52 Z alextodoran 길고양이 (JOI20_stray) C++17
76 / 100
 38 ms 15988 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[0] = 0;
    dfs(0);
}

int dist[N_MAX];
void bfs () {
    fill(dist, dist + N, -1);
    up_edge[0] = N; color[0] = 0;
    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 (M == N - 1) {
        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 now = (cols.empty() == false ? 1 - cols.back() : 0);
        if (cnt_col[now] > 0) {
            cols.push_back(now);
        } else if (cnt_col[1 - now] > 0) {
            cols.push_back(1 - now);
        } else {
            passed_test = true;
            cols = {cols.back()};
            return -1;
        }
        int deg = cnt_col[0] + cnt_col[1] + ((int) cols.size() != 1);
        if (cnt_col[cols.back()] > 1 && deg > 2) {
            if ((int) cols.size() == 1) {
                cols.back() = 1 - cols.back();
            } else {
                passed_test = true;
                cols = {cols.back()};
                return -1;
            }
        }
        if (passed_test == false && (int) cols.size() == 6) {
            passed_test = true;
            bool ok = true;
            for (int i = 0; i < (int) cols.size(); i++) {
                if (cols[i] == 0 && cols[(i + 1) % 6] == 0) {
                    ok = (cols[(i + 2) % 6] != cols[(i + 3) % 6]);
                }
            }
            if (ok == false) {
                cols.pop_back();
                cols = {cols.back()};
                return -1;
            }
        }
        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
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 15988 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 15988 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 13928 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 13928 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11392 KB Output is correct
2 Correct 33 ms 12656 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 20 ms 11380 KB Output is correct
5 Correct 36 ms 14208 KB Output is correct
6 Correct 34 ms 14180 KB Output is correct
7 Correct 27 ms 13448 KB Output is correct
8 Correct 27 ms 13200 KB Output is correct
9 Correct 31 ms 14192 KB Output is correct
10 Correct 31 ms 14488 KB Output is correct
11 Correct 34 ms 14328 KB Output is correct
12 Correct 32 ms 14184 KB Output is correct
13 Correct 34 ms 14288 KB Output is correct
14 Correct 32 ms 14592 KB Output is correct
15 Correct 36 ms 14384 KB Output is correct
16 Correct 31 ms 14200 KB Output is correct
17 Correct 28 ms 13932 KB Output is correct
18 Correct 28 ms 14052 KB Output is correct
19 Correct 33 ms 13844 KB Output is correct
20 Correct 28 ms 13948 KB Output is correct
21 Correct 28 ms 13872 KB Output is correct
22 Correct 33 ms 13940 KB Output is correct
23 Correct 24 ms 11700 KB Output is correct
24 Correct 25 ms 11376 KB Output is correct
25 Correct 24 ms 12156 KB Output is correct
26 Correct 31 ms 12076 KB Output is correct
27 Correct 33 ms 13160 KB Output is correct
28 Correct 27 ms 12936 KB Output is correct
29 Correct 27 ms 12896 KB Output is correct
30 Correct 27 ms 13184 KB Output is correct
31 Correct 24 ms 11376 KB Output is correct
32 Correct 24 ms 11380 KB Output is correct
33 Correct 25 ms 11960 KB Output is correct
34 Correct 26 ms 12156 KB Output is correct
35 Correct 27 ms 12748 KB Output is correct
36 Correct 27 ms 12924 KB Output is correct
37 Correct 27 ms 12920 KB Output is correct
38 Correct 27 ms 13096 KB Output is correct
39 Correct 31 ms 12828 KB Output is correct
40 Correct 26 ms 12760 KB Output is correct
41 Correct 28 ms 13684 KB Output is correct
42 Correct 34 ms 13508 KB Output is correct
43 Correct 32 ms 13608 KB Output is correct
44 Correct 33 ms 13676 KB Output is correct
45 Correct 34 ms 13676 KB Output is correct
46 Correct 28 ms 13756 KB Output is correct
47 Correct 33 ms 12668 KB Output is correct
48 Correct 26 ms 12672 KB Output is correct
49 Correct 30 ms 12664 KB Output is correct
50 Correct 28 ms 12740 KB Output is correct
51 Correct 25 ms 11900 KB Output is correct
52 Correct 24 ms 12112 KB Output is correct
53 Correct 27 ms 12148 KB Output is correct
54 Correct 25 ms 11720 KB Output is correct
55 Correct 26 ms 11644 KB Output is correct
56 Correct 25 ms 11608 KB Output is correct
57 Correct 24 ms 11896 KB Output is correct
58 Correct 25 ms 11892 KB Output is correct
59 Correct 31 ms 11888 KB Output is correct
60 Correct 25 ms 11632 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11384 KB Output is correct
2 Correct 28 ms 12680 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 22 ms 11376 KB Output is correct
5 Correct 34 ms 14160 KB Output is correct
6 Correct 30 ms 14200 KB Output is correct
7 Correct 28 ms 13516 KB Output is correct
8 Correct 27 ms 13176 KB Output is correct
9 Correct 31 ms 14360 KB Output is correct
10 Correct 31 ms 14200 KB Output is correct
11 Correct 30 ms 14788 KB Output is correct
12 Correct 33 ms 14500 KB Output is correct
13 Correct 31 ms 14196 KB Output is correct
14 Correct 31 ms 14360 KB Output is correct
15 Incorrect 38 ms 14308 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -