oj.uz

답안 #163185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
163185 2019-11-11T17:44:23 Z TadijaSebez Sandwich (JOI16_sandwich) C++11
35 / 100
 8000 ms 6748 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=405;
const int inf=N*N*2;
char mat[N][N];
int mv[4][2]={{0,1},{-1,0},{0,-1},{1,0}};
int was[N][N];
int DFS(int x, int y, int dir)
{
	if(mat[x][y]!='N' && mat[x][y]!='Z') return 0;
	if(was[x][y]==2) return 0;
	if(was[x][y]==1) return inf;
	int ans=2,xr;
	if(mat[x][y]=='N') xr=1;
	else xr=3;
	was[x][y]=1;
	ans+=DFS(x+mv[dir][0],y+mv[dir][1],dir);
	ans+=DFS(x+mv[dir^xr][0],y+mv[dir^xr][1],dir^xr);
	was[x][y]=2;
	return ans;
}
void cl(){ for(int i=0;i<N;i++) for(int j=0;j<N;j++) was[i][j]=0;}
int main()
{
	int n,m;
	scanf("%i %i",&n,&m);
	for(int i=1;i<=n;i++) scanf("%s",mat[i]+1);
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++)
	{
		int ans=DFS(i,j,0);cl();
		ans=min(ans,DFS(i,j,2));cl();
		if(ans>=inf) printf("-1 ");
		else printf("%i ",ans);
		if(j==m) printf("\n");
	}
	return 0;
}

Compilation message

sandwich.cpp: In function 'int main()':
sandwich.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
sandwich.cpp:27:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%s",mat[i]+1);
                        ~~~~~^~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 20 ms 1016 KB Output is correct
6 Correct 854 ms 1120 KB Output is correct
7 Correct 474 ms 1144 KB Output is correct
8 Correct 506 ms 1144 KB Output is correct
9 Correct 377 ms 1144 KB Output is correct
10 Correct 607 ms 1116 KB Output is correct
11 Correct 638 ms 1312 KB Output is correct
12 Correct 323 ms 1144 KB Output is correct
13 Correct 604 ms 1276 KB Output is correct
14 Correct 601 ms 1016 KB Output is correct
15 Correct 492 ms 1144 KB Output is correct
16 Correct 483 ms 1144 KB Output is correct
17 Correct 487 ms 1144 KB Output is correct
18 Correct 483 ms 1144 KB Output is correct
19 Correct 485 ms 1144 KB Output is correct
20 Correct 500 ms 1068 KB Output is correct
21 Correct 491 ms 1144 KB Output is correct
22 Correct 500 ms 1144 KB Output is correct
23 Correct 489 ms 1144 KB Output is correct
24 Correct 604 ms 1248 KB Output is correct
25 Correct 607 ms 1116 KB Output is correct
26 Correct 634 ms 1144 KB Output is correct
27 Correct 567 ms 1144 KB Output is correct
28 Correct 629 ms 1148 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 11 ms 888 KB Output is correct
3 Correct 11 ms 1016 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 20 ms 1016 KB Output is correct
6 Correct 854 ms 1120 KB Output is correct
7 Correct 474 ms 1144 KB Output is correct
8 Correct 506 ms 1144 KB Output is correct
9 Correct 377 ms 1144 KB Output is correct
10 Correct 607 ms 1116 KB Output is correct
11 Correct 638 ms 1312 KB Output is correct
12 Correct 323 ms 1144 KB Output is correct
13 Correct 604 ms 1276 KB Output is correct
14 Correct 601 ms 1016 KB Output is correct
15 Correct 492 ms 1144 KB Output is correct
16 Correct 483 ms 1144 KB Output is correct
17 Correct 487 ms 1144 KB Output is correct
18 Correct 483 ms 1144 KB Output is correct
19 Correct 485 ms 1144 KB Output is correct
20 Correct 500 ms 1068 KB Output is correct
21 Correct 491 ms 1144 KB Output is correct
22 Correct 500 ms 1144 KB Output is correct
23 Correct 489 ms 1144 KB Output is correct
24 Correct 604 ms 1248 KB Output is correct
25 Correct 607 ms 1116 KB Output is correct
26 Correct 634 ms 1144 KB Output is correct
27 Correct 567 ms 1144 KB Output is correct
28 Correct 629 ms 1148 KB Output is correct
29 Correct 81 ms 1036 KB Output is correct
30 Correct 77 ms 1144 KB Output is correct
31 Execution timed out 8061 ms 6748 KB Time limit exceeded
32 Halted 0 ms 0 KB -