제출 #260976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260976		wiwiho	철인 이종 경기 (APIO18_duathlon)	C++14	0 / 100	1086 ms	14840 KiB

count_triplets

#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define printv(a, b) {bool pvs = false; \
for(auto i : a){ \
    if(pvs) b << ' '; \
    b << i; pvs = true; \
} \
b << '\n';}

using namespace std;

typedef long long ll;

const ll MAX = 2147483647;

vector<vector<int>> g;

vector<bool> tmp;
vector<bool> vst;

bool dfs(int now, int d){
    vst[now] = true;
    bool t = false;
    for(int i : g[now]){
        if(vst[i]) continue;
        if(dfs(i, d)){
            tmp[now] = true;
            t = true;
        }
    }
    vst[now] = false;
    return t || now == d;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    g.resize(n + 1);
    vst.resize(n + 1);

    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        g[u].eb(v);
        g[v].eb(u);
    }
    tmp.resize(n + 1);

    ll ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i == j) continue;
            fill(tmp.begin(), tmp.end(), false);
            dfs(i, j);
            for(int k = 1; k <= n; k++){
                if(k != i && k != j) ans += tmp[k];
            }
        }
    }
    cout << ans << "\n";

    return 0;
}

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