제출 #252716

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

count_triplets

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567];
vl vec;
void dfs(ll x, ll y){
    d[x] = 1;
    used[x] = 1;
    for(auto u : v[x]){
        if(u == y) continue;
        if(used[u]){
            c[u] = 1;
            continue;
        }
        dfs(u , x);
        d[x] += d[u];
    }
}
void solve(ll x , ll y, ll sum){
    ans += 2 * (d[x] - 1) * (sum - d[x]); 
    ll res = 0;
    for(auto u : v[x]){
        if(u == y) continue;
        ans += 2 * d[u] * res;
        res += d[u];
    }
    for(auto u : v[x]){
        if(u == y) continue;
        solve(u , x, sum);
    }
}
int main(){
    cin>>n>>m;
    for(ll i = 1; i <= m; i++){
        cin>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
    }
    for(ll i = 1; i <= n; i++){
        if(d[i] == 0) dfs(i , -1), vec.pb(i);
    }
    for(auto i : vec){
        if(c[i]==0) solve(i , -1 , d[i]);
        else ans += d[i] * (d[i] - 1) * (d[i] - 2);
    }
    cout<<ans;
}

• 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