oj.uz

Submission #414692

# Submission time Handle Problem Language Result Execution time Memory
414692 2021-05-31T04:06:41 Z amunduzbaev Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 170680 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[N][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;
	} 
	
	vpii tt;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			dp[i][j][0] = !a[i][j];
			if(dp[i][j][0]) tt.pb({i, j});
		}
	}
	
	for(int l=0;l<k;l++){
		vpii tmp;
		for(auto [i, j] : tt){
			if(~b[l]){
				int x = i + ch[b[l]][0], y = j + ch[b[l]][1];
				if(x <= 0 || x > n || y <= 0 || y > m) continue;
				if(!a[x][y] && !used[x][y]) tmp.pb({x, y}), used[x][y] = 1;
			} else {
				for(int t=0;t<4;t++){
					int x = i + ch[t][0], y = j + ch[t][1];
					if(x <= 0 || x > n || y <= 0 || y > m) continue;
					if(!a[x][y] && !used[x][y]) tmp.pb({x, y}), used[x][y] = 1;
				}
			}
		} 
		
		for(auto x : tmp) used[x.ff][x.ss] = 0;
		swap(tmp, tt);
	} 
	
	cout<<sz(tt)<<"\n";
}

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 solve(long long int)':
nautilus.cpp:76:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |   for(auto [i, j] : tt){
      |            ^
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 24 ms 7952 KB Output is correct
2 Correct 7 ms 7668 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 5 ms 7496 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7952 KB Output is correct
2 Correct 7 ms 7668 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 5 ms 7496 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 27 ms 7948 KB Output is correct
8 Correct 12 ms 7736 KB Output is correct
9 Correct 7 ms 7500 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 7 ms 7244 KB Output is correct
12 Correct 33 ms 7948 KB Output is correct
13 Correct 39 ms 7760 KB Output is correct
14 Correct 26 ms 7776 KB Output is correct
15 Correct 7 ms 7372 KB Output is correct
16 Correct 5 ms 7244 KB Output is correct
17 Correct 37 ms 7924 KB Output is correct
18 Correct 46 ms 7688 KB Output is correct
19 Correct 21 ms 7552 KB Output is correct
20 Correct 11 ms 7372 KB Output is correct
21 Correct 6 ms 7244 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7952 KB Output is correct
2 Correct 7 ms 7668 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 5 ms 7496 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7244 KB Output is correct
7 Correct 27 ms 7948 KB Output is correct
8 Correct 12 ms 7736 KB Output is correct
9 Correct 7 ms 7500 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 7 ms 7244 KB Output is correct
12 Correct 33 ms 7948 KB Output is correct
13 Correct 39 ms 7760 KB Output is correct
14 Correct 26 ms 7776 KB Output is correct
15 Correct 7 ms 7372 KB Output is correct
16 Correct 5 ms 7244 KB Output is correct
17 Correct 37 ms 7924 KB Output is correct
18 Correct 46 ms 7688 KB Output is correct
19 Correct 21 ms 7552 KB Output is correct
20 Correct 11 ms 7372 KB Output is correct
21 Correct 6 ms 7244 KB Output is correct
22 Execution timed out 1095 ms 170680 KB Time limit exceeded
23 Halted 0 ms 0 KB -