# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88699 | popovicirobert | Tracks in the Snow (BOI13_tracks) | C++14 | 1288 ms | 309456 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 lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
const int MAXN = 4000;
char mat[MAXN + 1][MAXN + 1];
int sef[MAXN * MAXN + 1];
int myfind(int x) {
if(sef[x] == 0)
return x;
return sef[x] = myfind(sef[x]);
}
inline void myunion(int x, int y) {
x = myfind(x), y = myfind(y);
if(x != y) {
sef[x] = y;
}
}
bool vis[MAXN * MAXN + 1];
char dl[] = {-1, 0, 1, 0}, dc[] = {0, -1, 0, 1};
int n, m;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |