oj.uz

Submission #440948

# Submission time Handle Problem Language Result Execution time Memory
440948 2021-07-03T15:09:52 Z sinamhdv Pipes (CEOI15_pipes) C++11
10 / 100
 1522 ms 65536 KB 
// CEOI15_pipes
// 2nd solution
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 100010
#define LOGN 19

int n, m;
vector<int> adj[MAXN];
bool mark[MAXN];
int val[MAXN], h[MAXN], par[MAXN];

int tree[MAXN], be[MAXN];
int getroot(int x, int *dpar)
{
	return dpar[x] == x ? x : dpar[x] = getroot(dpar[x], dpar);
}
bool merge(int x, int y, int *dpar)
{
	x = getroot(x, dpar);
	y = getroot(y, dpar);
	if (x == y) return false;
	dpar[x] = y;
	return true;
}

void dfs1(int v)
{
	mark[v] = true;
	for (int u : adj[v])
	{
		if (mark[u])
		{
			if (h[u] < h[v] && u != par[v]) val[u]--, val[v]++;
			continue;
		}
		h[u] = h[v] + 1;
		par[u] = v;
		dfs1(u);
	}
}

void dfs2(int v)
{
	mark[v] = true;
	for (int u : adj[v]) if (!mark[u]) dfs2(u), val[v] += val[u];
	if (par[v] && val[v] == 0) cout << v << ' ' << par[v] << endl;
}

int32_t main(void)
{
	fast_io;
	cin >> n >> m;

	iota(tree, tree + n + 5, 0);
	iota(be, be + n + 5, 0);

	FOR(i, 0, m)
	{
		int x, y;
		cin >> x >> y;
		if (merge(x, y, tree) || merge(x, y, be))
		{
			adj[x].pb(y);
			adj[y].pb(x);
		}
	}

	FOR(i, 1, n + 1) if (!mark[i]) dfs1(i);

	memset(mark, 0, sizeof(mark));
	FOR(i, 1, n + 1) if (!mark[i]) dfs2(i);

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2764 KB Output is correct
2 Incorrect 2 ms 2764 KB Wrong number of edges

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3276 KB Output is correct
2 Incorrect 6 ms 2996 KB Wrong number of edges

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 3080 KB Output is correct
2 Incorrect 114 ms 2948 KB Wrong number of edges

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 197 ms 3888 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 5468 KB Output is correct
2 Correct 287 ms 5220 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 10892 KB Output is correct
2 Incorrect 481 ms 7420 KB Wrong number of edges

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 797 ms 12168 KB Output is correct
2 Incorrect 717 ms 9272 KB Wrong number of edges

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1053 ms 14344 KB Output is correct
2 Incorrect 1101 ms 9500 KB Wrong number of edges

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1269 ms 14344 KB Output is correct
2 Runtime error 1165 ms 62460 KB Memory limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1522 ms 13844 KB Output is correct
2 Runtime error 1424 ms 65536 KB Memory limit exceeded