Submission #925643

#	Time	Username	Problem	Language	Result	Execution time	Memory
925643		vjudge1	Nautilus (BOI19_nautilus)	C++17	29 / 100	3 ms	600 KiB

nautilus

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
      
      int n, m, k;
      cin >> n >> m >> k;

      char c[n+1][m+1];
      for( int i = 1; i <= n; i++ ) {
            for( int j = 1; j <= m; j++ ) {
                  cin >> c[i][j];
            }
      }

      char s[k+1];
      for( int i = 1; i <= k; i++ ) {
            cin >> s[i];
      }

      int ans = 0;
      for( int i = 1; i <= n; i++ ) {
            for( int j = 1; j <= m; j++ ) {
                  if( c[i][j] == '.') {
                        int x = i, y = j;
                        bool ok = 1;
                        for( int l = 1; l <= k; l++ ) {
                              if( s[l] == 'W') y--;
                              if( s[l] == 'E') y++;
                              if( s[l] == 'N') x--;
                              if( s[l] == 'S') x++;

                              if( y < 1 || y > m || x < 1 || x > n ) {
                                    ok = 0;
                                    break;
                              }
                              if( c[x][y] == '#') {
                                    ok = 0;
                                    break;
                              }
                        }
                        ans += ok;
                  }
            }
      }
      cout << ans;

return 0;
}

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