oj.uz

답안 #926015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926015 2024-02-12T12:57:38 Z vjudge1 Nautilus (BOI19_nautilus) C++17
0 / 100
 1 ms 348 KB 
// By ObeliX
#include <bits/stdc++.h>
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <unordered_map>
#include <cstddef>
#include <cassert>
#include <bitset>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>

using namespace std;

const long long N = 1e6 + 5;
const long long MOD = 1e7 + 7;
const long long inf = 1e18;

long long n , m , d , k;

int main(){
    //freopen( "cinema.in" , "r" , stdin );
    //freopen( "cinema.out" , "w" , stdout );
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> k;
    bitset <505> dp[4][505];
    char c[n+5][m+5];
    for ( int i = 0 ; i <= n + 1 ; i++ ) {
        for ( int j = 0 ; j <= m + 1 ; j++ ) {
            c[i][j] = '.';
        }
    }
    for ( int i = 1 ; i <= n ; i++ ) {
        for ( int j = 1 ; j <= m ; j++ ) {
            cin >> c[i][j];
            if ( c[i][j] == '.' ) {
                dp[1][i][j] = 1;
            } 
        }
    }
    string s;
    cin >> s;
    for ( int l = 0 ; l < k ; l++ ) {
        if ( s[l] == 'W' ) {
            for ( int i = 1 ; i <= n ; i++ ) {
                dp[2][i] = ( ( dp[1][i] >> 1 ) & dp[1][i] );
            }
        }
        if ( s[l] == 'E' ) {
            for ( int i = 1 ; i <= n ; i++ ) {
                dp[2][i] = ( ( dp[1][i] << 1 ) & dp[1][i] );
            }
        }
        if ( s[l] == 'S' ) {
            for ( int i = 1 ; i <= n ; i++ ) {
                dp[2][i] = ( dp[1][i] & dp[1][i-1] );
            }
        }
        if ( s[l] == 'N' ) {
            for ( int i = 1 ; i <= n ; i++ ) {
                dp[2][i] = ( dp[1][i] & dp[1][i+1] );
            }
        }
        for ( int i = 1 ; i <= n ; i++ ) {
            dp[1][i] = dp[2][i];
        }
    }
    long long ans = 0;
    for ( int i = 1 ; i <= n ; i++ ) {
        ans += dp[1][i].count();
    }
    cout << ans;
}

Subtask #1
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -