# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795665 | someone | Virus Experiment (JOI19_virus) | C++14 | 2076 ms | 97448 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 int long long
#define x first
#define y second
using namespace std;
struct Candidat {
pair<int, int> act, pre;
};
const int N = 2e5 + 42, M = 805, INF = 1e18 + 42;
int dl[] = {-1, 0, 1, 0},
dc[] = {0, -1, 0, 1};
char ch[N], w[] = {'N', 'W', 'S', 'E'};
vector<pair<int, int>> cfc[M][M];
pair<int, int> acces[M][M], same[M][M];
int m, row, col, mini = INF, nb = 0, maxi[16], u[M][M];
pair<int, int> getCFC(pair<int, int> coo) {
if(same[coo.x][coo.y] == coo)
return coo;
return same[coo.x][coo.y] = getCFC(same[coo.x][coo.y]);
}
pair<int, int> getAcces(pair<int, int> coo) {
if(acces[coo.x][coo.y] == coo)
return coo;
return acces[coo.x][coo.y] = getAcces(acces[coo.x][coo.y]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |