oj.uz

답안 #670641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670641 2022-12-09T19:30:41 Z rainboy 길고양이 (JOI20_stray) C++17
91 / 100
 45 ms 16308 KB 
#include "Anthony.h"
#include <cstdlib>
#include <vector>

using namespace std;

typedef vector<int> vi;

namespace A {
	const int N = 20000;
	const int zz[] = { 0, 1, 0, 0, 1, 1 };

	int min(int a, int b) { return a < b ? a : b; }

	int *ej[N], eo[N], dd[N], pp[N], cc_[N], qu[N], n;

	void init(int n_) {
		n = n_;
		for (int i = 0; i < n; i++)
			ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	}

	void append(int i, int j) {
		int o = eo[i]++;
		if (o >= 2 && (o & o - 1) == 0)
			ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
		ej[i][o] = j;
	}

	void bfs() {
		for (int i = 0; i < n; i++)
			dd[i] = n;
		int cnt = 0;
		dd[0] = 0, qu[cnt++] = 0;
		for (int h = 0; h < cnt; h++) {
			int i = qu[h], d = dd[i] + 1;
			for (int o = eo[i]; o--; ) {
				int j = ej[i][o];
				if (dd[j] > d)
					dd[j] = d, qu[cnt++] = j;
			}
		}
	}
	void dfs(int p, int i, int c) {
		pp[i] = p;
		for (int o = eo[i]; o--; ) {
			int j = ej[i][o];
			if (j != p) {
				if (p == -1)
					cc_[j] = 0, dfs(i, j, 0);
				else if (eo[i] == 2)
					cc_[j] = zz[(c + 1) % 6], dfs(i, j, (c + 1) % 6);
				else
					cc_[j] = zz[c % 6] ^ 1, dfs(i, j, zz[c % 6] ^ 1);
			}
		}
	}
}

vi Mark(int n, int m, int a, int b, vi uu, vi vv) {
	vi cc(m);
	if (a >= 3 && b == 0) {
		A::init(n);
		for (int h = 0; h < m; h++)
			A::append(uu[h], vv[h]), A::append(vv[h], uu[h]);
		A::bfs();
		for (int h = 0; h < m; h++)
			cc[h] = A::min(A::dd[uu[h]], A::dd[vv[h]]) % 3;
	} else {
		A::init(n);
		for (int h = 0; h < m; h++)
			A::append(uu[h], vv[h]), A::append(vv[h], uu[h]);
		A::dfs(-1, 0, -1);
		for (int h = 0; h < m; h++) {
			int i = A::pp[uu[h]] == vv[h] ? uu[h] : vv[h];
			cc[h] = A::cc_[i];
		}
	}
	return cc;
}
#include "Catherine.h"
#include <vector>

using namespace std;

typedef vector<int> vi;

namespace C {
	const int zz[] = { 0, 1, 0, 0, 1, 1 };
	int cc[6], h, c_;
}

void Init(int a, int b) {
	a = b = a;
	C::h = 0, C::c_ = -1;
}

int Move(vi kk) {
	int a = kk.size();
	if (a >= 3) {
		for (int c = 0; c < 3; c++)
			if (kk[(c + 2) % 3] == 0 && kk[c] != 0)
				return c;
		return -1;
	} else {
		int d = C::c_ != -1 ? 1 : 0;
		for (int c = 0; c < 2; c++)
			d += kk[c];
		if (d == 1) {
			C::h = -1;
			for (int c = 0; c < 2; c++)
				if (kk[c] != 0)
					return C::c_ = c;
			return -1;
		} else if (d == 2) {
			if (C::h == -1) {
				for (int c = 0; c < 2; c++)
					if (kk[c] != 0)
						return C::c_ = c;
				return -1;
			} else {
				for (int c = 0; c < 2; c++)
					if (kk[c] != 0)
						C::cc[C::h++] = c;
				if (C::h < 5)
					return C::c_ = C::cc[C::h - 1];
				else {
					for (int g = 0; g < 6; g++) {
						int match = 1;
						for (int h = 0; h < 5; h++)
							if (C::cc[h] != C::zz[(g + h) % 6]) {
								match = 0;
								break;
							}
						if (match) {
							C::h = -1;
							return -1;
						}
					}
					C::h = -1;
					return C::c_ = C::cc[4];
				}
			}
		} else {
			C::h = -1;
			return C::c_ == -1 ? (kk[0] == 1 ? 0 : 1) : kk[C::c_] == 0 ? -1 : (C::c_ ^= 1);
		}
	}
}

Compilation message

Anthony.cpp: In function 'void A::append(int, int)':
Anthony.cpp:25:24: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   25 |   if (o >= 2 && (o & o - 1) == 0)
      |                      ~~^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15212 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 26 ms 14568 KB Output is correct
4 Correct 42 ms 16248 KB Output is correct
5 Correct 41 ms 16308 KB Output is correct
6 Correct 33 ms 14956 KB Output is correct
7 Correct 32 ms 15000 KB Output is correct
8 Correct 38 ms 15704 KB Output is correct
9 Correct 41 ms 15684 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15212 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 26 ms 14568 KB Output is correct
4 Correct 42 ms 16248 KB Output is correct
5 Correct 41 ms 16308 KB Output is correct
6 Correct 33 ms 14956 KB Output is correct
7 Correct 32 ms 15000 KB Output is correct
8 Correct 38 ms 15704 KB Output is correct
9 Correct 41 ms 15684 KB Output is correct
10 Correct 28 ms 12972 KB Output is correct
11 Correct 30 ms 13032 KB Output is correct
12 Correct 30 ms 13128 KB Output is correct
13 Correct 31 ms 13088 KB Output is correct
14 Correct 30 ms 13296 KB Output is correct
15 Correct 35 ms 13660 KB Output is correct
16 Correct 45 ms 15948 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 12804 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 26 ms 12364 KB Output is correct
4 Correct 41 ms 14048 KB Output is correct
5 Correct 40 ms 14112 KB Output is correct
6 Correct 31 ms 12784 KB Output is correct
7 Correct 30 ms 12748 KB Output is correct
8 Correct 34 ms 13440 KB Output is correct
9 Correct 36 ms 13356 KB Output is correct
10 Correct 35 ms 13168 KB Output is correct
11 Correct 35 ms 13156 KB Output is correct
12 Correct 35 ms 13160 KB Output is correct
13 Correct 35 ms 13204 KB Output is correct
14 Correct 37 ms 13372 KB Output is correct
15 Correct 38 ms 13404 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 12804 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 26 ms 12364 KB Output is correct
4 Correct 41 ms 14048 KB Output is correct
5 Correct 40 ms 14112 KB Output is correct
6 Correct 31 ms 12784 KB Output is correct
7 Correct 30 ms 12748 KB Output is correct
8 Correct 34 ms 13440 KB Output is correct
9 Correct 36 ms 13356 KB Output is correct
10 Correct 35 ms 13168 KB Output is correct
11 Correct 35 ms 13156 KB Output is correct
12 Correct 35 ms 13160 KB Output is correct
13 Correct 35 ms 13204 KB Output is correct
14 Correct 37 ms 13372 KB Output is correct
15 Correct 38 ms 13404 KB Output is correct
16 Correct 28 ms 11204 KB Output is correct
17 Correct 27 ms 11236 KB Output is correct
18 Correct 30 ms 11220 KB Output is correct
19 Correct 33 ms 11100 KB Output is correct
20 Correct 32 ms 11740 KB Output is correct
21 Correct 30 ms 11496 KB Output is correct
22 Correct 36 ms 13676 KB Output is correct
23 Correct 28 ms 11204 KB Output is correct
24 Correct 30 ms 11208 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 912 KB Output is correct
2 Correct 0 ms 528 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 2 ms 896 KB Output is correct
6 Correct 1 ms 904 KB Output is correct
7 Correct 1 ms 896 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 904 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 2 ms 904 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 2 ms 896 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 2 ms 892 KB Output is correct
19 Correct 1 ms 896 KB Output is correct
20 Correct 1 ms 904 KB Output is correct
21 Correct 2 ms 900 KB Output is correct
22 Correct 1 ms 904 KB Output is correct
23 Correct 2 ms 904 KB Output is correct
24 Correct 1 ms 916 KB Output is correct
25 Correct 1 ms 904 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 2 ms 896 KB Output is correct
28 Correct 2 ms 932 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 10964 KB Output is correct
2 Correct 33 ms 12244 KB Output is correct
3 Correct 0 ms 516 KB Output is correct
4 Correct 27 ms 10860 KB Output is correct
5 Correct 39 ms 13992 KB Output is correct
6 Correct 41 ms 13916 KB Output is correct
7 Correct 32 ms 13180 KB Output is correct
8 Correct 32 ms 13452 KB Output is correct
9 Correct 39 ms 14312 KB Output is correct
10 Correct 39 ms 14432 KB Output is correct
11 Correct 38 ms 14484 KB Output is correct
12 Correct 36 ms 14448 KB Output is correct
13 Correct 41 ms 14452 KB Output is correct
14 Correct 40 ms 14424 KB Output is correct
15 Correct 37 ms 14384 KB Output is correct
16 Correct 39 ms 14396 KB Output is correct
17 Correct 36 ms 14160 KB Output is correct
18 Correct 34 ms 14092 KB Output is correct
19 Correct 34 ms 14184 KB Output is correct
20 Correct 39 ms 14128 KB Output is correct
21 Correct 34 ms 14056 KB Output is correct
22 Correct 34 ms 14124 KB Output is correct
23 Correct 28 ms 11364 KB Output is correct
24 Correct 30 ms 11432 KB Output is correct
25 Correct 32 ms 11860 KB Output is correct
26 Correct 30 ms 11920 KB Output is correct
27 Correct 34 ms 12900 KB Output is correct
28 Correct 44 ms 12904 KB Output is correct
29 Correct 35 ms 12948 KB Output is correct
30 Correct 34 ms 12880 KB Output is correct
31 Correct 28 ms 11436 KB Output is correct
32 Correct 31 ms 11340 KB Output is correct
33 Correct 28 ms 11832 KB Output is correct
34 Correct 30 ms 11948 KB Output is correct
35 Correct 34 ms 12740 KB Output is correct
36 Correct 33 ms 12844 KB Output is correct
37 Correct 34 ms 12784 KB Output is correct
38 Correct 34 ms 12772 KB Output is correct
39 Correct 42 ms 12656 KB Output is correct
40 Correct 37 ms 12696 KB Output is correct
41 Correct 37 ms 13412 KB Output is correct
42 Correct 36 ms 13448 KB Output is correct
43 Correct 36 ms 13452 KB Output is correct
44 Correct 35 ms 13492 KB Output is correct
45 Correct 36 ms 13484 KB Output is correct
46 Correct 35 ms 13528 KB Output is correct
47 Correct 33 ms 12556 KB Output is correct
48 Correct 32 ms 12492 KB Output is correct
49 Correct 34 ms 12428 KB Output is correct
50 Correct 33 ms 12576 KB Output is correct
51 Correct 30 ms 11632 KB Output is correct
52 Correct 30 ms 11708 KB Output is correct
53 Correct 30 ms 11732 KB Output is correct
54 Correct 31 ms 11572 KB Output is correct
55 Correct 34 ms 11656 KB Output is correct
56 Correct 28 ms 11732 KB Output is correct
57 Correct 30 ms 11540 KB Output is correct
58 Correct 31 ms 11524 KB Output is correct
59 Correct 33 ms 11712 KB Output is correct
60 Correct 31 ms 11784 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 10980 KB Output is correct
2 Correct 32 ms 12336 KB Output is correct
3 Correct 0 ms 516 KB Output is correct
4 Correct 27 ms 10920 KB Output is correct
5 Correct 40 ms 14012 KB Output is correct
6 Correct 38 ms 14036 KB Output is correct
7 Correct 36 ms 13168 KB Output is correct
8 Correct 32 ms 13460 KB Output is correct
9 Correct 44 ms 14380 KB Output is correct
10 Correct 40 ms 14376 KB Output is correct
11 Correct 41 ms 14476 KB Output is correct
12 Correct 45 ms 14388 KB Output is correct
13 Correct 38 ms 14036 KB Output is correct
14 Correct 38 ms 14372 KB Output is correct
15 Incorrect 40 ms 14536 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -