oj.uz

답안 #328784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328784 2020-11-18T04:58:42 Z egas Nautilus (BOI19_nautilus) C++14
29 / 100
 1000 ms 876 KB 
#include <bits/stdc++.h>

using namespace std;

set<pair<long long,long long> > ss;

long long solve(long long r,long long c,long long 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()){

        ss.insert({r,c});

            return 1;

        }

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

    return 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);

    } else {

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

            return solve(r,c-1,pt+1,grid,path);

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

            return solve(r,c+1,pt+1,grid,path);

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

            return solve(r-1,c,pt+1,grid,path);

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

            return solve(r+1,c,pt+1,grid,path);

        } else {

            assert(0);

        }

    }

    return 0;

}

int32_t main() {

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    long long r;

    cin >> r;

    long long c;

    cin >> c;

    long long m;

    cin >> m;

    vector<string> grid;

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

        string temp;

        cin >> temp;

        grid.push_back(temp);

    }

    string path;

    cin >> path;

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

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

            solve(i,j,0,grid,path);

        }

    }

    cout << ss.size() << '\n';

    return 0;

}

Compilation message

nautilus.cpp: In function 'long long int solve(long long int, long long int, long long int, std::vector<std::__cxx11::basic_string<char> >&, std::string&)':
nautilus.cpp:9:16: warning: comparison of integer expressions of different signedness: 'long long 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: 'long long 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: 'long long 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 14 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Execution timed out 1084 ms 432 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 876 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Execution timed out 1084 ms 432 KB Time limit exceeded
8 Halted 0 ms 0 KB -