# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153132 | georgerapeanu | Synchronization (JOI13_synchronization) | C++11 | 425 ms | 17912 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int NMAX = 1e5;
int n,m,q;
pair<int,int> edge[NMAX + 5];
vector<int> graph[NMAX + 5];
int fa[NMAX + 5];
int fst[NMAX + 5];
int lst[NMAX + 5];
int len;
int aint[4 * NMAX + 5];
bool used[NMAX + 5];
int dp[NMAX + 5];
int taken_father[NMAX + 5];
int lin[NMAX + 5];
void predfs(int nod,int tata){
fst[nod] = ++len;
lin[len] = nod;
fa[nod] = tata;
for(auto it:graph[nod]){
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... |