oj.uz

답안 #670633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670633 2022-12-09T19:19:02 Z rainboy 길고양이 (JOI20_stray) C++17
20 / 100
 60 ms 16284 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[j] == 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 B {
	const int zz[] = { 0, 1, 0, 0, 1, 1 };
	int cc[6], h, c_;
}

void Init(int a, int b) {
	a = b = a;
	B::h = 0, B::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 = B::c_ != -1 ? 1 : 0;
		for (int c = 0; c < 2; c++)
			d += kk[c];
		if (d == 1) {
			B::h = -1;
			for (int c = 0; c < 2; c++)
				if (kk[c] != 0)
					return B::c_ = c;
			return -1;
		} else if (d == 2) {
			if (B::h == -1) {
				for (int c = 0; c < 2; c++)
					if (kk[c] != 0)
						return B::c_ = c;
				return -1;
			} else {
				for (int c = 0; c < 2; c++)
					if (kk[c] != 0)
						B::cc[B::h++] = c;
				if (B::h < 5)
					return B::c_ = B::cc[B::h - 1];
				else {
					for (int g = 0; g < 6; g++) {
						int match = 1;
						for (int h = 0; h < 5; h++)
							if (B::zz[(g + h) % 6]) {
								match = 0;
								break;
							}
						if (match) {
							B::h = -1;
							return -1;
						}
					}
					B::h = -1;
					return B::c_ = B::cc[4];
				}
			}
		} else {
			B::h = -1;
			return B::c_ == -1 ? (kk[0] == 1 ? 0 : 1) : kk[B::c_] == 0 ? -1 : (B::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 37 ms 15072 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 31 ms 14572 KB Output is correct
4 Correct 60 ms 16236 KB Output is correct
5 Correct 54 ms 16284 KB Output is correct
6 Correct 42 ms 15060 KB Output is correct
7 Correct 34 ms 14904 KB Output is correct
8 Correct 53 ms 15756 KB Output is correct
9 Correct 49 ms 15680 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 15072 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 31 ms 14572 KB Output is correct
4 Correct 60 ms 16236 KB Output is correct
5 Correct 54 ms 16284 KB Output is correct
6 Correct 42 ms 15060 KB Output is correct
7 Correct 34 ms 14904 KB Output is correct
8 Correct 53 ms 15756 KB Output is correct
9 Correct 49 ms 15680 KB Output is correct
10 Correct 31 ms 13160 KB Output is correct
11 Correct 31 ms 12928 KB Output is correct
12 Correct 32 ms 13068 KB Output is correct
13 Correct 32 ms 13020 KB Output is correct
14 Correct 32 ms 13144 KB Output is correct
15 Correct 35 ms 13532 KB Output is correct
16 Correct 44 ms 15952 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 12828 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 28 ms 12400 KB Output is correct
4 Correct 41 ms 14044 KB Output is correct
5 Correct 48 ms 14252 KB Output is correct
6 Correct 31 ms 12884 KB Output is correct
7 Correct 32 ms 12784 KB Output is correct
8 Correct 36 ms 13420 KB Output is correct
9 Correct 36 ms 13400 KB Output is correct
10 Correct 37 ms 13200 KB Output is correct
11 Correct 34 ms 13172 KB Output is correct
12 Correct 40 ms 13180 KB Output is correct
13 Correct 35 ms 13216 KB Output is correct
14 Correct 36 ms 13412 KB Output is correct
15 Correct 36 ms 13460 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 12828 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 28 ms 12400 KB Output is correct
4 Correct 41 ms 14044 KB Output is correct
5 Correct 48 ms 14252 KB Output is correct
6 Correct 31 ms 12884 KB Output is correct
7 Correct 32 ms 12784 KB Output is correct
8 Correct 36 ms 13420 KB Output is correct
9 Correct 36 ms 13400 KB Output is correct
10 Correct 37 ms 13200 KB Output is correct
11 Correct 34 ms 13172 KB Output is correct
12 Correct 40 ms 13180 KB Output is correct
13 Correct 35 ms 13216 KB Output is correct
14 Correct 36 ms 13412 KB Output is correct
15 Correct 36 ms 13460 KB Output is correct
16 Correct 26 ms 11208 KB Output is correct
17 Correct 27 ms 11256 KB Output is correct
18 Correct 28 ms 11176 KB Output is correct
19 Correct 31 ms 11312 KB Output is correct
20 Correct 32 ms 11772 KB Output is correct
21 Correct 31 ms 11484 KB Output is correct
22 Correct 36 ms 13548 KB Output is correct
23 Correct 30 ms 11208 KB Output is correct
24 Correct 30 ms 11344 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 11028 KB Output is correct
2 Correct 33 ms 12708 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 25 ms 11164 KB Output is correct
5 Correct 38 ms 14320 KB Output is correct
6 Correct 37 ms 14380 KB Output is correct
7 Incorrect 28 ms 13504 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 11044 KB Output is correct
2 Correct 32 ms 12592 KB Output is correct
3 Correct 0 ms 592 KB Output is correct
4 Correct 25 ms 11116 KB Output is correct
5 Correct 38 ms 14360 KB Output is correct
6 Correct 37 ms 14468 KB Output is correct
7 Correct 31 ms 13560 KB Output is correct
8 Correct 36 ms 13780 KB Output is correct
9 Correct 38 ms 14340 KB Output is correct
10 Correct 37 ms 14416 KB Output is correct
11 Correct 37 ms 14356 KB Output is correct
12 Correct 36 ms 14392 KB Output is correct
13 Correct 37 ms 14460 KB Output is correct
14 Correct 37 ms 14404 KB Output is correct
15 Incorrect 34 ms 14348 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -