Submission #1313399

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313399		JanPham	Nautilus (BOI19_nautilus)	C++20	0 / 100	3 ms	332 KiB

nautilus

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fi first
#define se second
#define Cherry "Cherry"
#define all(v) v.begin(),v.end()
#define reset(a,i) memset(a,i,sizeof(a))
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i,a,b) for (int i = (a), _b = (b); i >= _b; --i)
#define compact(v) sort(all(v)), v.erase(unique(all(v)), end(v))
#define stringprocess(n,s) n = (int) s.size(), s = ' ' + s
#define sz(v) (int) v.size()
#define MASK(i) (1LL << (i))

typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

const int Thanh_Tam = 5 * 1e2 + 17;
const int inf = 1e9 + 17;
const ll infll = 1e18 + 17;
const int MOD = 1e9 + 7;
const int Log = 18;
const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
const int max_block_size = 320;
const ll P = 311;
const int maxA = 1e6 + 17;
const int addi = 1e6;

ll mul(ll a, ll b, ll mod);
ll binpow(ll a, ll b, ll mod)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1) res = mul(res,a,mod);
        b >>= 1;
        a = mul(a,a,mod);
    }
    return res;
}
ll add(ll a, ll b, ll mod) { return (a + b) % mod;                 }
ll sub(ll a, ll b, ll mod) { return (a - b + mod) % mod;          }
ll mul(ll a, ll b, ll mod) { return ((a % mod) * (b % mod)) % mod; }
ll div(ll a, ll b, ll mod) { return mul(a, binpow(b, mod - 2, mod), mod); }

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand_range(ll l, ll r){return uniform_int_distribution<ll>(l, r)(rng);}

int n, m, k;
char a[Thanh_Tam][Thanh_Tam];
char direct[Thanh_Tam * 10];

int dir(char c)
{
    if (c == 'N') return 0;
    if (c == 'W') return 1;
    if (c == 'E') return 2;
    if (c == 'S') return 3;
}

bool valid(int x, int y)
{
    return (a[x][y] != '#' && x > 0 && x <= n && y > 0 && y <= m);
}

bool Try(int x, int y)
{
    FOR(i, 1, k)
    {
        int idx = dir(direct[i]);
        x += dx[idx];
        y += dy[idx];
        if (!valid(x, y)) return false;
    }
    return true;
}

void cherry()
{   
    cin >> n >> m >> k;
    FOR(i,1,n)
        FOR(j,1,m)
            cin >> a[i][j];

    FOR(i,1,k) cin >> direct[i];

    int ans = 0;
    FOR(i,1,n)
        FOR(j,1,m)
            ans += Try(i, j);

    cout << ans;
    return;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    if (fopen(Cherry".inp","r"))
    {
        freopen(Cherry".inp","r",stdin);
        freopen(Cherry".out","w",stdout);
    }

    cherry();
    return 0;
}

Compilation message (stderr)

nautilus.cpp: In function 'int dir(char)':
nautilus.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^
nautilus.cpp: In function 'int main()':
nautilus.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen(Cherry".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:110:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |         freopen(Cherry".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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