oj.uz

답안 #328789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328789 2020-11-18T05:14:03 Z egas Nautilus (BOI19_nautilus) C++14
66 / 100
 433 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

int dp[101][101][5001];

int solve(int r,int c,int pt,vector<string> &grid,string &path) {

    if(r<0 or r>=grid.size() or c<0 or c>=grid[0].size())return 0;

    if(grid[r][c]!='.')return 0;

    if(pt==path.size()) {

        if(dp[r][c][pt]!=-1) {

            return 0;

        }

        dp[r][c][pt]=1;

        return 1;

    }

    if(dp[r][c][pt]!=-1) {

        return 0;

    }

    if(path[pt]=='?') {

        dp[r][c][pt] = solve(r,c-1,pt+1,grid,path) + solve(r,c+1,pt+1,grid,path) + solve(r-1,c,pt+1,grid,path) + solve(r+1,c,pt+1,grid,path);

        return dp[r][c][pt];

    } else {

        if(path[pt]=='W') {

            dp[r][c][pt]= solve(r,c-1,pt+1,grid,path);

            return dp[r][c][pt];

        } else if(path[pt]=='E') {

            dp[r][c][pt] = solve(r,c+1,pt+1,grid,path);

            return dp[r][c][pt];

        } else if(path[pt]=='N') {

            dp[r][c][pt]= solve(r-1,c,pt+1,grid,path);

            return dp[r][c][pt];

        } else if(path[pt]=='S') {

            dp[r][c][pt]= solve(r+1,c,pt+1,grid,path);

            return dp[r][c][pt];

        } else {

            assert(0);

        }

    }

    return 0;

}

int32_t main() {

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    int r;

    cin >> r;

    int c;

    cin >> c;

    int m;

    cin >> m;

    vector<string> grid;

    for(int i = 0 ; i < r ; i++) {

        string temp;

        cin >> temp;

        grid.push_back(temp);

    }

    string path;

    cin >> path;

    memset(dp,-1,sizeof dp);

    int res=0;

    for(int i = 0 ; i < r ; i++) {

        for(int j = 0 ; j < c ; j++) {

            res+=solve(i,j,0,grid,path);

        }

    }

    cout << res << '\n';

    return 0;

}

Compilation message

nautilus.cpp: In function 'int solve(int, int, int, std::vector<std::__cxx11::basic_string<char> >&, std::string&)':
nautilus.cpp:9:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     if(r<0 or r>=grid.size() or c<0 or c>=grid[0].size())return 0;
      |               ~^~~~~~~~~~~~~
nautilus.cpp:9:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     if(r<0 or r>=grid.size() or c<0 or c>=grid[0].size())return 0;
      |                                        ~^~~~~~~~~~~~~~~~
nautilus.cpp:13:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     if(pt==path.size()) {
      |        ~~^~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 200172 KB Output is correct
2 Correct 109 ms 200044 KB Output is correct
3 Correct 107 ms 200044 KB Output is correct
4 Correct 105 ms 200044 KB Output is correct
5 Correct 111 ms 200044 KB Output is correct
6 Correct 103 ms 199968 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 200172 KB Output is correct
2 Correct 109 ms 200044 KB Output is correct
3 Correct 107 ms 200044 KB Output is correct
4 Correct 105 ms 200044 KB Output is correct
5 Correct 111 ms 200044 KB Output is correct
6 Correct 103 ms 199968 KB Output is correct
7 Correct 139 ms 200044 KB Output is correct
8 Correct 122 ms 200044 KB Output is correct
9 Correct 109 ms 200044 KB Output is correct
10 Correct 108 ms 200044 KB Output is correct
11 Correct 110 ms 200044 KB Output is correct
12 Correct 163 ms 200044 KB Output is correct
13 Correct 140 ms 200064 KB Output is correct
14 Correct 125 ms 200044 KB Output is correct
15 Correct 112 ms 200044 KB Output is correct
16 Correct 106 ms 200044 KB Output is correct
17 Correct 180 ms 200044 KB Output is correct
18 Correct 159 ms 200044 KB Output is correct
19 Correct 116 ms 200044 KB Output is correct
20 Correct 116 ms 200044 KB Output is correct
21 Correct 104 ms 200044 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 200172 KB Output is correct
2 Correct 109 ms 200044 KB Output is correct
3 Correct 107 ms 200044 KB Output is correct
4 Correct 105 ms 200044 KB Output is correct
5 Correct 111 ms 200044 KB Output is correct
6 Correct 103 ms 199968 KB Output is correct
7 Correct 139 ms 200044 KB Output is correct
8 Correct 122 ms 200044 KB Output is correct
9 Correct 109 ms 200044 KB Output is correct
10 Correct 108 ms 200044 KB Output is correct
11 Correct 110 ms 200044 KB Output is correct
12 Correct 163 ms 200044 KB Output is correct
13 Correct 140 ms 200064 KB Output is correct
14 Correct 125 ms 200044 KB Output is correct
15 Correct 112 ms 200044 KB Output is correct
16 Correct 106 ms 200044 KB Output is correct
17 Correct 180 ms 200044 KB Output is correct
18 Correct 159 ms 200044 KB Output is correct
19 Correct 116 ms 200044 KB Output is correct
20 Correct 116 ms 200044 KB Output is correct
21 Correct 104 ms 200044 KB Output is correct
22 Runtime error 433 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -