# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715912 | Farbod | Tracks in the Snow (BOI13_tracks) | C++17 | 1618 ms | 1042932 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.
/*
* In the name of God
*
* Author: Farbod Doost
* Last Modified: Tue, 28 Mar 2023 (15:39:56)
*
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
int n, m;
bool vis[N][N];
char a[N][N];
int T = 0;
deque <pair <short int, short int>> vec;
bool t = 0;
short int dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1};
bool f(char a, char b)
{
if (t)
return a != b;
return a == b;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |