# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
814300 | asdasdqwer | Tracks in the Snow (BOI13_tracks) | C++14 | 957 ms | 257620 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 <bits/stdc++.h>
using namespace std;
#define int int64_t
#define pii pair<int, int>
vector<pii> dir = {{0, 1}, {-1, 0}, {1, 0}, {0, -1}};
int n, m;
pii operator+(const pii &x, const pii &y) {
return {x.first + y.first, x.second + y.second};
}
bool check(const pii &x) {
return x.first >= 0 && x.first < n && x.second >= 0 && x.second < m;
}
signed main() {
cin>>n>>m;
vector<string> a(n);
for (auto &x:a)cin>>x;
vector<vector<int>> d(n, vector<int>(m, 1e9));
deque<pii> dq;
dq.push_front({0, 0});
d[0][0]=1;
int mx = 0;
while (!dq.empty()) {
pii t = dq.front();dq.pop_front();
mx = max(mx, d[t.first][t.second]);
// test all dir
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |