oj.uz

Submission #230145

# Submission time Handle Problem Language Result Execution time Memory
230145 2020-05-08T17:24:24 Z ruler Pipes (CEOI15_pipes) C++14
30 / 100
 1450 ms 52984 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 1e6 + 7;
 
////////////////////////////////////////////////////////////////////

const int N = 1e5 + 5;

int H[N], M[N];
vector<int> G[N], Q[N];

struct DSU {
	int P[N];
	int GetPar(int v) { return P[v] ? P[v] = GetPar(P[v]) : v; }
	bool Merge(int v, int u) {
		v = GetPar(v), u = GetPar(u);
		if (v == u) return false;
		P[u] = v;
		return true;
	}
} T, B;

int DFS(int v, int p = 0) {
	M[v] = true;
	int dp = H[v];
	bool f = false;
	for (int u : G[v]) {
		if (u == p && !f) { f = true; continue; }
		if (!M[u]) H[u] = H[v] + 1, dp = min(dp, DFS(u, v));
		else dp = min(dp, H[u]);
	}
	if (p && dp == H[v]) cout << p << ends << v << endl;
	return dp;
}

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	int n, m; cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int v, u; cin >> v >> u;
		if (T.Merge(v, u) || B.Merge(v, u)) G[v].push_back(u), G[u].push_back(v);
	}	
	for (int i = 1; i <= n; i++) if (!T.P[i]) DFS(i);

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5632 KB Output is correct
2 Correct 12 ms 5504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 6292 KB Output is correct
2 Correct 111 ms 6160 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 7120 KB Output is correct
2 Runtime error 230 ms 17016 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 8568 KB Output is correct
2 Runtime error 321 ms 21312 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 13048 KB Output is correct
2 Runtime error 426 ms 28408 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 747 ms 14328 KB Output is correct
2 Runtime error 773 ms 44792 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 977 ms 16376 KB Output is correct
2 Runtime error 945 ms 52984 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1174 ms 24544 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1450 ms 36984 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -