# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92370 | Nodir_Bobiev | Evacuation plan (IZhO18_plan) | C++14 | 1016 ms | 62468 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 <iostream>
# include <vector>
# include <set>
# include <queue>
# include <numeric>
using namespace std;
const int N = 1e5 + 100;
int n, k, m, Q;
int dist[N], S[N], T[N], p[N], ans[N];
bool used[N];
vector < pair < int, int > > gr[N];
queue < int > q;
set < pair < int, int > > st;
set < int > IDS[N];
int FIND(int x){
if(p[x] == x)return x;
else return p[x] = FIND(p[x]);
}
void union_sets(int x, int y, int ds)
{
x = FIND(x);
y = FIND(y);
if(x == y)return;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |