oj.uz

Submission #97551

# Submission time Handle Problem Language Result Execution time Memory
97551 2019-02-17T01:24:08 Z jasony123123 Pipes (CEOI15_pipes) C++17
0 / 100
 1238 ms 7600 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
#endif
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll INF = 1e14;
/***********************CEOI 2015 D1 Pipes*****************************************/

struct UnionFind {
	int par[100001];

	void init(int NN) {
		FOR(i, 0, NN) par[i] = i;
	}

	int find(int x) {
		if (par[x] != x) par[x] = find(par[x]);
		return par[x];
	}

	bool unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y) return false;
		par[y] = x;
		return true;
	}
} uf1, uf2;

int n, m;
v<int> adj[100001];

int main() {
	io();
	cin >> n >> m;

	uf1.init(n + 1), uf2.init(n + 1);
	FOR(i, 0, m) {
		int a, b; cin >> a >> b;
		if (uf1.unite(a, b) || uf2.unite(a, b)) {
			adj[a].push_back(b), adj[b].push_back(a);
		}
	}

	return 0;
}

/*

findBridges();
return 0;
int lo[100001], ind[100001], t = 0;

void tarjan(int cur, int par = -1) {
ind[cur] = lo[cur] = t++;
for (int nex : adj[cur])  {
if (ind[nex] == -1) {
tarjan(nex, cur);
lo[cur] = min(lo[cur], lo[nex]);
if (lo[nex] == ind[nex]) {
cout << cur << " " << nex << "\n";
}
}
else if (nex != par)
lo[cur] = min(lo[cur], ind[nex]);
}
}

void findBridges() {
FOR(i, 0, n + 1)
ind[i] = -1, lo[i] = 0;
FOR(i, 0, n + 1) if (ind[i] == -1)
tarjan(i);
}

*/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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