제출 #570592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570592		keta_tsimakuridze	철인 이종 경기 (APIO18_duathlon)	C++14	31 / 100	185 ms	26708 KiB

count_triplets

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t, h[N], vis[N], x[N], p[N], sz[N], ans;
vector<int> V[N], adj[N], v;
void dfs0(int u,int p) {
	h[u] = h[p] + 1; v.push_back(u);
	vis[u] = 1;
	for(int i = 0; i < V[u].size(); i++) {
		if(V[u][i] == p) continue;
		if(!vis[V[u][i]]) dfs0(V[u][i], u);
		else if(h[V[u][i]] < h[u]) x[u]++, x[V[u][i]]--;
	}
}
int find(int u) {
	return (p[u] == u ? p[u] : p[u] = find(p[u]));
}
void merge(int u,int v) {
	u = find(u), v = find(v);
	p[v] = u;
	sz[u] += sz[v];
	sz[v] = 0;
}
void dfs(int u,int p) {
	vis[u] = 1;
	for(int i = 0; i < V[u].size(); i++) {
		if(V[u][i] == p) continue;
		if(!vis[V[u][i]]) dfs(V[u][i], u), x[u] += x[V[u][i]];
	}
	if(x[u]) merge(p, u);
}
void dfs2(int u, int p) {
	vis[u] = 1;
	int xx = sz[u];
	for(int i = 0; i < adj[u].size(); i++) {
		if(adj[u][i] == p) continue;
		dfs2(adj[u][i], u);
		sz[u] += sz[adj[u][i]]; 
		ans -= sz[adj[u][i]] * (sz[adj[u][i]] - 1) * xx;
		ans -= sz[adj[u][i]] * (xx - 1) * 2;
	}
	ans -= (v.size() - sz[u]) * (v.size() - sz[u] - 1) * xx;
	ans -= (v.size() - sz[u]) * (xx - 1) * 2;
}
main() {
//	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int n, m;
	cin >> n >> m;
	for(int i = 2; i <= m + 1; i++) {
		int u, v;
		cin >> u >> v;
		V[u].push_back(v);
		V[v].push_back(u);
	}
	for(int i = 1; i <= n; i++) p[i] = i, sz[i] = 1;
	ans = 0;
	for(int i = 1; i <= n; i++) {
		v.clear();
		if(vis[i]) continue; 
		dfs0(i, 0); 
		for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
		dfs(i, 0);
		for(int j = 0; j < v.size(); j++) {
			int u = v[j];
			for(int k = 0; k < V[u].size(); k++) {
				if(find(V[u][k]) <= find(u)) continue;
				adj[find(u)].push_back(find(V[u][k]));
				adj[find(V[u][k])].push_back(find(u));
			}
		}
		for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
		ans += (int)v.size() * ((int)v.size() - 1) * ((int)v.size() - 2);
		
		for(int j = 0; j < v.size();j++) { 
			if(v[j] == find(v[j]) && !vis[v[j]]) {
				dfs2(v[j], 0);
			}
		}
		for(int j = 0; j < v.size(); j++) vis[v[j]] = 1;
		
	}
	cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

count_triplets.cpp: In function 'void dfs0(long long int, long long int)':
count_triplets.cpp:14:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i = 0; i < V[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs(long long int, long long int)':
count_triplets.cpp:31:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i = 0; i < V[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~
count_triplets.cpp: In function 'void dfs2(long long int, long long int)':
count_triplets.cpp:40:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i = 0; i < adj[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~
count_triplets.cpp: At global scope:
count_triplets.cpp:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main() {
      | ^~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:66:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
      |                  ~~^~~~~~~~~~
count_triplets.cpp:68:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   for(int j = 0; j < v.size(); j++) {
      |                  ~~^~~~~~~~~~
count_triplets.cpp:70:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |    for(int k = 0; k < V[u].size(); k++) {
      |                   ~~^~~~~~~~~~~~~
count_triplets.cpp:76:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for(int j = 0; j < v.size(); j++) vis[v[j]] = 0;
      |                  ~~^~~~~~~~~~
count_triplets.cpp:79:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for(int j = 0; j < v.size();j++) {
      |                  ~~^~~~~~~~~~
count_triplets.cpp:84:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for(int j = 0; j < v.size(); j++) vis[v[j]] = 1;
      |                  ~~^~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 8 / 8
• Subtask 4: 10 / 10
• Subtask 5: 13 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10