# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16464 | kaTkaHr | 전압 (JOI14_voltage) | C++14 | 229 ms | 35956 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<string>
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int, int> pii;
const int MX = 100005;
vector<pii> G[MX], B;
vector<int> T[MX];
int C[MX], P[20][MX], lev[MX];
int cnt, ans, cut[MX], con[MX];
void dfs(int x, int p)
{
for (pii cc : G[x]){
int &c = cc.first, &d = cc.second;
if (d == p) continue;
if (C[c] && x > c)B.push_back(pii(x, c));
else if( !C[c] ){
T[x].push_back(c);
P[0][c] = x; lev[c] = lev[x] + 1;
C[c] = 3 - C[x];
dfs(c, d);
# | 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... |