oj.uz

Submission #976481

# Submission time Handle Problem Language Result Execution time Memory
976481 2024-05-06T15:20:17 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>
using namespace std;

int n, m;
string s[500];
bool visited[500][500];

int mvr[4] = {-1, 0, 1, 0};
int mvc[4] = {0, 1, 0, -1};

bool valid(int i, int j) {
    return i >= 0 && j >= 0 && i < n && j < n;
}

int bfs(int i, int j, int cnt) {
    if (visited[i][j]) return -1;

}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }
    if (n == 1) {
        int ans = 0;
        for (int i = 1; i < n - 1; i++) {
            switch(s[0][i]) {
                case 'E': break;
                case 'N': ans++; break;
                case 'W': ans+=2; break;
                case 'S': ans+=3; break;
                case 'X': cout << -1; return 0;
            }
        }
    }
}

Compilation message

adventure.cpp: In function 'int bfs(int, int, int)':
adventure.cpp:18:1: warning: control reaches end of non-void function [-Wreturn-type]
   18 | }
      | ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -