# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133973 | Lawliet | Tracks in the Snow (BOI13_tracks) | C++14 | 2164 ms | 1048576 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>
#define MAX 4010
using namespace std;
typedef pair<int,int> pii;
int dx[] = {0 , 0 , 1 , -1};
int dy[] = {1 , -1 , 0 , 0};
int n, m;
int curNode;
int node[MAX][MAX];
int dist[MAX*MAX];
bool marc[MAX][MAX];
bool marcBFS[MAX*MAX];
pii cell[MAX*MAX];
char v[MAX][MAX];
//vector<int> dist;
//vector<bool> marcBFS;
//vector<pii> cell;
queue<int> q;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |