# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090885 | Muhammet | T-Covering (eJOI19_covering) | C++17 | 745 ms | 74120 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;
#define ff first
#define ss second
#define sz(s) (int)s.size()
int n, m, k;
vector <vector <int>> a, b;
vector <pair<int,int>> v;
vector <vector<int>> vc;
map <pair<int,int>,int> vis, vis1;
map <int,int> vi;
vector <int> p, v2, v3;
int fnd(int x){
if(p[x] == x) return x;
return p[x] = fnd(p[x]);
}
void dfs(int x){
vi[x] = 1;
v2.push_back(x);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |