oj.uz

답안 #927526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927526 2024-02-15T02:45:56 Z Muhammad_Aneeq Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 94032 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int r,c,m;
int const R=500+10;
int const M=5000+10;
vector<vector<char>>a;
string s;
int ans=0;
vector<vector<vector<bool>>>vis;
queue<pair<int,pair<int,int>>>Q;
inline bool check(int i,int j,int ind)
{
  if (i<0||i>=r||j<0||j>=c||a[i][j]=='#'||vis[i][j][ind])
    return 0;
  Q.push({ind,{i,j}});
  vis[i][j][ind]=1;
  return 1;
}
inline void bfs(int i,int j)
{
  check(i,j,0);
  while (Q.size())
  {
    auto z=Q.front();
    Q.pop();
    int ind=z.first,i=z.second.first,j=z.second.second;
    if (ind==m)
    {
      ans++;
      return;
    }
      if (s[ind]=='?')
    {
      check(i+1,j,ind+1);
      check(i,j+1,ind+1);
      check(i-1,j,ind+1);
      check(i,j-1,ind+1);
    }
    if (s[ind]=='N')
      check(i-1,j,ind+1);
    if (s[ind]=='S')
      check(i+1,j,ind+1);
    if (s[ind]=='E')
      check(i,j+1,ind+1);
    if (s[ind]=='W')
      check(i,j-1,ind+1);
  }
}
inline void solve()
{
  cin>>r>>c>>m;
  for (int i=0;i<r;i++)
  {
    vis.push_back({});
    a.push_back({});
    for (int j=0;j<c;j++)
    {
      vis.back().push_back({});
      a.back().push_back(' ');
      for (int k=0;k<=m;k++)
      {
        vis.back().back().push_back(0);
      }
    }
  }
  for (int i=0;i<r;i++)
    for (int j=0;j<c;j++)
      cin>>a[i][j];
  cin>>s;
  for (int i=0;i<r;i++)
    for (int j=0;j<c;j++)
      bfs(i,j);
  cout<<ans<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

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