oj.uz

답안 #484494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484494 2021-11-03T18:19:19 Z MilosMilutinovic Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 126300 KB 
#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][1]=true;
	rep(x,1,k+1) rep(i,1,n+1) rep(j,1,m+1) if (g[i][j]==1&&dp[i][j][x]) {
		if ((pt[x]=='N'||pt[x]=='?')&&g[i-1][j]==1) dp[i-1][j][x+1]=true;
		if ((pt[x]=='S'||pt[x]=='?')&&g[i+1][j]==1) dp[i+1][j][x+1]=true;
		if ((pt[x]=='E'||pt[x]=='?')&&g[i][j+1]==1) dp[i][j+1][x+1]=true;
		if ((pt[x]=='W'||pt[x]=='?')&&g[i][j-1]==1) dp[i][j-1][x+1]=true;
	}
//	rep(x,1,k+2) {
//		printf("Moves: %d\n",x-1);
//		rep(i,1,n+1) {
//			rep(j,1,m+1) printf("%d",dp[i][j][x]);
//			puts("");
//		}
//	}
	int ans=0;
	rep(i,1,n+1) rep(j,1,m+1) if (dp[i][j][k+1]) ans++;
	printf("%d",ans);
}

Compilation message

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
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5836 KB Output is correct
2 Correct 5 ms 5812 KB Output is correct
3 Correct 6 ms 5760 KB Output is correct
4 Correct 6 ms 5580 KB Output is correct
5 Correct 4 ms 4796 KB Output is correct
6 Correct 2 ms 588 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5836 KB Output is correct
2 Correct 5 ms 5812 KB Output is correct
3 Correct 6 ms 5760 KB Output is correct
4 Correct 6 ms 5580 KB Output is correct
5 Correct 4 ms 4796 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 8 ms 5848 KB Output is correct
8 Correct 10 ms 5752 KB Output is correct
9 Correct 7 ms 5580 KB Output is correct
10 Correct 5 ms 4812 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 11 ms 5836 KB Output is correct
13 Correct 11 ms 5836 KB Output is correct
14 Correct 12 ms 5800 KB Output is correct
15 Correct 5 ms 4812 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 10 ms 5816 KB Output is correct
18 Correct 12 ms 5836 KB Output is correct
19 Correct 11 ms 5612 KB Output is correct
20 Correct 6 ms 4812 KB Output is correct
21 Correct 2 ms 588 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5836 KB Output is correct
2 Correct 5 ms 5812 KB Output is correct
3 Correct 6 ms 5760 KB Output is correct
4 Correct 6 ms 5580 KB Output is correct
5 Correct 4 ms 4796 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 8 ms 5848 KB Output is correct
8 Correct 10 ms 5752 KB Output is correct
9 Correct 7 ms 5580 KB Output is correct
10 Correct 5 ms 4812 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 11 ms 5836 KB Output is correct
13 Correct 11 ms 5836 KB Output is correct
14 Correct 12 ms 5800 KB Output is correct
15 Correct 5 ms 4812 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 10 ms 5816 KB Output is correct
18 Correct 12 ms 5836 KB Output is correct
19 Correct 11 ms 5612 KB Output is correct
20 Correct 6 ms 4812 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Execution timed out 1089 ms 126300 KB Time limit exceeded
23 Halted 0 ms 0 KB -