oj.uz

답안 #645084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
645084 2022-09-26T07:32:46 Z mychecksedad Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 32340 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;



int n, m, k, arr[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
bool dp[505][505], back[505][505];
string s[N], t;
void solve(){
    cin >> n >> m >> k;
    for(int i = 0; i < n; ++i) cin >> s[i];
    cin >> t;
    for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) dp[i][j] = back[i][j] = 0;
    for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) if(s[i][j] == '.') back[i][j] = 1;
    int ans = 0;
    for(int l = 1; l <= k; ++l){
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(back[i][j]){
                    int x = i, y = j;
                    if(t[l - 1] == '?'){
                        for(int h = 0; h < 4; ++h){
                            x += arr[h][0], y += arr[h][1];
                            if(x>=0&&x<n&&y>=0&&y<m&&s[x][y]=='.') dp[x][y] = 1;
                            x -= arr[h][0], y -= arr[h][1];
                        }
                    }else{
                        if(t[l - 1] == 'N') x--;
                        else if(t[l - 1] == 'S') x++;
                        else if(t[l - 1] == 'W') y--;
                        else y++;
                        if(x>=0&&x<n&&y>=0&&y<m&&s[x][y]=='.') dp[x][y] = 1;
                    }
                }
            }
        }
        for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) back[i][j] = dp[i][j], dp[i][j] = 0;
    }
    for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) ans += back[i][j];
    cout << ans;
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:60:16: warning: unused variable 'aa' [-Wunused-variable]
   60 |     int T = 1, aa;
      |                ^~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 31700 KB Output is correct
2 Correct 18 ms 31712 KB Output is correct
3 Correct 16 ms 31700 KB Output is correct
4 Correct 14 ms 31700 KB Output is correct
5 Correct 15 ms 31732 KB Output is correct
6 Correct 18 ms 31656 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 31700 KB Output is correct
2 Correct 18 ms 31712 KB Output is correct
3 Correct 16 ms 31700 KB Output is correct
4 Correct 14 ms 31700 KB Output is correct
5 Correct 15 ms 31732 KB Output is correct
6 Correct 18 ms 31656 KB Output is correct
7 Correct 22 ms 31756 KB Output is correct
8 Correct 18 ms 31700 KB Output is correct
9 Correct 16 ms 31700 KB Output is correct
10 Correct 17 ms 31700 KB Output is correct
11 Correct 15 ms 31700 KB Output is correct
12 Correct 32 ms 31700 KB Output is correct
13 Correct 35 ms 31632 KB Output is correct
14 Correct 27 ms 31700 KB Output is correct
15 Correct 16 ms 31756 KB Output is correct
16 Correct 17 ms 31744 KB Output is correct
17 Correct 38 ms 31732 KB Output is correct
18 Correct 35 ms 31704 KB Output is correct
19 Correct 30 ms 31760 KB Output is correct
20 Correct 19 ms 31700 KB Output is correct
21 Correct 17 ms 31644 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 31700 KB Output is correct
2 Correct 18 ms 31712 KB Output is correct
3 Correct 16 ms 31700 KB Output is correct
4 Correct 14 ms 31700 KB Output is correct
5 Correct 15 ms 31732 KB Output is correct
6 Correct 18 ms 31656 KB Output is correct
7 Correct 22 ms 31756 KB Output is correct
8 Correct 18 ms 31700 KB Output is correct
9 Correct 16 ms 31700 KB Output is correct
10 Correct 17 ms 31700 KB Output is correct
11 Correct 15 ms 31700 KB Output is correct
12 Correct 32 ms 31700 KB Output is correct
13 Correct 35 ms 31632 KB Output is correct
14 Correct 27 ms 31700 KB Output is correct
15 Correct 16 ms 31756 KB Output is correct
16 Correct 17 ms 31744 KB Output is correct
17 Correct 38 ms 31732 KB Output is correct
18 Correct 35 ms 31704 KB Output is correct
19 Correct 30 ms 31760 KB Output is correct
20 Correct 19 ms 31700 KB Output is correct
21 Correct 17 ms 31644 KB Output is correct
22 Execution timed out 1089 ms 32340 KB Time limit exceeded
23 Halted 0 ms 0 KB -