# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537339 | wiwiho | 수도 (JOI20_capital_city) | C++14 | 3055 ms | 32256 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 mp make_pair
#define F first
#define S second
#define eb emplace_back
#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
using namespace std;
using pii = pair<int, int>;
int n, m;
vector<int> C;
vector<vector<int>> g;
vector<vector<int>> cv;
vector<int> pr;
void dfs(int now, int p){
pr[now] = p;
for(int i : g[now]){
if(i == p) continue;
dfs(i, now);
}
}
int solve(int s){
# | 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... |