# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25767 | kriii | 전압 (JOI14_voltage) | C++14 | 229 ms | 15160 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>
using namespace std;
vector<int> G[100100];
int N,M,X[200200],Y[200200],C[200200];
int D[100100],U[100100];
int gety(int x, int i)
{
return X[i] == x ? Y[i] : X[i];
}
int bridge, badback, badmx, badmxcnt, badcnt[100100], goodcnt[100100];
void dfs(int x)
{
U[x] = D[x];
for (auto &i : G[x]) if (!C[i]){
C[i] = 1;
int y = gety(x,i);
if (D[y] == 0){
D[y] = D[x] + 1;
dfs(y);
badcnt[x] += badcnt[y];
goodcnt[x] += goodcnt[y];
if (U[y] == D[y]) bridge++;
if (U[x] > U[y]) U[x] = U[y];
}
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... |