oj.uz

Submission #527235

# Submission time Handle Problem Language Result Execution time Memory
527235 2022-02-17T04:04:39 Z siewjh Pipes (CEOI15_pipes) C++17
10 / 100
 1908 ms 65540 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <set>
using namespace std;
const int MAXN = 100'005;
vector<int> adjlist[MAXN];
int tvis[MAXN], lo[MAXN];
int cnt = 0;
set<pair<int, int>> ans;
void dfs(int x, int par) {
	tvis[x] = lo[x] = cnt++;
	for (auto nxt : adjlist[x]) {
		if (nxt == par) continue;
		if (tvis[nxt] != INT_MAX) lo[x] = min(lo[x], tvis[nxt]);
		else {
			dfs(nxt, x);
			lo[x] = min(lo[x], lo[nxt]);
			if (lo[nxt] > tvis[x]) ans.insert({ min(nxt, x), max(nxt, x) });
		}
	}
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int nodes, edges; cin >> nodes >> edges;
	set<pair<int, int>> elist, mult;
	for (int i = 0; i < edges; i++) {
		int a, b; cin >> a >> b;
		if (a > b) swap(a, b);
		adjlist[a].push_back(b);
		adjlist[b].push_back(a);
		if (elist.count({ a, b })) mult.insert({ a, b });
	}
	for (int i = 1; i <= nodes; i++) tvis[i] = INT_MAX;
	for (int i = 1; i <= nodes; i++) 
		if (tvis[i] == INT_MAX)
			dfs(i, -1);
	for (auto x : ans) 
		if (!mult.count(x))
			cout << x.first << ' ' << x.second << '\n';
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2672 KB Output is correct
2 Incorrect 2 ms 2636 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3324 KB Output is correct
2 Incorrect 4 ms 3020 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 11924 KB Output is correct
2 Correct 125 ms 11036 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 15800 KB Output is correct
2 Runtime error 292 ms 23264 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 448 ms 27072 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 613 ms 32676 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1103 ms 54664 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1432 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1694 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1908 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -