oj.uz

Submission #223033

# Submission time Handle Problem Language Result Execution time Memory
223033 2020-04-14T14:14:11 Z infinite_iq Nautilus (BOI19_nautilus) C++14
100 / 100
 273 ms 157608 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 547
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll inf=1e18;
const ld pai=acos(-1);
int n , m , t ;
bitset<509>dp[509][5009] , sea[509] ;
int main () {
        cin >> n >> m >> t ;
        for ( int i = 1 ; i <= n ; i ++ ) {
                string x;
                cin >> x;
                for ( int j = 0 ; j < m ; j ++ ) {
                        sea[i][j] = dp[i][0][j] = ( x[j] == '.' ) ;
                }
        }
        string ret;
        cin >> ret;
        ret = " " + ret ;
        for ( int it = 1 ; it < ret.size() ; it ++ ) {
                for ( int i = 1 ; i <= n ; i ++ ) {
                        if ( ret[it] == 'N' || ret[it] == '?' ) {
                                dp [i][it]  |= ( dp[i+1][it-1] & sea[i] ) ;
                        }
                        if ( ret[it] == 'S' || ret[it] == '?' ) {
                                dp [i][it]  |= ( dp[i-1][it-1] & sea[i] ) ;
                        }
                        if ( ret[it] == 'E' || ret[it] == '?' ) {
                                dp [i][it]  |= ( ( dp[i][it-1] << 1 ) & sea[i] ) ;
                        }
                        if ( ret[it] == 'W' || ret[it] == '?' ) {
                                dp [i][it]  |= ( ( dp[i][it-1] >> 1 ) & sea[i] ) ;
                        }
                }
        }
        int ans = 0 ;
        for ( int i = 1 ; i <= n ; i ++ ) {
                ans += dp[i][t].count() ;
        }
        cout << ans << endl ;
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:42:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for ( int it = 1 ; it < ret.size() ; it ++ ) {
                            ~~~^~~~~~~~~~~~

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1408 KB Output is correct
2 Correct 6 ms 1408 KB Output is correct
3 Correct 6 ms 1408 KB Output is correct
4 Correct 6 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 6 ms 1408 KB Output is correct
7 Correct 6 ms 1408 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 6 ms 1408 KB Output is correct
10 Correct 6 ms 1408 KB Output is correct
11 Correct 7 ms 1408 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 6 ms 1408 KB Output is correct
14 Correct 7 ms 1408 KB Output is correct
15 Correct 6 ms 1408 KB Output is correct
16 Correct 6 ms 1408 KB Output is correct
17 Correct 7 ms 1408 KB Output is correct
18 Correct 7 ms 1408 KB Output is correct
19 Correct 6 ms 1408 KB Output is correct
20 Correct 7 ms 1408 KB Output is correct
21 Correct 6 ms 1408 KB Output is correct
22 Correct 207 ms 157608 KB Output is correct
23 Correct 194 ms 157432 KB Output is correct
24 Correct 189 ms 157432 KB Output is correct
25 Correct 190 ms 157432 KB Output is correct
26 Correct 188 ms 157432 KB Output is correct
27 Correct 237 ms 157436 KB Output is correct
28 Correct 251 ms 157536 KB Output is correct
29 Correct 228 ms 157432 KB Output is correct
30 Correct 252 ms 157432 KB Output is correct
31 Correct 247 ms 157552 KB Output is correct
32 Correct 273 ms 157408 KB Output is correct
33 Correct 262 ms 157436 KB Output is correct
34 Correct 268 ms 157428 KB Output is correct
35 Correct 272 ms 157432 KB Output is correct
36 Correct 269 ms 157560 KB Output is correct