oj.uz

Submission #496566

# Submission time Handle Problem Language Result Execution time Memory
496566 2021-12-21T14:42:40 Z vinnipuh01 Nautilus (BOI19_nautilus) C++17
100 / 100
 280 ms 808 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#define int long long
 
using namespace std;
 
const long long oo = 1000000000000000000;
 
long long  sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
 
 
/*
    ViHHiPuh
 
   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
 
 
    cout << fixed << setprecision(6) << x;
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    freopen ( "sum.in", "r", stdin )
*/

int n, m, k;
char c[ 501 ][ 501 ];
bitset <500> st[ 500 ], mp[ 500 ], stt[ 500 ], st1[ 500 ], ss[ 500 ];

main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    string s;
    for ( int i = 0; i < n; i ++ ) {
    	for ( int j = 0; j < m; j ++ ) {
    		cin >> c[ i ][ j ];
    		if ( c[ i ][ j ] == '.' ) {
    			st[ i ][ j ] = 1;
    			mp[ i ][ j ] = 1;
    		}
    	}
	}
	cin >> s;
	for ( auto k : s ) {
		if ( k == 'W' ) {
			for ( int i = 0; i < n; i ++ ) {
				st[ i ] = st[ i ] >> 1;
			}
		}
		else if ( k == 'E' ) {
			for ( int i = 0; i < n; i ++ ) {
				st[ i ] = st[ i ] << 1;
			}
		}
		else if ( k == 'N' ) {
			for ( int i = 0; i < n - 1; i ++ ) {
				st[ i ] = st[ i + 1 ];
			}
			for ( int i = 0; i < m; i ++ )
				st[ n - 1 ][ i ] = 0;
		}
		else if ( k == 'S' ) {
			for ( int i = n - 1; i >= 1; i -- ) {
				st[ i ] = st[ i - 1 ];
			}
			for ( int i = 0; i < m; i ++ )
				st[ 0 ][ i ] = 0;
		}
		else {
			for ( int i = 0; i < n; i ++ ) {
				ss[ i ] = st[ i ];
				stt[ i ] = st[ i ];
				st[ i ] = st1[ i ];
			}
			for ( int i = 0; i < n; i ++ )
				stt[ i ] = stt[ i ] >> 1;
			for ( int i = 0; i < n; i ++ )
				st[ i ] = st[ i ] | stt[ i ];
			for ( int i = 0; i < n; i ++ )
				stt[ i ] = ss[ i ];
			for (  int i = 0; i < n; i ++ )
				stt[ i ] = stt[ i ] << 1;
			for ( int i = 0; i < n; i ++ )
				st[ i ] = st[ i ] | stt[ i ];
			for ( int i = 0; i < n; i ++ )
				stt[ i ] = ss[ i ];
			for ( int i = 0; i < n - 1; i ++ ) {
				stt[ i ] = stt[ i + 1 ];
			}
			for ( int i = 0; i < m; i ++ )
				stt[ n - 1 ][ i ] = 0;
			for ( int i = 0; i < n; i ++ )
				st[ i ] = st[ i ] | stt[ i ];
			for ( int i = 0; i < n; i ++ )
				stt[ i ] = ss[ i ];
				
			for ( int i = n - 1; i >= 1; i -- ) {
				stt[ i ] = stt[ i - 1 ];
			}
			for ( int i = 0; i < m; i ++ )
				stt[ 0 ][ i ] = 0;
			for ( int i = 0; i < n; i ++ )
				st[ i ] = st[ i ] | stt[ i ];
		}
		for ( int i = 0; i < n; i ++ )
			st[ i ] = st[ i ] & mp[ i ];
	}
	for ( int i = 0; i < n; i ++ ) {
		ans += st[ i ].count();
	}
	cout << ans;
}

Compilation message

nautilus.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main () {
      | ^~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 400 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 127 ms 692 KB Output is correct
23 Correct 121 ms 692 KB Output is correct
24 Correct 127 ms 688 KB Output is correct
25 Correct 108 ms 688 KB Output is correct
26 Correct 108 ms 588 KB Output is correct
27 Correct 205 ms 688 KB Output is correct
28 Correct 191 ms 692 KB Output is correct
29 Correct 196 ms 680 KB Output is correct
30 Correct 210 ms 588 KB Output is correct
31 Correct 191 ms 672 KB Output is correct
32 Correct 249 ms 588 KB Output is correct
33 Correct 256 ms 692 KB Output is correct
34 Correct 268 ms 808 KB Output is correct
35 Correct 280 ms 688 KB Output is correct
36 Correct 272 ms 668 KB Output is correct