답안 #147828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147828 2019-08-30T20:45:56 Z MvC Nautilus (BOI19_nautilus) C++11
100 / 100
227 ms 860 KB
#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][2],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][1]=a[i];
	for(i=1;i<=m;i++)
	{
		for(j=1;j<=h;j++)f[j][0]=f[j][1];
		for(j=1;j<=h;j++)
		{
			f[j][1].reset();
			if(b[i]=='W' || b[i]=='?')f[j][1]|=(f[j][0]>>1)&a[j];
			if(b[i]=='E' || b[i]=='?')f[j][1]|=(f[j][0]<<1)&a[j];
			if(b[i]=='N' || b[i]=='?')f[j][1]|=f[j+1][0]&a[j];
			if(b[i]=='S' || b[i]=='?')f[j][1]|=f[j-1][0]&a[j];
			if(i==m)rs+=f[j][1].count();
		}
	}
	cout<<rs<<endl;
	return 0;
}

Compilation message

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")
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 380 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 380 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 124 ms 376 KB Output is correct
23 Correct 127 ms 860 KB Output is correct
24 Correct 124 ms 632 KB Output is correct
25 Correct 123 ms 760 KB Output is correct
26 Correct 122 ms 728 KB Output is correct
27 Correct 182 ms 632 KB Output is correct
28 Correct 184 ms 760 KB Output is correct
29 Correct 183 ms 760 KB Output is correct
30 Correct 184 ms 760 KB Output is correct
31 Correct 181 ms 632 KB Output is correct
32 Correct 226 ms 760 KB Output is correct
33 Correct 227 ms 760 KB Output is correct
34 Correct 227 ms 760 KB Output is correct
35 Correct 227 ms 760 KB Output is correct
36 Correct 227 ms 732 KB Output is correct