| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 891150 | 2023-12-22T08:57:22 Z | vjudge1 | Nautilus (BOI19_nautilus) | C++17 | 149 ms | 640 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e3)+100;
const long long inf = 2e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int r, c, m;
bitset<500> orig[500], pot[500], lef[500], righ[500], down[500], up[500], em;
string s;
void Baizho() {
cin>>r>>c>>m;
for(int i = 0; i < r; i ++) {
for(int j = 0; j < c; j ++) {
char a; cin>>a;
orig[i][j] = (a == '.');
pot[i][j] = (a == '.');
}
}
cin>>s;
for(auto x : s) {
if(x == 'N') {
for(int i = 0; i < r - 1; i ++) pot[i] = (pot[i + 1] & orig[i]);
pot[r - 1] = em;
} else if(x == 'S') {
for(int i = r - 1; i >= 1; i --) pot[i] = (pot[i - 1] & orig[i]);
pot[0] = em;
} else if(x == 'W') {
for(int i = 0; i < r; i ++) pot[i] = ((pot[i] >> 1) & orig[i]);
} else if(x == 'E') {
for(int i = 0; i < r; i ++) pot[i] = ((pot[i] << 1) & orig[i]);
} else {
up[r - 1] = em;
down[0] = em;
for(int i = 0; i < r - 1; i ++) up[i] = (pot[i + 1]);
for(int i = 1; i < r; i ++) down[i] = (pot[i - 1]);
for(int i = 0; i < r; i ++) lef[i] = (pot[i] >> 1);
for(int i = 0; i < r; i ++) righ[i] = (pot[i] << 1);
for(int i = 0; i < r; i ++) {
pot[i] = (((up[i] | down[i]) | lef[i]) | righ[i]) & orig[i];
}
}
}
int ans = 0;
for(int i = 0; i < r; i ++) for(int j = 0; j < c; j ++) ans += pot[i][j];
cout<<ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) { Baizho(); }
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 1 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 348 KB | Output is correct |
| 5 | Correct | 1 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 1 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 348 KB | Output is correct |
| 5 | Correct | 1 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 1 ms | 344 KB | Output is correct |
| 8 | Correct | 1 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 1 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 348 KB | Output is correct |
| 13 | Correct | 1 ms | 348 KB | Output is correct |
| 14 | Correct | 1 ms | 348 KB | Output is correct |
| 15 | Correct | 1 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 1 ms | 348 KB | Output is correct |
| 18 | Correct | 1 ms | 348 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 1 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 1 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 348 KB | Output is correct |
| 5 | Correct | 1 ms | 348 KB | Output is correct |
| 6 | Correct | 0 ms | 348 KB | Output is correct |
| 7 | Correct | 1 ms | 344 KB | Output is correct |
| 8 | Correct | 1 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 1 ms | 348 KB | Output is correct |
| 11 | Correct | 1 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 348 KB | Output is correct |
| 13 | Correct | 1 ms | 348 KB | Output is correct |
| 14 | Correct | 1 ms | 348 KB | Output is correct |
| 15 | Correct | 1 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 1 ms | 348 KB | Output is correct |
| 18 | Correct | 1 ms | 348 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 1 ms | 348 KB | Output is correct |
| 21 | Correct | 1 ms | 348 KB | Output is correct |
| 22 | Correct | 69 ms | 604 KB | Output is correct |
| 23 | Correct | 68 ms | 604 KB | Output is correct |
| 24 | Correct | 67 ms | 600 KB | Output is correct |
| 25 | Correct | 66 ms | 636 KB | Output is correct |
| 26 | Correct | 64 ms | 604 KB | Output is correct |
| 27 | Correct | 109 ms | 600 KB | Output is correct |
| 28 | Correct | 111 ms | 636 KB | Output is correct |
| 29 | Correct | 111 ms | 604 KB | Output is correct |
| 30 | Correct | 115 ms | 600 KB | Output is correct |
| 31 | Correct | 110 ms | 600 KB | Output is correct |
| 32 | Correct | 147 ms | 636 KB | Output is correct |
| 33 | Correct | 145 ms | 632 KB | Output is correct |
| 34 | Correct | 145 ms | 604 KB | Output is correct |
| 35 | Correct | 149 ms | 640 KB | Output is correct |
| 36 | Correct | 145 ms | 632 KB | Output is correct |