답안 #53844 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
53844	2018-07-01T09:29:45 Z	ainta	Sandwich (JOI16_sandwich)	C++17	35 / 100	8000 ms	45656 KB

sandwich

#include<cstdio>
#include<algorithm>
#include<vector>
#include<bitset>
using namespace std;
int Q[3<<17], Deg[3<<17], Res[3<<17], ord[3<<17], cnt,vis[3<<17];
char p[1<<9][1<<9];
vector<int>E[3<<17], F[3<<17];
int n, m;
int Num(int x, int y, int ck) {
	if (x<1 || x>n || y<1 || y>m)return 0;
	int cc = 0;
	if (p[x][y] == 'N') {
		if (ck == 0 || ck == 3)cc = 1;
		else cc = 2;
	}
	else {
		if (ck == 0 || ck == 2)cc = 1;
		else cc = 2;
	}
	return ((x - 1)*m + (y - 1)) * 2 + cc;
}
void Add_Edge(int a, int b) {
	if (!a || !b)return;
	E[a].push_back(b);
	Deg[a]++;
	F[b].push_back(a);
}
int main() {
	int i, j;
	//freopen("input.txt", "r", stdin);
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++) {
		scanf("%s", p[i] + 1);
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			Add_Edge(Num(i, j, 0), Num(i - 1, j, 0));
			Add_Edge(Num(i, j, 1), Num(i + 1, j, 1));
			Add_Edge(Num(i, j, 2), Num(i, j - 1, 2));
			Add_Edge(Num(i, j, 3), Num(i, j + 1, 3));
		}
	}
	int head = 0, tail = 0;
	for (i = 1; i <= n*m * 2; i++) {
		if (!Deg[i])Q[++tail] = i;
	}
	while (head < tail) {
		int x = Q[++head];
		for (auto &t : F[x]) {
			Deg[t]--;
			if (!Deg[t])Q[++tail] = t;
		}
	}
	for (i = 1; i <= tail; i++)ord[++cnt] = Q[i];
	int cur = 0;
	for (i = 1; i <= n; i++) {
		cur++;
		for (j = 1; j <= m; j++) {
			int bs = Num(i,j,3);
			int head = 0, tail = 0;
			if (vis[bs] != cur && !Deg[bs]) {
				vis[bs] = cur, Res[bs] += m-j+1;
				Q[++tail] = bs;
			}
			while (head < tail) {
				int x = Q[++head];
				for (auto &t : F[x]) {
					if (vis[t] != cur && !Deg[t]) {
						vis[t] = cur, Res[t]  += m-j+1;
						Q[++tail] = t;
					}
				}
			}
		}
		cur++;
		for (j = m; j >= 1; j--) {
			int bs = Num(i, j, 2);
			int head = 0, tail = 0;
			if (vis[bs] != cur && !Deg[bs]) {
				vis[bs] = cur, Res[bs] += j;
				Q[++tail] = bs;
			}
			while (head < tail) {
				int x = Q[++head];
				for (auto &t : F[x]) {
					if (vis[t] != cur && !Deg[t]) {
						vis[t] = cur, Res[t] += j;
						Q[++tail] = t;
					}
				}
			}
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			int bs = ((i - 1)*m + j - 1) * 2, res = 1e9;
			if (!Deg[bs + 1])res = min(res, Res[bs + 1]);
			if (!Deg[bs + 2])res = min(res, Res[bs + 2]);
			if (res > 8e8)res = -1;
			else res *= 2;
			printf("%d ", res);
		}
		printf("\n");
	}
}

Compilation message

sandwich.cpp: In function 'int main()':
sandwich.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
sandwich.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", p[i] + 1);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	18808 KB	Output is correct
2	Correct	19 ms	18968 KB	Output is correct
3	Correct	17 ms	19172 KB	Output is correct
4	Correct	17 ms	19172 KB	Output is correct
5	Correct	18 ms	19172 KB	Output is correct
6	Correct	23 ms	19352 KB	Output is correct
7	Correct	23 ms	19512 KB	Output is correct
8	Correct	26 ms	19572 KB	Output is correct
9	Correct	20 ms	19572 KB	Output is correct
10	Correct	26 ms	19604 KB	Output is correct
11	Correct	32 ms	19604 KB	Output is correct
12	Correct	22 ms	19604 KB	Output is correct
13	Correct	28 ms	19604 KB	Output is correct
14	Correct	27 ms	19604 KB	Output is correct
15	Correct	24 ms	19620 KB	Output is correct
16	Correct	23 ms	19628 KB	Output is correct
17	Correct	24 ms	19628 KB	Output is correct
18	Correct	23 ms	19628 KB	Output is correct
19	Correct	27 ms	19644 KB	Output is correct
20	Correct	21 ms	19644 KB	Output is correct
21	Correct	22 ms	19644 KB	Output is correct
22	Correct	20 ms	19644 KB	Output is correct
23	Correct	20 ms	19644 KB	Output is correct
24	Correct	27 ms	19644 KB	Output is correct
25	Correct	29 ms	19644 KB	Output is correct
26	Correct	25 ms	19644 KB	Output is correct
27	Correct	24 ms	19644 KB	Output is correct
28	Correct	30 ms	19644 KB	Output is correct

Subtask #2
0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	18808 KB	Output is correct
2	Correct	19 ms	18968 KB	Output is correct
3	Correct	17 ms	19172 KB	Output is correct
4	Correct	17 ms	19172 KB	Output is correct
5	Correct	18 ms	19172 KB	Output is correct
6	Correct	23 ms	19352 KB	Output is correct
7	Correct	23 ms	19512 KB	Output is correct
8	Correct	26 ms	19572 KB	Output is correct
9	Correct	20 ms	19572 KB	Output is correct
10	Correct	26 ms	19604 KB	Output is correct
11	Correct	32 ms	19604 KB	Output is correct
12	Correct	22 ms	19604 KB	Output is correct
13	Correct	28 ms	19604 KB	Output is correct
14	Correct	27 ms	19604 KB	Output is correct
15	Correct	24 ms	19620 KB	Output is correct
16	Correct	23 ms	19628 KB	Output is correct
17	Correct	24 ms	19628 KB	Output is correct
18	Correct	23 ms	19628 KB	Output is correct
19	Correct	27 ms	19644 KB	Output is correct
20	Correct	21 ms	19644 KB	Output is correct
21	Correct	22 ms	19644 KB	Output is correct
22	Correct	20 ms	19644 KB	Output is correct
23	Correct	20 ms	19644 KB	Output is correct
24	Correct	27 ms	19644 KB	Output is correct
25	Correct	29 ms	19644 KB	Output is correct
26	Correct	25 ms	19644 KB	Output is correct
27	Correct	24 ms	19644 KB	Output is correct
28	Correct	30 ms	19644 KB	Output is correct
29	Correct	16 ms	19644 KB	Output is correct
30	Correct	22 ms	19644 KB	Output is correct
31	Correct	175 ms	41220 KB	Output is correct
32	Correct	174 ms	41220 KB	Output is correct
33	Correct	48 ms	41220 KB	Output is correct
34	Execution timed out	8084 ms	45656 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

답안 #53844

Compilation message

Subtask #1 35.0 / 35.0

Subtask #2 0 / 65.0

Subtask #1
35.0 / 35.0

Subtask #2
0 / 65.0