# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43033 | RayaBurong25_1 | Mousetrap (CEOI17_mousetrap) | C++14 | 1321 ms | 122688 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 <stdio.h>
#include <vector>
std::vector<int> AdjList[1000005];
int PhaseII[1000005];
int m, t;
void calcPhaseII(int u, int pa)
{
int i, v, s = AdjList[u].size();
if (pa == t)
PhaseII[u] = s - 3;
else if (s == 1 || s == 2)
PhaseII[u] = 1;
else
PhaseII[u] = s - 2;
PhaseII[u] += PhaseII[pa];
// printf("u%d PhaseII%d\n", u, PhaseII[u]);
for (i = 0; i < s; i++)
{
v = AdjList[u][i];
if (v != pa)
calcPhaseII(v, u);
}
}
int PhaseI[1000005];
int min(int a, int b)
{
return (a < b)?a:b;
}
void calcPhaseI(int u, int pa)
{
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... |