| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 839386 | ArashJafariyan | Mecho (IOI09_mecho) | C++17 | 549 ms | 6860 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;
using ll = long long;
using pii = pair<int, int>;
#define F first
#define S second
#define pb push_back
#define size(a) (int) a.size()
#define all(a) a.begin(), a.end()
const int maxn = 800 + 4, inf = 1e8;
int n, s, mx, my, dx, dy, d[maxn][maxn], save[maxn][maxn];
bitset<maxn> vis[maxn];
string a[maxn];
queue<array<int, 2>> q;
void rest() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
vis[i][j] = 0;
d[i][j] = inf;
}
}
return;
}
bool check0(int x, int y, int dis) {
bool ret = (0 <= x && x < n);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||