oj.uz

답안 #210633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210633 2020-03-18T00:03:18 Z casperwang Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 1400 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 500;
int r, c, m;
int d;
int cnt;
string str;
string mp[MAXN+5];
bool dp[MAXN+5][MAXN+5][2];
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> r >> c >> m;
  for (int i = 1; i <= r; i++) {
    cin >> mp[i];
    mp[i] = "#" + mp[i] + "#";
  }
  cin >> str;
  for (int i = 0; i <= c+1; i++) {
    mp[0] = mp[0] + "#";
    mp[r+1] = mp[r+1] + "#";
  }
  for (int i = 1; i <= r; i++)
    for (int j = 1; j <= c; j++)
      dp[i][j][1] = (mp[i][j] != '#');
  for (int k = 0; k < m; k++) {
    if (str[k] == 'S') d = 0;
    if (str[k] == 'N') d = 1;
    if (str[k] == 'E') d = 2;
    if (str[k] == 'W') d = 3;
    for (int i = 1; i <= r; i++)
      for (int j = 1; j <= c; j++)
        dp[i][j][k&1] = (mp[i][j] != '#') * (dp[i+dx[d]][j+dy[d]][(k+1)&1]);
    if (str[k] != '?') continue;
    for (int i = 1; i <= r; i++)
      for (int j = 1; j <= c; j++)
        for (int d = 0; d < 4 && !dp[i][j][k&1]; d++)
          dp[i][j][k&1] |= (mp[i][j] != '#') * (dp[i+dx[d]][j+dy[d]][(k+1)&1]);
  }
  for (int i = 1; i <= r; i++)
    for (int j = 1; j <= c; j++)
      cnt += dp[i][j][(m+1)&1];
  cout << cnt << "\n";
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:36:43: warning: '*' in boolean context, suggest '&&' instead [-Wint-in-bool-context]
         dp[i][j][k&1] = (mp[i][j] != '#') * (dp[i+dx[d]][j+dy[d]][(k+1)&1]);
                         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 508 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 508 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 10 ms 504 KB Output is correct
9 Correct 10 ms 504 KB Output is correct
10 Correct 10 ms 504 KB Output is correct
11 Correct 10 ms 504 KB Output is correct
12 Correct 7 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 15 ms 504 KB Output is correct
15 Correct 14 ms 504 KB Output is correct
16 Correct 16 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 14 ms 504 KB Output is correct
19 Correct 18 ms 504 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 17 ms 504 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 508 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 10 ms 504 KB Output is correct
9 Correct 10 ms 504 KB Output is correct
10 Correct 10 ms 504 KB Output is correct
11 Correct 10 ms 504 KB Output is correct
12 Correct 7 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 15 ms 504 KB Output is correct
15 Correct 14 ms 504 KB Output is correct
16 Correct 16 ms 504 KB Output is correct
17 Correct 7 ms 504 KB Output is correct
18 Correct 14 ms 504 KB Output is correct
19 Correct 18 ms 504 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 17 ms 504 KB Output is correct
22 Execution timed out 1099 ms 1400 KB Time limit exceeded
23 Halted 0 ms 0 KB -