oj.uz

답안 #202655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202655 2020-02-17T16:06:58 Z stefdasca Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 24004 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<501> dp[5002][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[0][i][j] = 1;
    for(int x = 0; x < k; ++x)
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
            {
                if(dp[x][i][j] == 0)
                    continue;
                if(s[x] == 'E' || s[x] == '?')
                {
                    if(j + 1 < m && mat[i][j+1] != '#')
                        dp[x+1][i][j+1] = 1;
                }
                if(s[x] == 'S' || s[x] == '?')
                {
                    if(i + 1 < n && mat[i+1][j] != '#')
                        dp[x+1][i+1][j] = 1;
                }
                if(s[x] == 'W' || s[x] == '?')
                {
                    if(j && mat[i][j-1] != '#')
                        dp[x+1][i][j-1] = 1;
                }
                if(s[x] == 'N' || s[x] == '?')
                {
                    if(i && mat[i-1][j] != '#')
                        dp[x+1][i-1][j] = 1;
                }
            }
    int ans = 0;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            ans += dp[k][i][j];
    cout << ans;
    return 0;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 7 ms 1200 KB Output is correct
4 Correct 7 ms 888 KB Output is correct
5 Correct 7 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 7 ms 1200 KB Output is correct
4 Correct 7 ms 888 KB Output is correct
5 Correct 7 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 11 ms 1448 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 8 ms 1400 KB Output is correct
10 Correct 7 ms 1016 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 13 ms 1528 KB Output is correct
13 Correct 16 ms 1400 KB Output is correct
14 Correct 17 ms 1400 KB Output is correct
15 Correct 7 ms 1400 KB Output is correct
16 Correct 7 ms 892 KB Output is correct
17 Correct 14 ms 1400 KB Output is correct
18 Correct 17 ms 1400 KB Output is correct
19 Correct 13 ms 1400 KB Output is correct
20 Correct 8 ms 1400 KB Output is correct
21 Correct 7 ms 892 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1400 KB Output is correct
2 Correct 8 ms 1400 KB Output is correct
3 Correct 7 ms 1200 KB Output is correct
4 Correct 7 ms 888 KB Output is correct
5 Correct 7 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 11 ms 1448 KB Output is correct
8 Correct 11 ms 1400 KB Output is correct
9 Correct 8 ms 1400 KB Output is correct
10 Correct 7 ms 1016 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 13 ms 1528 KB Output is correct
13 Correct 16 ms 1400 KB Output is correct
14 Correct 17 ms 1400 KB Output is correct
15 Correct 7 ms 1400 KB Output is correct
16 Correct 7 ms 892 KB Output is correct
17 Correct 14 ms 1400 KB Output is correct
18 Correct 17 ms 1400 KB Output is correct
19 Correct 13 ms 1400 KB Output is correct
20 Correct 8 ms 1400 KB Output is correct
21 Correct 7 ms 892 KB Output is correct
22 Execution timed out 1082 ms 24004 KB Time limit exceeded
23 Halted 0 ms 0 KB -