# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386569 | SansPapyrus683 | Mecho (IOI09_mecho) | C++17 | 632 ms | 7008 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using std::cout;
using std::endl;
using std::vector;
using std::pair;
vector<pair<int, int>> neighbors(const pair<int, int>& at, int row_num, int col_num) {
vector<pair<int, int>> neighbors;
if (at.first > 0) {
neighbors.push_back({at.first - 1, at.second});
}
if (at.second > 0) {
neighbors.push_back({at.first, at.second - 1});
}
if (at.first < row_num - 1) {
neighbors.push_back({at.first + 1, at.second});
}
if (at.second < col_num - 1) {
neighbors.push_back({at.first, at.second + 1});
}
return neighbors;
}
class Field {
private:
const vector<vector<char>> field;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |