oj.uz

Submission #125433

# Submission time Handle Problem Language Result Execution time Memory
125433 2019-07-05T09:50:38 Z eriksuenderhauf Pipes (CEOI15_pipes) C++11
100 / 100
 1735 ms 12108 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e5 + 5;
const double eps = 1e-9;
vector<int> adj[MAXN];
int cnt = 1, par[MAXN], par2[MAXN], lo[MAXN];

int qry(int x) { return x == par[x] ? x : par[x] = qry(par[x]); }
void join(int u, int v) { u = qry(u), v = qry(v); par[u] = v; }

int qry2(int x) { return x == par2[x] ? x : par2[x] = qry2(par2[x]); }
void join2(int u, int v) { u = qry2(u), v = qry2(v); par2[u] = v; }

void dfs(int u, int p) {
	par[u] = lo[u] = cnt++;
	while (!adj[u].empty()) {
		int v = adj[u].back();
		adj[u].pop_back();
		if (!par[v]) {
			dfs(v, u);
			lo[u] = min(lo[u], lo[v]);
			if (lo[v] > par[u] && qry2(u) != qry2(v))
				printf("%d %d\n", u, v);
		} else if (v != p)
			lo[u] = min(lo[u], par[v]);
	}
}

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++)
		par[i] = par2[i] = i;
	for (int i = 0; i < m; i++) {
		int u, v; scanf("%d %d", &u, &v);
		if (qry2(u) == qry2(v))
			continue;
		if (qry(u) == qry(v)) {
			adj[u].pb(v);
			adj[v].pb(u);
			join2(u, v);
			continue;
		}
		join(u, v);
		adj[u].pb(v);
		adj[v].pb(u);
	}
	for (int i = 1; i <= n; i++)
		par[i] = 0;
	for (int i = 1; i <= n; i++)
		if (!par[i])
			dfs(i, 0);
    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:67:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u, v; scanf("%d %d", &u, &v);
             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3064 KB Output is correct
2 Correct 9 ms 2936 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 3020 KB Output is correct
2 Correct 141 ms 2880 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 3576 KB Output is correct
2 Correct 292 ms 3192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 4984 KB Output is correct
2 Correct 346 ms 4728 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 9452 KB Output is correct
2 Correct 505 ms 6904 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 885 ms 10328 KB Output is correct
2 Correct 829 ms 8332 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1181 ms 12104 KB Output is correct
2 Correct 1105 ms 8768 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1452 ms 12108 KB Output is correct
2 Correct 1362 ms 8440 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1735 ms 11640 KB Output is correct
2 Correct 1627 ms 9592 KB Output is correct