Submission #1133963

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133963		thelegendary08	Nautilus (BOI19_nautilus)	C++17	66 / 100	1093 ms	4644 KiB

nautilus

#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,k);
	char grid[n][m];
	f0r(i,n)f0r(j,m)cin>>grid[i][j];
	string s;
	cin>>s;
	vvi dp(n, vi(m));
	
	f0r(i,n)f0r(j,m){
		if(grid[i][j] == '.')dp[i][j] = 1;
	}
	f0r(ch, k){
		vvi cur(n, vi(m));
		char dir = s[ch];
		f0r(i,n)f0r(j,m){
			if(grid[i][j] == '.'){
				if(dir == 'S' || dir == '?'){
					if(i != 0 && dp[i-1][j] == 1){
						cur[i][j] = 1;
					}
				}
				if(dir == 'N'|| dir == '?'){
					if(i != n-1 && dp[i+1][j] == 1)cur[i][j] = 1;
				}
				if(dir == 'E'|| dir == '?'){
					if(j != 0 && dp[i][j-1] == 1)cur[i][j] = 1;
				}
				if(dir == 'W'|| dir == '?'){
					if(j != m-1 && dp[i][j+1] == 1)cur[i][j] = 1;
				}
				
			}
			
		}
		f0r(i,n){
			f0r(j,m)dp[i][j] = cur[i][j];
		}
	}
	int ans = 0;
	f0r(ch,k+1){
	
	f0r(i,n){
		f0r(j,m){
			//cout<<dp[i][j][ch]<<' ';
		}
		//cout<<'\n';
	}	
	//cout<<'\n';
	}
	f0r(i,n)f0r(j,m)ans += dp[i][j];
	out(ans);
}

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