답안 #960912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960912	2024-04-11T08:19:09 Z	alextodoran	길고양이 (JOI20_stray)	C++17	5 / 100	38 ms	16976 KB

Anthony

#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);
}

}

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;
    assert(M == N - 1);
    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);
    }
    dfs();
    vector <int> X(M);
    copy(color, color + M, X.begin());
    return X;
}

Catherine

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

using namespace std;

namespace {
    vector <int> cols;
    bool passed_test = false;
}

int A, B;

void Init (int _A, int _B) {
    A = _A; B = _B;
}

int Move (vector <int> cnt_col) {
    int now = (cols.empty() == false ? 1 - cols.back() : 1);
    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;
    }
    if (passed_test == false && (int) cols.size() == 6) {
        passed_test = true;
        bool ok;
        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();
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:36:9: warning: 'ok' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |         if (ok == false) {
      |         ^~

Subtask #1

0 / 2.0

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

Subtask #2

0 / 2.0

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

Subtask #3

0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	14492 KB	Output is correct
2	Correct	1 ms	1304 KB	Output is correct
3	Correct	26 ms	13092 KB	Output is correct
4	Correct	35 ms	16220 KB	Output is correct
5	Incorrect	31 ms	16236 KB	Wrong Answer [6]
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	14492 KB	Output is correct
2	Correct	1 ms	1304 KB	Output is correct
3	Correct	26 ms	13092 KB	Output is correct
4	Correct	35 ms	16220 KB	Output is correct
5	Incorrect	31 ms	16236 KB	Wrong Answer [6]
6	Halted	0 ms	0 KB	-

Subtask #5

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	2068 KB	Output is correct
2	Correct	1 ms	1296 KB	Output is correct
3	Correct	2 ms	1564 KB	Output is correct
4	Correct	2 ms	1564 KB	Output is correct
5	Correct	2 ms	1560 KB	Output is correct
6	Correct	2 ms	1556 KB	Output is correct
7	Correct	2 ms	1564 KB	Output is correct
8	Correct	2 ms	1576 KB	Output is correct
9	Correct	2 ms	1572 KB	Output is correct
10	Correct	2 ms	1572 KB	Output is correct
11	Correct	2 ms	1564 KB	Output is correct
12	Correct	2 ms	1572 KB	Output is correct
13	Correct	2 ms	1552 KB	Output is correct
14	Correct	2 ms	1572 KB	Output is correct
15	Correct	2 ms	1560 KB	Output is correct
16	Correct	2 ms	1564 KB	Output is correct
17	Correct	2 ms	1684 KB	Output is correct
18	Correct	2 ms	1564 KB	Output is correct
19	Correct	2 ms	1568 KB	Output is correct
20	Correct	1 ms	1816 KB	Output is correct
21	Correct	2 ms	1564 KB	Output is correct
22	Correct	2 ms	1888 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	1572 KB	Output is correct
26	Correct	2 ms	1564 KB	Output is correct
27	Correct	2 ms	1560 KB	Output is correct
28	Correct	2 ms	1564 KB	Output is correct

Subtask #6

0 / 71.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	11860 KB	Output is correct
2	Correct	27 ms	13168 KB	Output is correct
3	Correct	1 ms	1312 KB	Output is correct
4	Correct	26 ms	11540 KB	Output is correct
5	Correct	38 ms	14756 KB	Output is correct
6	Correct	38 ms	14760 KB	Output is correct
7	Correct	32 ms	13560 KB	Output is correct
8	Correct	26 ms	13560 KB	Output is correct
9	Correct	31 ms	14668 KB	Output is correct
10	Correct	31 ms	14716 KB	Output is correct
11	Correct	33 ms	14680 KB	Output is correct
12	Correct	31 ms	14736 KB	Output is correct
13	Correct	31 ms	14668 KB	Output is correct
14	Correct	31 ms	14684 KB	Output is correct
15	Correct	38 ms	14588 KB	Output is correct
16	Correct	32 ms	14820 KB	Output is correct
17	Correct	32 ms	14420 KB	Output is correct
18	Correct	30 ms	14384 KB	Output is correct
19	Correct	31 ms	14404 KB	Output is correct
20	Correct	38 ms	14568 KB	Output is correct
21	Correct	34 ms	14348 KB	Output is correct
22	Correct	34 ms	14328 KB	Output is correct
23	Correct	30 ms	12172 KB	Output is correct
24	Correct	27 ms	12116 KB	Output is correct
25	Correct	27 ms	12368 KB	Output is correct
26	Correct	27 ms	12360 KB	Output is correct
27	Correct	31 ms	13372 KB	Output is correct
28	Correct	27 ms	13392 KB	Output is correct
29	Correct	30 ms	13648 KB	Output is correct
30	Correct	27 ms	13380 KB	Output is correct
31	Correct	25 ms	11924 KB	Output is correct
32	Correct	25 ms	11848 KB	Output is correct
33	Correct	25 ms	12344 KB	Output is correct
34	Correct	25 ms	12644 KB	Output is correct
35	Correct	28 ms	13068 KB	Output is correct
36	Correct	27 ms	13136 KB	Output is correct
37	Correct	28 ms	13392 KB	Output is correct
38	Correct	28 ms	13388 KB	Output is correct
39	Correct	28 ms	13180 KB	Output is correct
40	Correct	30 ms	13332 KB	Output is correct
41	Correct	31 ms	13852 KB	Output is correct
42	Correct	31 ms	13688 KB	Output is correct
43	Correct	30 ms	14056 KB	Output is correct
44	Correct	28 ms	13924 KB	Output is correct
45	Correct	30 ms	13716 KB	Output is correct
46	Correct	34 ms	13740 KB	Output is correct
47	Correct	26 ms	13120 KB	Output is correct
48	Correct	27 ms	13084 KB	Output is correct
49	Correct	33 ms	13136 KB	Output is correct
50	Correct	26 ms	13052 KB	Output is correct
51	Correct	25 ms	12360 KB	Output is correct
52	Correct	25 ms	12360 KB	Output is correct
53	Correct	30 ms	12352 KB	Output is correct
54	Correct	27 ms	12412 KB	Output is correct
55	Correct	26 ms	12372 KB	Output is correct
56	Correct	27 ms	12228 KB	Output is correct
57	Correct	26 ms	12232 KB	Output is correct
58	Correct	26 ms	12412 KB	Output is correct
59	Correct	26 ms	12096 KB	Output is correct
60	Incorrect	24 ms	12192 KB	Wrong Answer [6]
61	Halted	0 ms	0 KB	-

Subtask #7

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	12300 KB	Output is correct
2	Correct	27 ms	13112 KB	Output is correct
3	Correct	1 ms	1308 KB	Output is correct
4	Correct	26 ms	11440 KB	Output is correct
5	Correct	32 ms	14820 KB	Output is correct
6	Correct	33 ms	14596 KB	Output is correct
7	Incorrect	25 ms	13644 KB	Wrong Answer [6]
8	Halted	0 ms	0 KB	-