oj.uz

Submission #414834

# Submission time Handle Problem Language Result Execution time Memory
414834 2021-05-31T08:44:24 Z amunduzbaev Nautilus (BOI19_nautilus) C++14
66 / 100
 279 ms 262148 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define vv vector
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define mem(arr, v) memset(arr, v, sizeof arr)
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 505;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, t, q, ans, res, a[N][N];
int b[N], ch[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
bitset<5005> dp[5005][N], used[N];

void solve(int t_case){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			char c; cin>>c; a[i][j] = (c == '#');
		}
	}
	
	string s; cin>>s;
	for(int i=0;i<k;i++){
		if(s[i] == 'N') b[i] = 0;
		if(s[i] == 'S') b[i] = 1;
		if(s[i] == 'W') b[i] = 2;
		if(s[i] == 'E') b[i] = 3;
		if(s[i] == '?') b[i] = -1;
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			dp[0][i][j] = !a[i][j];
		} 
	}
	
	for(int l=0;l<k;l++){
		for(int i=1;i<=n;i++){
			if(~b[l]){
				if(!b[l]) dp[l+1][i-1] |= dp[l][i];
				else if(b[l] == 1) dp[l+1][i+1] |= dp[l][i];
				else if(b[l] == 2) dp[l+1][i] |= dp[l][i]>>1;
				else dp[l+1][i] |= dp[l][i]<<1;
			} else {
				dp[l+1][i+1] |= dp[l][i];
				dp[l+1][i-1] |= dp[l][i];
				dp[l+1][i] |= dp[l][i]>>1;
				dp[l+1][i] |= dp[l][i]<<1;
			}
		} 
		
		for(int i=1;i<=n;i++) dp[l+1][i] &= dp[0][i];
	} 
	
	//~ cout<<m<<"\n";
	//~ for(int l=0;l<=k;l++){
		//~ for(int i=1;i<=n;i++){
			//~ for(int j=1;j<=m;j++) cout<<dp[l][i][j];
			//~ cout<<"\n";
		//~ } cout<<"\n";
	//~ } cout<<"\n";
	
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) res += dp[k][i][j];
	cout<<res<<"\n";
}

/*

101000101
010100010
100111100
100111010
011101111

101000101
010000110
000111100
000111011
101001111

*/

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

nautilus.cpp: In function 'void usaco(std::string)':
nautilus.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 7 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 6 ms 7364 KB Output is correct
6 Correct 6 ms 7448 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 7 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 6 ms 7364 KB Output is correct
6 Correct 6 ms 7448 KB Output is correct
7 Correct 7 ms 7484 KB Output is correct
8 Correct 7 ms 7500 KB Output is correct
9 Correct 8 ms 7500 KB Output is correct
10 Correct 8 ms 7472 KB Output is correct
11 Correct 8 ms 7476 KB Output is correct
12 Correct 9 ms 7520 KB Output is correct
13 Correct 9 ms 7396 KB Output is correct
14 Correct 10 ms 7500 KB Output is correct
15 Correct 9 ms 7500 KB Output is correct
16 Correct 10 ms 7476 KB Output is correct
17 Correct 16 ms 7524 KB Output is correct
18 Correct 11 ms 7500 KB Output is correct
19 Correct 11 ms 7528 KB Output is correct
20 Correct 11 ms 7500 KB Output is correct
21 Correct 15 ms 7484 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 7 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 6 ms 7364 KB Output is correct
6 Correct 6 ms 7448 KB Output is correct
7 Correct 7 ms 7484 KB Output is correct
8 Correct 7 ms 7500 KB Output is correct
9 Correct 8 ms 7500 KB Output is correct
10 Correct 8 ms 7472 KB Output is correct
11 Correct 8 ms 7476 KB Output is correct
12 Correct 9 ms 7520 KB Output is correct
13 Correct 9 ms 7396 KB Output is correct
14 Correct 10 ms 7500 KB Output is correct
15 Correct 9 ms 7500 KB Output is correct
16 Correct 10 ms 7476 KB Output is correct
17 Correct 16 ms 7524 KB Output is correct
18 Correct 11 ms 7500 KB Output is correct
19 Correct 11 ms 7528 KB Output is correct
20 Correct 11 ms 7500 KB Output is correct
21 Correct 15 ms 7484 KB Output is correct
22 Runtime error 279 ms 262148 KB Execution killed with signal 9
23 Halted 0 ms 0 KB -