oj.uz

Submission #259082

# Submission time Handle Problem Language Result Execution time Memory
259082 2020-08-07T07:06:38 Z _7_7_ Duathlon (APIO18_duathlon) C++14
23 / 100
 128 ms 12024 KB 
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 1e5 + 512;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
 
int n, m, v, u, k, cnt[N], col[N], Sz[N], par[N];
vi g[N];
ll ans;

void dfs (int v) {
	col[v] = k;
	cnt[v] = 1;

	for (auto to : g[v])
		if (!col[to]) {
			dfs(to); 
			cnt[v] += cnt[to];
			par[to] = v;
		}
}



main () {
	fastio
	cin >> n >> m;
	while (m--) {
		cin >> v >> u;
		g[v].pb(u);
		g[u].pb(v);
	}

	for (int i = 1; i <= n; ++i)
		if (!col[i]) {
			++k;
			dfs(i);
			ans += cnt[i] * 1ll * (cnt[i] - 1) * (cnt[i] - 2);
			Sz[k] = cnt[i];
		}


	for (int i = 1; i <= n; ++i) {
		for (auto j : g[i])
			if (j != par[i]) 
				ans -= cnt[j] * 1ll * (cnt[j] - 1);		

		ans -= (Sz[col[i]] - cnt[i]) * 1ll * (Sz[col[i]] - cnt[i] - 1);
	}
	
	cout << ans << endl;
}

Compilation message

count_triplets.cpp:62:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 2 ms 2816 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 2 ms 2816 KB Output is correct
7 Correct 2 ms 2816 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2816 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 2 ms 2816 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Correct 3 ms 2816 KB Output is correct
15 Correct 2 ms 2816 KB Output is correct
16 Correct 2 ms 2816 KB Output is correct
17 Correct 2 ms 2816 KB Output is correct
18 Correct 2 ms 2816 KB Output is correct
19 Correct 2 ms 2816 KB Output is correct
20 Correct 2 ms 2816 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 7420 KB Output is correct
2 Correct 67 ms 8440 KB Output is correct
3 Correct 60 ms 8312 KB Output is correct
4 Correct 58 ms 8428 KB Output is correct
5 Correct 65 ms 8440 KB Output is correct
6 Correct 83 ms 10872 KB Output is correct
7 Correct 79 ms 9936 KB Output is correct
8 Correct 93 ms 9592 KB Output is correct
9 Correct 90 ms 9080 KB Output is correct
10 Correct 128 ms 8312 KB Output is correct
11 Correct 64 ms 8440 KB Output is correct
12 Correct 59 ms 8320 KB Output is correct
13 Correct 64 ms 8380 KB Output is correct
14 Correct 51 ms 8184 KB Output is correct
15 Correct 47 ms 8056 KB Output is correct
16 Correct 34 ms 7036 KB Output is correct
17 Correct 44 ms 8688 KB Output is correct
18 Correct 41 ms 8688 KB Output is correct
19 Correct 41 ms 8684 KB Output is correct
20 Correct 39 ms 8696 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Incorrect 2 ms 2816 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 7416 KB Output is correct
2 Correct 65 ms 8312 KB Output is correct
3 Incorrect 71 ms 8568 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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