oj.uz

Submission #874451

# Submission time Handle Problem Language Result Execution time Memory
874451 2023-11-17T04:35:23 Z marvinthang Duathlon (APIO18_duathlon) C++17
0 / 100
 118 ms 39364 KB 
/*************************************
*    author: marvinthang             *
*    created: 17.11.2023 11:19:17    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n, m; cin >> n >> m;
	vector <vector <int>> adj(n), child(n), tree_adj(n + n);
	vector <pair <int, int>> edges;
	REP(i, m) {
		int u, v; cin >> u >> v; --u; --v;
		adj[u].push_back(i);
		adj[v].push_back(i);
		edges.emplace_back(u, v);
	}
	vector <int> low(n), num(n);
	vector <bool> used(m);
	int nv = 0;
	function <void(int)> dfs = [&] (int u) {
		static int tt = 0;
		num[u] = ++tt;
		low[u] = n + 1;
		++nv;
		for (int id: adj[u]) if (!used[id]) {
			used[id] = true;
			int v = edges[id].fi ^ edges[id].se ^ u;
			if (!num[v]) {
				dfs(v);
				low[u] = min(low[u], low[v]);
				child[u].push_back(v);
			} else low[u] = min(low[u], num[v]);
		}
	};
	int bc_idx = n;
	function <void(int, int)> build_tree = [&] (int u, int cur_bc) {
		if (cur_bc >= 0) {
			tree_adj[u].push_back(cur_bc);
			tree_adj[cur_bc].push_back(u);
		}
		for (int v: child[u]) {
			if (low[v] >= num[u]) {
				tree_adj[u].push_back(bc_idx);
				tree_adj[bc_idx].push_back(u);
				build_tree(v, bc_idx++);
			} else build_tree(v, cur_bc);
		}
	};

	vector <int> sz(n + n);
	vector <long long> sum_pair(n + n);
	function <void(int, int)> count_pair = [&] (int u, int par) {
		sz[u] = u < n;
		for (int v: tree_adj[u]) if (v != par) {
			count_pair(v, u);
			sz[u] += sz[v];
		}
		if (u < n) return;
		for (int v: tree_adj[u]) {
			int t = v == par ? nv - sz[u] : sz[v];
			sum_pair[u] += 1LL * t * (t - 1);
		}
	};

	long long res = 0;
	function <void(int, int)> solve = [&] (int u, int par) {
		if (u < n) {
			res += 1LL * (nv - 1) * (nv - 2);
			for (int v: tree_adj[u]) {
				int t = v == par ? sz[u] : n - sz[v];
				res -= sum_pair[v] - 1LL * t * (t - 1);
			}
		}
		for (int v: tree_adj[u]) if (v != par) solve(v, u);
	};

	REP(i, n) if (!num[i]) {
		nv = 0;
		dfs(i);
		build_tree(i, -1);
		count_pair(i, -1);
		solve(i, -1);
	}
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("duathlon");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:127:2: note: in expansion of macro 'file'
  127 |  file("duathlon");
      |  ^~~~
count_triplets.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:127:2: note: in expansion of macro 'file'
  127 |  file("duathlon");
      |  ^~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 33988 KB Output is correct
2 Correct 76 ms 34012 KB Output is correct
3 Incorrect 91 ms 35164 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Incorrect 1 ms 604 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26268 KB Output is correct
2 Correct 73 ms 26128 KB Output is correct
3 Correct 87 ms 26056 KB Output is correct
4 Correct 90 ms 26304 KB Output is correct
5 Correct 71 ms 26056 KB Output is correct
6 Correct 88 ms 39364 KB Output is correct
7 Correct 118 ms 34500 KB Output is correct
8 Correct 82 ms 32576 KB Output is correct
9 Correct 79 ms 30472 KB Output is correct
10 Incorrect 79 ms 26088 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Incorrect 1 ms 604 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 26136 KB Output is correct
2 Correct 73 ms 26308 KB Output is correct
3 Correct 73 ms 26276 KB Output is correct
4 Correct 82 ms 25932 KB Output is correct
5 Correct 68 ms 25544 KB Output is correct
6 Correct 74 ms 25396 KB Output is correct
7 Correct 75 ms 25284 KB Output is correct
8 Correct 83 ms 25044 KB Output is correct
9 Correct 66 ms 25036 KB Output is correct
10 Correct 62 ms 25052 KB Output is correct
11 Correct 77 ms 25024 KB Output is correct
12 Correct 63 ms 25032 KB Output is correct
13 Correct 57 ms 25288 KB Output is correct
14 Correct 64 ms 27332 KB Output is correct
15 Correct 109 ms 34944 KB Output is correct
16 Correct 85 ms 32084 KB Output is correct
17 Correct 93 ms 33348 KB Output is correct
18 Correct 90 ms 30812 KB Output is correct
19 Incorrect 82 ms 25892 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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