oj.uz

답안 #764075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764075 2023-06-23T06:48:32 Z OrazB 철인 이종 경기 (APIO18_duathlon) C++14
0 / 100
 55 ms 58020 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 2000005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

bool vis[N];
ll sub[N];
vector<int> E[N];
vector<int> vec;

void dfs(int nd){
	vis[nd] = sub[nd] = 1;
	vec.pb(nd);
	for (auto i : E[nd]){
		if (!vis[i]){
			dfs(i);
			sub[nd] += sub[i];
		} 
	}
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	while(m--){
		int u, v;
		cin >> u >> v;
		E[u].pb(v);
		E[v].pb(u);
	}
	ll sum = 0;
	for (int i = 1; i <= n; i++){
		if (!vis[i]){
			vec.clear();
			dfs(i);
			ll x = vec.size();
			for (auto j : vec){
				sum += ((sub[j]-1)*(x-sub[j]))*2;
			}
			ll sm = 0;
			for (auto j : E[i]) sm += sub[j];
			for (auto j : E[i]){
				sum += (sm-sub[j])*sub[j];
			}
		}
	}
	cout << sum << '\n';
}

Compilation message

count_triplets.cpp: In function 'void dfs(int)':
count_triplets.cpp:28:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   28 |  vis[nd] = sub[nd] = 1;
      |            ~~~~~~~~^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 47188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 47188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 58020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 47236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 54 ms 52048 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 47316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 51956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 47188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 47188 KB Output isn't correct
2 Halted 0 ms 0 KB -