# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86935 | long10024070 | Synchronization (JOI13_synchronization) | C++11 | 355 ms | 19328 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.
#define Link "https://oj.uz/problem/view/JOI13_synchronization?fbclid=IwAR13-gsTQ4n3SSIS6NzUA_X7iaFxN_3aJYCyIeVRZb88iIzHhvMV6K31H-M"
#include <iostream>
#include <cstdio>
#include <vector>
#define TASK "Synchronization"
using namespace std;
const int maxn = 1e5 + 1;
int n,m,q,_u[maxn],_v[maxn],h[maxn],st[maxn],en[maxn],cnt,True[maxn],f[maxn],mem[maxn];
vector <int> e[maxn];
struct T_node
{
int l,r,mx;
} node[maxn*6];
bool b[maxn];
void Enter()
{
cin >> n >> m >> q;
for (int i=1;i<n;++i) {
cin >> _u[i] >> _v[i];
e[_u[i]].push_back(_v[i]);
e[_v[i]].push_back(_u[i]);
}
}
void DFS(int u, int p)
# | 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... |