oj.uz

Submission #670615

# Submission time Handle Problem Language Result Execution time Memory
670615 2022-12-09T18:39:47 Z rainboy Stray Cat (JOI20_stray) C++17
11 / 100
 46 ms 15372 KB 
#include "Anthony.h"
#include <cstdlib>
#include <vector>

using namespace std;

typedef vector<int> vi;

namespace A {
	int min(int a, int b) { return a < b ? a : b; }
	const int N = 20000;

	int *ej[N], eo[N], dd[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;
			}
		}
	}
}

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 {
	}
	return cc;
}
#include "Catherine.h"
#include <vector>

using namespace std;

typedef vector<int> vi;

namespace {
	int c_;
}

void Init(int a, int b) {
	a = b = a;
	c_ = -1;
}

int Move(vi kk) {
	int a = kk.size();
	if (a == 3) {
		if (c_ != -1)
			kk[c_]++;
		for (int c = 0; c < 3; c++)
			if (kk[(c + 2) % 3] == 0 && kk[c] != 0)
				return c;
	} else
		return -1;
	return -1;
}

Compilation message

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

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 15372 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 15372 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13136 KB Output is correct
2 Correct 0 ms 520 KB Output is correct
3 Correct 27 ms 12708 KB Output is correct
4 Correct 40 ms 14528 KB Output is correct
5 Correct 46 ms 14456 KB Output is correct
6 Correct 34 ms 13056 KB Output is correct
7 Correct 32 ms 13224 KB Output is correct
8 Correct 36 ms 13844 KB Output is correct
9 Correct 37 ms 13900 KB Output is correct
10 Correct 34 ms 13528 KB Output is correct
11 Correct 34 ms 13544 KB Output is correct
12 Correct 34 ms 13616 KB Output is correct
13 Correct 34 ms 13608 KB Output is correct
14 Correct 36 ms 13884 KB Output is correct
15 Correct 39 ms 13936 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13136 KB Output is correct
2 Correct 0 ms 520 KB Output is correct
3 Correct 27 ms 12708 KB Output is correct
4 Correct 40 ms 14528 KB Output is correct
5 Correct 46 ms 14456 KB Output is correct
6 Correct 34 ms 13056 KB Output is correct
7 Correct 32 ms 13224 KB Output is correct
8 Correct 36 ms 13844 KB Output is correct
9 Correct 37 ms 13900 KB Output is correct
10 Correct 34 ms 13528 KB Output is correct
11 Correct 34 ms 13544 KB Output is correct
12 Correct 34 ms 13616 KB Output is correct
13 Correct 34 ms 13608 KB Output is correct
14 Correct 36 ms 13884 KB Output is correct
15 Correct 39 ms 13936 KB Output is correct
16 Correct 27 ms 11588 KB Output is correct
17 Correct 27 ms 11620 KB Output is correct
18 Correct 28 ms 11572 KB Output is correct
19 Correct 28 ms 11560 KB Output is correct
20 Correct 37 ms 12056 KB Output is correct
21 Correct 32 ms 11916 KB Output is correct
22 Correct 35 ms 14096 KB Output is correct
23 Correct 33 ms 11772 KB Output is correct
24 Correct 28 ms 11724 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 780 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 9904 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 9900 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -