oj.uz

Submission #328627

# Submission time Handle Problem Language Result Execution time Memory
328627 2020-11-17T11:13:16 Z egas Nautilus (BOI19_nautilus) C++14
29 / 100
 5 ms 876 KB 
#include <bits/stdc++.h>

using namespace std;

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;

    set<pair<long long,long long> > res;

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

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

            long long curR=i;

            long long curC=j;

            long long pt=0;

            while(pt<path.length() and curR>=0 and curR<r and curC>=0 and curC<c and grid[curR][curC]=='.') {

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

                    curR--;

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

                    curR++;

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

                    curC--;

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

                    curC++;

                }
				pt++;
            }

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

                res.insert({curR,curC});

            }

        }

    }

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

    return 0;

}

Compilation message

nautilus.cpp: In function 'int32_t main()':
nautilus.cpp:51:21: 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]
   51 |             while(pt<path.length() and curR>=0 and curR<r and curC>=0 and curC<c and grid[curR][curC]=='.') {
      |                   ~~^~~~~~~~~~~~~~
nautilus.cpp:73:18: 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]
   73 |             if(pt==path.length()) {
      |                ~~^~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Incorrect 5 ms 876 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Incorrect 5 ms 876 KB Output isn't correct
8 Halted 0 ms 0 KB -