제출 #484493

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484493		MilosMilutinovic	Nautilus (BOI19_nautilus)	C++14	0 / 100	8 ms	5836 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=505;
int n,m,k,g[N][N];
char s[N],pt[N];
bool dp[N][N][N];
int main() {
	scanf("%d%d%d",&n,&m,&k);
	rep(i,1,n+1) {
		scanf("%s",s+1);
		rep(j,1,m+1) g[i][j]=(s[j]=='.'?1:0);
	}
	scanf("%s",pt+1);
	rep(i,1,n+1) rep(j,1,m+1) if (g[i][j]) dp[i][j][0]=true;
	rep(x,1,k+1) rep(i,1,n+1) rep(j,1,m+1) if (g[i][j]) {
		if (pt[x]=='N'||pt[x]=='?') dp[i][j][x]|=dp[i-1][j][x-1];
		if (pt[x]=='S'||pt[x]=='?') dp[i][j][x]|=dp[i+1][j][x-1];
		if (pt[x]=='W'||pt[x]=='?') dp[i][j][x]|=dp[i][j+1][x-1];
		if (pt[x]=='E'||pt[x]=='?') dp[i][j][x]|=dp[i][j-1][x-1];
	}
	int ans=0;
	rep(i,1,n+1) rep(j,1,m+1) if (dp[i][j][k]) ans++;
	printf("%d",ans);
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 29
• Subtask 2: 0 / 37
• Subtask 3: 0 / 34