Submission #1096138

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096138		cpptowin	Nautilus (BOI19_nautilus)	C++17	100 / 100	164 ms	784 KiB

nautilus

#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if(x < 0) x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if(x < 0) x += mod;
}
bitset<505> arr[505],f[2][505];
int n,m,k;
char a[5010];
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> k;
    fo(i,1,n) 
    {
        fo(j,1,m)
        {
            char t;
            cin >> t;
            if(t == '.') arr[i][j] = f[0][i][j] = 1;
        }
    }
    fo(i,1,k) cin >> a[i];
    fo(i,1,k)
    {
        if(a[i] == 'N') 
        {
            fo(j,1,n) f[i % 2][j] = f[1 - i % 2][j + 1] & arr[j];
        }
        else if(a[i] == 'S')
        {
            fo(j,1,n) f[i % 2][j] = f[1 - i % 2][j - 1] & arr[j];
        }
        else if(a[i] == 'W')
        {
            fo(j,1,n) f[i % 2][j] = (f[1 - i % 2][j] >> 1) & arr[j];
        }
        else if(a[i] == 'E')
        {
            fo(j,1,n) f[i % 2][j] = (f[1 - i % 2][j] << 1) & arr[j];
        }
        else 
        {
            fo(j,1,n) f[i % 2][j] = (f[1 - i % 2][j + 1]|f[1 - i % 2][j - 1]|
            (f[1 - i % 2][j] << 1) | (f[1 - i & 1][j] >> 1)) & arr[j];
        }
    }
    int ans = 0;
    fo(i,1,n) ans += f[k & 1][i].count();
    cout << ans;
}

Compilation message (stderr)

nautilus.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   58 | main()
      | ^~~~
nautilus.cpp: In function 'int main()':
nautilus.cpp:100:43: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
  100 |             (f[1 - i % 2][j] << 1) | (f[1 - i & 1][j] >> 1)) & arr[j];
      |                                         ~~^~~
nautilus.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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