이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=5e2+50;
const int mod=1e9+7;
using namespace std;
int h,w,m,i,j,rs,t;
char b[nmax*10],c;
bitset<nmax>f[nmax][nmax*10],a[nmax];
int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>h>>w>>m;
for(i=1;i<=h;i++)
{
for(j=1;j<=w;j++)
{
cin>>c;
if(c=='.')a[i][j]=1;
}
}
for(i=1;i<=m;i++)cin>>b[i];
for(i=1;i<=h;i++)f[i][0]=a[i];
for(i=1;i<=m;i++)
{
for(j=1;j<=h;j++)
{
if(b[i]=='W' || b[i]=='?')f[j][i]|=(f[j][i-1]>>1)&a[j];
if(b[i]=='E' || b[i]=='?')f[j][i]|=(f[j][i-1]<<1)&a[j];
if(b[i]=='N' || b[i]=='?')f[j][i]|=f[j+1][i-1]&a[j];
if(b[i]=='S' || b[i]=='?')f[j][i]|=f[j-1][i-1]&a[j];
if(i==m)rs+=f[j][i].count();
}
}
cout<<rs<<endl;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
nautilus.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("O3")
nautilus.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("unroll-loops")
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |