| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 889776 | 2023-12-20T07:07:01 Z | vjudge1 | Nautilus (BOI19_nautilus) | C++17 | 1 ms | 348 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(2e6)+10;
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;
string s;
vector<int> block[305];
bool vis[305][305];
char a[105][105];
void Baizho() {
cin>>r>>c>>m;
for(int i = 1; i <= r; i ++) {
for(int j = 1; j <= c; j ++) cin>>a[i][j];
}
cin>>s;
int x = 150, y = 150;
vis[x][y] = 1;
for(auto ch : s) {
if(ch == 'N') x --;
else if(ch == 'S') x ++;
else if(ch == 'W') y ++;
else if(ch == 'E') y --;
vis[x][y] = 1;
}
int rows = 0;
for(int i = 1; i <= 300; i ++) {
int found = -1;
int cnt = 0;
for(int j = 1; j <= 300; j ++) {
if(vis[i][j] && found == -1) found = j, rows ++;
if(found == -1) continue;
if(j > found && vis[i][j] != vis[i][j - 1]) {
block[rows].pb(cnt);
cnt = 1;
} else cnt ++;
}
if(found != -1 && block[rows].sz % 2 == 0) block[rows].pb(cnt);
}
for(int i = 1; i <= rows; i ++) {
for(auto p : block[i]) cout<<p<<" ";
cout<<"\n";
}
int ans = 0;
for(int i = 1; i <= r - rows + 1; i ++) {
for(int j = 1; j <= c; j ++) {
bool failed = 0;
for(int p = 1; p <= rows; p ++) {
int y = j;
for(int k = 0; k < block[p].sz; k ++) {
int siz = block[p][k];
if(k % 2 == 0) {
if(y + siz - 1 > c) {
failed = 1;
break;
}
for(int g = y; g <= y + siz - 1; g ++) {
if(a[i+p-1][g] == '#') {
failed = 1;
break;
}
}
if(failed) break;
y += siz;
} else y += siz;
}
if(failed) break;
}
if(!failed) {
ans ++;
// cout<<i<<" "<<j<<endl;
}
}
}
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 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |