oj.uz

답안 #537155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537155 2022-03-14T16:23:29 Z rainboy 한자 끝말잇기 (JOI14_kanji) C
0 / 100
 159 ms 14724 KB 
#include "Annalib.h"

#define N	300
#define C	5
#define INF	0x3f3f3f3f3f3f3f3fLL

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

void Anna(int n, int m, int *uu, int *vv, long long *ww, int q, int *ss, int *tt, int c, int *hh) {
	long long ww_[N][N], dd_[N][N], xx_[C + 1][C + 1], dd1[C + 1], dd2[C + 1], ee[C + 1];
	int hh_[C + 1][C + 1], pp[C + 1];
	int g, g_, g1, g2, h, h_, i, j, k, u, v;

	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			ww_[i][j] = INF;
	for (h = 0; h < m; h++) {
		u = uu[h], v = vv[h];
		ww_[u][v] = ww[h];
	}
	for (g = 0; g < c; g++) {
		h = hh[g], u = uu[h], v = vv[h];
		ww_[u][v] = INF;
	}
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			dd_[i][j] = i == j ? 0 : ww_[i][j];
	for (k = 0; k < n; k++)
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				dd_[i][j] = min(dd_[i][j], dd_[i][k] + dd_[k][j]);
	for (g1 = 0; g1 <= c; g1++)
		for (g2 = 0; g2 <= c; g2++)
			xx_[g1][g2] = -INF, hh_[g1][g2] = -1;
	for (h = 0; h < q; h++) {
		i = ss[h], j = tt[h];
		for (g = 0; g < c; g++) {
			h_ = hh[g], u = uu[h_], v = vv[h_];
			dd1[g] = min(dd_[i][u] + dd_[v][j], INF), dd2[g] = min(dd1[g] + ww[h_], INF);
		}
		dd1[c] = dd2[c] = dd_[i][j];
		g_ = -1;
		for (g = 0; g <= c; g++)
			if (g_ == -1 || dd2[g_] > dd2[g])
				g_ = g;
		for (g = 0; g <= c; g++)
			if (dd2[g] > dd2[g_]) {
				long long x = dd1[g_] - dd1[g] + 1;

				if (xx_[g_][g] < x)
					xx_[g_][g] = x, hh_[g_][g] = h;
			}
	}
	for (g = 0; g <= c; g++)
		ee[g] = 0, pp[g] = -1;
	while (1) {
		int updated;
		long long e;

		updated = 0;
		for (g1 = 0; g1 <= c; g1++)
			for (g2 = 0; g2 <= c; g2++)
				if (ee[g2] < (e = ee[g1] + xx_[g1][g2]))
					ee[g2] = e, pp[g2] = g1, updated = 1;
		if (!updated)
			break;
	}
	for (g = 0; g < c; g++) {
		int p = pp[g], f = p == -1 ? -1 : hh_[p][g], t;

		if (p == -1)
			p = c + 1;
		if (f == -1)
			f = q;
		for (t = 0; t < 3; t++)
			Tap(p >> t & 1);
		for (t = 0; t < 6; t++)
			Tap(f >> t & 1);
	}
}
#include "Brunolib.h"

#define N	300
#define Q	60
#define C	5
#define INF	0x3f3f3f3f3f3f3f3fLL

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

static long long weight(long long xx[][C + 1][C + 1], int *pp, int *ff, int g) {
	return pp[g] == -1 ? 0 : weight(xx, pp, ff, pp[g]) + (ff[g] == -1 ? -INF : xx[ff[g]][pp[g]][g]);
}

static void print(long long dd[][N], long long ww[][N], int hh[][N], int n, int i, int j) {
	int k;

	if (i == j)
		return;
	for (k = 0; k < n; k++)
		if (dd[i][k] + ww[k][j] == dd[i][j]) {
			print(dd, ww, hh, n, i, k), Answer(hh[k][j]);
			return;
		}
}

void Bruno(int n, int m, int *uu, int *vv, long long *ww, int q, int *ss, int *tt, int c, int *hh, int len, int *buf) {
	long long ww_[N][N], dd_[N][N], xx_[Q][C + 1][C + 1], dd1[C + 1], ee[C + 1];
	int hh_[N][N], pp[C + 1], ff[C + 1];
	int g, g1, g2, h, h_, i, j, k, u, v;

	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			ww_[i][j] = INF;
	for (h = 0; h < m; h++) {
		u = uu[h], v = vv[h];
		ww_[u][v] = ww[h], hh_[u][v] = h;
	}
	for (g = 0; g < c; g++) {
		h = hh[g], u = uu[h], v = vv[h];
		ww_[u][v] = INF;
	}
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			dd_[i][j] = i == j ? 0 : ww_[i][j];
	for (k = 0; k < n; k++)
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				dd_[i][j] = min(dd_[i][j], dd_[i][k] + dd_[k][j]);
	for (h = 0; h < q; h++) {
		i = ss[h], j = tt[h];
		for (g = 0; g < c; g++) {
			h_ = hh[g], u = uu[h_], v = vv[h_];
			dd1[g] = min(dd_[i][u] + dd_[v][j], INF);
		}
		dd1[c] = dd_[i][j];
		for (g1 = 0; g1 < c; g1++)
			for (g2 = 0; g2 < c; g2++)
				xx_[h][g1][g2] = dd1[g1] - dd1[g2] + 1;
	}
	pp[c] = -1, ff[c] = -1;
	for (g = 0; g < c; g++) {
		int t;

		pp[g] = 0;
		for (t = 0; t < 3; t++)
			if (buf[g * 9 + t])
				pp[g] |= 1 << t;
		ff[g] = 0;
		for (t = 0; t < 6; t++)
			if (buf[g * 9 + 3 + t])
				ff[g] |= 1 << t;
		if (pp[g] == c + 1)
			pp[g] = -1;
		if (ff[g] == q)
			ff[g] = -1;
	}
	for (g = 0; g < c; g++)
		ee[g] = weight(xx_, pp, ff, g);
	for (g = 0; g < c; g++) {
		h = hh[g], u = uu[h], v = vv[h];
		ww_[u][v] = ee[g];
	}
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			dd_[i][j] = i == j ? 0 : ww_[i][j];
	for (k = 0; k < n; k++)
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
				dd_[i][j] = min(dd_[i][j], dd_[i][k] + dd_[k][j]);
	for (h = 0; h < q; h++) {
		i = ss[h], j = tt[h];
		print(dd_, ww_, hh_, n, i, j), Answer(-1);
	}
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 7400 KB Output is correct - L = 45
2 Correct 98 ms 7416 KB Output is correct - L = 45
3 Correct 83 ms 7400 KB Output is correct - L = 45
4 Correct 85 ms 7396 KB Output is correct - L = 45
5 Correct 98 ms 7388 KB Output is correct - L = 45
6 Correct 90 ms 7300 KB Output is correct - L = 45
7 Correct 84 ms 7380 KB Output is correct - L = 45
8 Correct 82 ms 7468 KB Output is correct - L = 45
9 Correct 89 ms 7484 KB Output is correct - L = 45
10 Correct 100 ms 7668 KB Output is correct - L = 45
11 Correct 86 ms 7364 KB Output is correct - L = 45
12 Incorrect 159 ms 14440 KB Output isn't correct - Wrong Answer [9]
13 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 7584 KB Output is correct - L = 45
2 Correct 85 ms 7552 KB Output is correct - L = 45
3 Correct 86 ms 7632 KB Output is correct - L = 45
4 Correct 92 ms 7600 KB Output is correct - L = 45
5 Correct 110 ms 7236 KB Output is correct - L = 45
6 Incorrect 88 ms 7696 KB Output isn't correct - Wrong Answer [9]
7 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 7668 KB Output is correct - L = 45
2 Correct 112 ms 7524 KB Output is correct - L = 45
3 Correct 93 ms 7648 KB Output is correct - L = 45
4 Correct 86 ms 7656 KB Output is correct - L = 45
5 Correct 86 ms 7416 KB Output is correct - L = 45
6 Incorrect 94 ms 7564 KB Output isn't correct - Wrong Answer [9]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 7648 KB Output is correct - L = 45
2 Correct 93 ms 7588 KB Output is correct - L = 45
3 Correct 93 ms 7708 KB Output is correct - L = 45
4 Correct 86 ms 7556 KB Output is correct - L = 45
5 Correct 92 ms 7428 KB Output is correct - L = 45
6 Incorrect 93 ms 7652 KB Output isn't correct - Wrong Answer [9]
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 7664 KB Output is correct - L = 45
2 Correct 86 ms 7580 KB Output is correct - L = 45
3 Correct 95 ms 7536 KB Output is correct - L = 45
4 Correct 95 ms 7596 KB Output is correct - L = 45
5 Correct 86 ms 7328 KB Output is correct - L = 45
6 Incorrect 87 ms 7700 KB Output isn't correct - Wrong Answer [9]
7 Incorrect 96 ms 7492 KB Output isn't correct - Wrong Answer [9]
8 Incorrect 88 ms 7716 KB Output isn't correct - Wrong Answer [9]
9 Incorrect 85 ms 7840 KB Output isn't correct - Wrong Answer [9]
10 Incorrect 86 ms 7720 KB Output isn't correct - Wrong Answer [9]
11 Incorrect 96 ms 7624 KB Output isn't correct - Wrong Answer [9]
12 Correct 88 ms 7684 KB Output is correct - L = 45
13 Correct 158 ms 14724 KB Output is correct - L = 45
14 Correct 86 ms 7696 KB Output is correct - L = 45
15 Incorrect 101 ms 7716 KB Output isn't correct - Wrong Answer [9]
16 Correct 86 ms 7740 KB Output is correct - L = 45
17 Correct 84 ms 7788 KB Output is correct - L = 45
18 Correct 96 ms 8112 KB Output is correct - L = 45
19 Correct 105 ms 7380 KB Output is correct - L = 45
20 Incorrect 97 ms 8372 KB Output isn't correct - Wrong Answer [9]
21 Incorrect 95 ms 8400 KB Output isn't correct - Wrong Answer [9]
22 Incorrect 93 ms 7740 KB Output isn't correct - Wrong Answer [9]
23 Incorrect 99 ms 7720 KB Output isn't correct - Wrong Answer [9]
24 Incorrect 88 ms 7688 KB Output isn't correct - Wrong Answer [9]