oj.uz

Submission #61417

# Submission time Handle Problem Language Result Execution time Memory
61417 2018-07-25T21:57:03 Z kingpig9 Duathlon (APIO18_duathlon) C++11
5 / 100
 1000 ms 30092 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5 + 10;
 
#define debug(...) fprintf(stderr, __VA_ARGS__)
//#define debug(...)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
 
ll sqr (ll x) {
	return x * x;
}
 
struct union_find {
	int par[MAXN];
	int sz[MAXN];
	union_find() {
		for (int i = 0; i < MAXN; i++) {
			par[i] = i;
			sz[i] = 1;
		}
	}
 
	int find (int x) {
		return x == par[x] ? x : par[x] = find(par[x]);
	}
 
	void merge (int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) {
			return;
		}
		par[x] = y;
		sz[y] += sz[x];
	}
};
 
int N, M;
vector<int> adj[MAXN];
vector<int> verts;
int par[MAXN], depth[MAXN];
bool vis[MAXN];
union_find uf = union_find();
union_find cy = union_find();	//cycle components
 
void dfs (int x, int p) {
	debug("x = %d\n", x);
	verts.push_back(x);
	vis[x] = true;
	par[x] = p;
 
	for (int y : adj[x]) {
		if (y != p) {
			if (vis[y]) {
				if (depth[y] < depth[x]) {
					//then it's a component
					for (int i = x; ; i = par[i]) {
						cy.merge(x, i);
						debug("merge(%d, %d)\n", x, i);
						if (i == y) {
							break;
						}
					}
				}
			} else {
				depth[y] = depth[x] + 1;
				dfs(y, x);
			}
		}
	}
}
 
vector<int> cadj[MAXN];	//comp adjacent
int cpar[MAXN];
int sub[MAXN];
vector<int> cverts;
vector<int> cyv[MAXN];
 
void dfsc (int x) {
	cverts.push_back(x);
	sub[x] = cy.sz[x];
	for (int y : cadj[x]) {
		cpar[y] = x;
		cadj[y].erase(find(all(cadj[y]), x));
		dfsc(y);
		sub[x] += sub[y];
	}
}
 
ll go (int root) {
	dfs(root, 0);
	for (int x : verts) {
		int fx = cy.find(x);
		cyv[fx].push_back(x);
		for (int y : adj[x]) {
			int fy = cy.find(y);
			if (fx != fy) {
				cadj[fx].push_back(fy);
				debug("CADJ %d %d\n", fx, fy);
			}
		}
	}
 
	int szroot = uf.sz[root];
	int froot = cy.find(root);
	dfsc(froot);
 
	//ok let's consider when the stuff is good!
	ll ans = 0;
 
	debug("WE HAVE szroot = %d\n", szroot);
	for (int c : cverts) {
		debug("--------COMPONENT OF %d----------------\n", c);
		//all 3 are in the same component
		ll s = cy.sz[c];
		ans += s * (s - 1) * (s - 2);
		debug("s = %lld\n", s);
 
		//all 3 are in different component. c is the transition.
		//also have to count individual ones
		ll pans = ans;
		ll totsb = 0;
		ll ncho2 = 0;
 		for (int x : cyv[c]) {
			ll sumsb = 0;
			for (int y : adj[x]) {
				int fy = cy.find(y);
				if (c != fy) {
					ll sb;
					if (fy == cpar[c]) {
						sb = szroot - sub[c];
					} else {
						sb = sub[fy];
					}
					ans -= sqr(sb);
					sumsb += sb;
				}
			}
			ans += sqr(sumsb);
			ncho2 -= sqr(sumsb);
			totsb += sumsb;
		}

		assert(totsb == szroot - s);
		ncho2 += sqr(totsb);
		ans += ncho2 * s;
		debug("all3indiff = %lld\n", ans - pans);
 
		//the stuff right below this comment is actually wrong.
		/*
		//two of them are in this component. one of them is in different component
		debug("s = %lld. szroot = %d. So we add %lld\n", s, szroot, 2 * s * (s - 1) * (szroot - s));
		ans += 2 * s * (s - 1) * (szroot - s);	//ans += 4 * C(s, 2) * (szroot - s)
		*/
 
		//ok now this may be correct...
		ans += 2 * s * (s - 1) * (szroot - s);	//ans += 4 * C(s, 2) * (szroot - s)
		ans -= 2 * (s - 1) * (szroot - s);
	}
 
#warning RESET AT THE END!
	verts.clear();
	cverts.clear();
	return ans;
}

namespace brute_force {
	bool adj[10][10];
	bool dp[1 << 10][10];
	vector<int> gmsk[1 << 10];
	bool can[10][10][10];
	
	int brute() {
		//can we try to go from here
		for (int i = 0; i < M; i++) {
			int x, y;
			scanf("%d %d", &x, &y);
			x--;
			y--;
			adj[x][y] = adj[y][x] = true;
		}

		for (int c = 0; c < N; c++) {
			for (int i = 0; i < (1 << N); i++) {
				gmsk[i].clear();
			}	
			fillchar(dp, 0);

			for (int i = 0; i < (1 << N); i++) {
				for (int j = 0; j < (1 << N); j++) {
					if ((i & j) == (1 << c)) {
						gmsk[i].push_back(j);
					}
				}
			}

			dp[1 << c][c] = true;
			for (int i = 0; i < (1 << N); i++) {
				for (int j = 0; j < N; j++) {
					if (dp[i][j]) {
						//then try to go to a new one
						for (int k = 0; k < N; k++) {
							if (!(i & (1 << k)) && adj[j][k]) {
								dp[i ^ (1 << k)][k] = true;
							}
						}
					}
				}
			}

			for (int i = 0; i < N; i++) {
				if (i != c) {
					for (int j = 0; j < N; j++) {
						if (j != i && j != c) {
							//then see if you can go there
							for (int k = 0; k < (1 << N); k++) {
								if (dp[k][i]) {
									for (int m : gmsk[k]) {
										if (dp[m][j]) {
											can[i][c][j] = true;
										}
									}
								}
							}
						}
					}
				}
			}
		}

		int ans = 0;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				for (int k = 0; k < N; k++) {
					if (i != j && j != k && k != i) {
						ans += can[i][j][k];
					}
				}
			}
		}
		return ans;
	}
}
 
int main() {
	scanf("%d %d", &N, &M);
	if (N <= 10) {
		printf("%d\n", brute_force::brute());
		return 0;
	}
	for (int i = 1; i <= M; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		adj[x].push_back(y);
		adj[y].push_back(x);
		uf.merge(x, y);
	}
 
	ll ans = 0;
	for (int i = 1; i <= N; i++) {
		if (i == uf.find(i)) {
			ans += go(i);
		}
	}
	printf("%lld\n", ans);
}

Compilation message

count_triplets.cpp:168:2: warning: #warning RESET AT THE END! [-Wcpp]
 #warning RESET AT THE END!
  ^~~~~~~
count_triplets.cpp: In function 'int brute_force::brute()':
count_triplets.cpp:184:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d", &x, &y);
    ~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:253:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp:260:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8952 KB Output is correct
2 Correct 13 ms 8952 KB Output is correct
3 Correct 12 ms 9096 KB Output is correct
4 Correct 10 ms 9172 KB Output is correct
5 Correct 10 ms 9172 KB Output is correct
6 Correct 45 ms 9504 KB Output is correct
7 Correct 45 ms 9504 KB Output is correct
8 Correct 54 ms 9504 KB Output is correct
9 Correct 59 ms 9572 KB Output is correct
10 Correct 61 ms 9572 KB Output is correct
11 Correct 46 ms 9660 KB Output is correct
12 Correct 44 ms 9660 KB Output is correct
13 Correct 56 ms 9660 KB Output is correct
14 Correct 45 ms 9660 KB Output is correct
15 Correct 44 ms 9660 KB Output is correct
16 Correct 43 ms 9660 KB Output is correct
17 Correct 43 ms 9660 KB Output is correct
18 Correct 43 ms 9660 KB Output is correct
19 Correct 45 ms 9660 KB Output is correct
20 Correct 65 ms 9660 KB Output is correct
21 Correct 53 ms 9660 KB Output is correct
22 Correct 45 ms 9660 KB Output is correct
23 Correct 20 ms 9660 KB Output is correct
24 Correct 13 ms 9660 KB Output is correct
25 Correct 19 ms 9660 KB Output is correct
26 Correct 45 ms 9676 KB Output is correct
27 Correct 13 ms 9676 KB Output is correct
28 Correct 22 ms 9676 KB Output is correct
29 Correct 51 ms 9676 KB Output is correct
30 Correct 13 ms 9676 KB Output is correct
31 Correct 20 ms 9676 KB Output is correct
32 Correct 54 ms 9888 KB Output is correct
33 Correct 19 ms 9888 KB Output is correct
34 Correct 20 ms 9888 KB Output is correct
35 Correct 45 ms 9888 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8952 KB Output is correct
2 Correct 13 ms 8952 KB Output is correct
3 Correct 12 ms 9096 KB Output is correct
4 Correct 10 ms 9172 KB Output is correct
5 Correct 10 ms 9172 KB Output is correct
6 Correct 45 ms 9504 KB Output is correct
7 Correct 45 ms 9504 KB Output is correct
8 Correct 54 ms 9504 KB Output is correct
9 Correct 59 ms 9572 KB Output is correct
10 Correct 61 ms 9572 KB Output is correct
11 Correct 46 ms 9660 KB Output is correct
12 Correct 44 ms 9660 KB Output is correct
13 Correct 56 ms 9660 KB Output is correct
14 Correct 45 ms 9660 KB Output is correct
15 Correct 44 ms 9660 KB Output is correct
16 Correct 43 ms 9660 KB Output is correct
17 Correct 43 ms 9660 KB Output is correct
18 Correct 43 ms 9660 KB Output is correct
19 Correct 45 ms 9660 KB Output is correct
20 Correct 65 ms 9660 KB Output is correct
21 Correct 53 ms 9660 KB Output is correct
22 Correct 45 ms 9660 KB Output is correct
23 Correct 20 ms 9660 KB Output is correct
24 Correct 13 ms 9660 KB Output is correct
25 Correct 19 ms 9660 KB Output is correct
26 Correct 45 ms 9676 KB Output is correct
27 Correct 13 ms 9676 KB Output is correct
28 Correct 22 ms 9676 KB Output is correct
29 Correct 51 ms 9676 KB Output is correct
30 Correct 13 ms 9676 KB Output is correct
31 Correct 20 ms 9676 KB Output is correct
32 Correct 54 ms 9888 KB Output is correct
33 Correct 19 ms 9888 KB Output is correct
34 Correct 20 ms 9888 KB Output is correct
35 Correct 45 ms 9888 KB Output is correct
36 Incorrect 13 ms 9888 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 577 ms 30092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 30092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1054 ms 30092 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 30092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 30092 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8952 KB Output is correct
2 Correct 13 ms 8952 KB Output is correct
3 Correct 12 ms 9096 KB Output is correct
4 Correct 10 ms 9172 KB Output is correct
5 Correct 10 ms 9172 KB Output is correct
6 Correct 45 ms 9504 KB Output is correct
7 Correct 45 ms 9504 KB Output is correct
8 Correct 54 ms 9504 KB Output is correct
9 Correct 59 ms 9572 KB Output is correct
10 Correct 61 ms 9572 KB Output is correct
11 Correct 46 ms 9660 KB Output is correct
12 Correct 44 ms 9660 KB Output is correct
13 Correct 56 ms 9660 KB Output is correct
14 Correct 45 ms 9660 KB Output is correct
15 Correct 44 ms 9660 KB Output is correct
16 Correct 43 ms 9660 KB Output is correct
17 Correct 43 ms 9660 KB Output is correct
18 Correct 43 ms 9660 KB Output is correct
19 Correct 45 ms 9660 KB Output is correct
20 Correct 65 ms 9660 KB Output is correct
21 Correct 53 ms 9660 KB Output is correct
22 Correct 45 ms 9660 KB Output is correct
23 Correct 20 ms 9660 KB Output is correct
24 Correct 13 ms 9660 KB Output is correct
25 Correct 19 ms 9660 KB Output is correct
26 Correct 45 ms 9676 KB Output is correct
27 Correct 13 ms 9676 KB Output is correct
28 Correct 22 ms 9676 KB Output is correct
29 Correct 51 ms 9676 KB Output is correct
30 Correct 13 ms 9676 KB Output is correct
31 Correct 20 ms 9676 KB Output is correct
32 Correct 54 ms 9888 KB Output is correct
33 Correct 19 ms 9888 KB Output is correct
34 Correct 20 ms 9888 KB Output is correct
35 Correct 45 ms 9888 KB Output is correct
36 Incorrect 13 ms 9888 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8952 KB Output is correct
2 Correct 13 ms 8952 KB Output is correct
3 Correct 12 ms 9096 KB Output is correct
4 Correct 10 ms 9172 KB Output is correct
5 Correct 10 ms 9172 KB Output is correct
6 Correct 45 ms 9504 KB Output is correct
7 Correct 45 ms 9504 KB Output is correct
8 Correct 54 ms 9504 KB Output is correct
9 Correct 59 ms 9572 KB Output is correct
10 Correct 61 ms 9572 KB Output is correct
11 Correct 46 ms 9660 KB Output is correct
12 Correct 44 ms 9660 KB Output is correct
13 Correct 56 ms 9660 KB Output is correct
14 Correct 45 ms 9660 KB Output is correct
15 Correct 44 ms 9660 KB Output is correct
16 Correct 43 ms 9660 KB Output is correct
17 Correct 43 ms 9660 KB Output is correct
18 Correct 43 ms 9660 KB Output is correct
19 Correct 45 ms 9660 KB Output is correct
20 Correct 65 ms 9660 KB Output is correct
21 Correct 53 ms 9660 KB Output is correct
22 Correct 45 ms 9660 KB Output is correct
23 Correct 20 ms 9660 KB Output is correct
24 Correct 13 ms 9660 KB Output is correct
25 Correct 19 ms 9660 KB Output is correct
26 Correct 45 ms 9676 KB Output is correct
27 Correct 13 ms 9676 KB Output is correct
28 Correct 22 ms 9676 KB Output is correct
29 Correct 51 ms 9676 KB Output is correct
30 Correct 13 ms 9676 KB Output is correct
31 Correct 20 ms 9676 KB Output is correct
32 Correct 54 ms 9888 KB Output is correct
33 Correct 19 ms 9888 KB Output is correct
34 Correct 20 ms 9888 KB Output is correct
35 Correct 45 ms 9888 KB Output is correct
36 Incorrect 13 ms 9888 KB Output isn't correct
37 Halted 0 ms 0 KB -