# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701167 | Do_you_copy | Zagrade (COI17_zagrade) | C++17 | 1220 ms | 47996 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 fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int maxN = 3e5 + 100;
const int inf = 0x3f3f3f3f;
//const int Mod =
string s;
int n;
bool visited[maxN];
int sz[maxN];
int cnt[maxN];
vector <int> adj[maxN];
int a[maxN];
void pre_dfs(int u, int p){
sz[u] = 1;
for (int i: adj[u]){
if (i == p || visited[i]) continue;
pre_dfs(i, u);
sz[u] += sz[i];
}
}
int find_cent(int u, int p, int szz){
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... |