oj.uz

Submission #202657

# Submission time Handle Problem Language Result Execution time Memory
202657 2020-02-17T16:14:27 Z stefdasca Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 155896 KB 
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

// #define fisier 1

using namespace std;

typedef long long ll;

int n, m, k;

string s;
char mat[502][502];
bitset<5001> dp[502][502];

int main()
{

    #ifdef fisier
        ifstream f("input.in");
        ofstream g("output.out");
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m >> k;
    for(int i = 0; i < n; ++i)
        cin >> mat[i];
    cin >> s;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            if(mat[i][j] != '#')
                dp[i][j][0] = 1;
    for(int x = 0; x < k; ++x)
    {
        if(s[x] == 'E')
        {
            for(int i = 0; i < n; ++i)
                for(int j = 0; j + 1 < m; ++j)
                {
                    if(dp[i][j][x] == 0)
                        continue;
                    if(mat[i][j+1] != '#')
                        dp[i][j+1][x+1] = 1;
                }
        }
        if(s[x] == 'W')
        {
            for(int i = 0; i < n; ++i)
                for(int j = 1; j < m; ++j)
                {
                    if(dp[i][j][x] == 0)
                        continue;
                    if(mat[i][j-1] != '#')
                        dp[i][j-1][x+1] = 1;
                }
        }
        if(s[x] == 'N')
        {
            for(int i = 1; i < n; ++i)
                for(int j = 0; j < m; ++j)
                {
                    if(dp[i][j][x] == 0)
                        continue;
                    if(mat[i-1][j] != '#')
                        dp[i-1][j][x+1] = 1;
                }
        }
        if(s[x] == 'S')
        {
            for(int i = 0; i + 1 < n; ++i)
                for(int j = 0; j < m; ++j)
                {
                    if(dp[i][j][x] == 0)
                        continue;
                    if(mat[i+1][j] != '#')
                        dp[i+1][j][x+1] = 1;
                }
        }
        if(s[x] == '?')
        {
            for(int i = 0; i < n; ++i)
                for(int j = 0; j < m; ++j)
                {
                    if(dp[i][j][x] == 0)
                        continue;
                    if(j + 1 < m && mat[i][j+1] != '#')
                        dp[i][j+1][x+1] = 1;
                    if(i + 1 < n && mat[i+1][j] != '#')
                        dp[i+1][j][x+1] = 1;
                    if(j && mat[i][j-1] != '#')
                        dp[i][j-1][x+1] = 1;
                    if(i && mat[i-1][j] != '#')
                        dp[i-1][j][x+1] = 1;
                }
        }
    }
    int ans = 0;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            ans += dp[i][j][k];
    cout << ans;
    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7032 KB Output is correct
2 Correct 12 ms 6904 KB Output is correct
3 Correct 11 ms 6904 KB Output is correct
4 Correct 11 ms 6648 KB Output is correct
5 Correct 11 ms 5240 KB Output is correct
6 Correct 7 ms 504 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7032 KB Output is correct
2 Correct 12 ms 6904 KB Output is correct
3 Correct 11 ms 6904 KB Output is correct
4 Correct 11 ms 6648 KB Output is correct
5 Correct 11 ms 5240 KB Output is correct
6 Correct 7 ms 504 KB Output is correct
7 Correct 14 ms 7032 KB Output is correct
8 Correct 14 ms 6904 KB Output is correct
9 Correct 12 ms 6520 KB Output is correct
10 Correct 11 ms 5236 KB Output is correct
11 Correct 8 ms 504 KB Output is correct
12 Correct 16 ms 6904 KB Output is correct
13 Correct 17 ms 6904 KB Output is correct
14 Correct 19 ms 6904 KB Output is correct
15 Correct 11 ms 5240 KB Output is correct
16 Correct 8 ms 504 KB Output is correct
17 Correct 16 ms 6904 KB Output is correct
18 Correct 20 ms 6904 KB Output is correct
19 Correct 17 ms 6520 KB Output is correct
20 Correct 13 ms 5244 KB Output is correct
21 Correct 8 ms 504 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7032 KB Output is correct
2 Correct 12 ms 6904 KB Output is correct
3 Correct 11 ms 6904 KB Output is correct
4 Correct 11 ms 6648 KB Output is correct
5 Correct 11 ms 5240 KB Output is correct
6 Correct 7 ms 504 KB Output is correct
7 Correct 14 ms 7032 KB Output is correct
8 Correct 14 ms 6904 KB Output is correct
9 Correct 12 ms 6520 KB Output is correct
10 Correct 11 ms 5236 KB Output is correct
11 Correct 8 ms 504 KB Output is correct
12 Correct 16 ms 6904 KB Output is correct
13 Correct 17 ms 6904 KB Output is correct
14 Correct 19 ms 6904 KB Output is correct
15 Correct 11 ms 5240 KB Output is correct
16 Correct 8 ms 504 KB Output is correct
17 Correct 16 ms 6904 KB Output is correct
18 Correct 20 ms 6904 KB Output is correct
19 Correct 17 ms 6520 KB Output is correct
20 Correct 13 ms 5244 KB Output is correct
21 Correct 8 ms 504 KB Output is correct
22 Execution timed out 1098 ms 155896 KB Time limit exceeded
23 Halted 0 ms 0 KB -