# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224961 | NONAME | Konj (COCI19_konj) | C++17 | 68 ms | 5240 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>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 2 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
int n, pr[N], x1[N], x2[N], yy1[N], y2[N], fx, x[400][400], sx, sy, lftx, lfty, rghx, rghy;
char rs[400][400];
int f(int x) { return (x == pr[x]) ? x : pr[x] = f(pr[x]); }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |