Submission #1362097

#	Time	Username	Problem	Language	Result	Execution time	Memory
1362097		Almonther	Duathlon (APIO18_duathlon)	C++20	0 / 100	1096 ms	432 KiB

count_triplets

#include<bits/stdc++.h>

using namespace std;

#define ll long long
const int maxn=55;
ll n,m,s,c,f,ans=0,fla;
bitset<maxn>vis,anss;
vector<ll>v[maxn];
void dfs(ll x){
    vis[x]=1;
    if(x==f){
        if(vis[c]==1) fla=1;
        vis[x]=0;
        return;
    }
    for(auto i:v[x]) if(!vis[i]) dfs(i);
    vis[x]=0;
}
void solve(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        ll a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(s=1;s<=n;s++){
        for(f=1;f<=n;f++){
            if(f==s) continue;
            for(c=1;c<=n;c++){
                if(c==s||c==f) continue;
                fla=0;
                dfs(s);
                ans+=fla;
                // ans+=anss.count()-2;
                // anss.reset();
            }
        }
    }
    cout<<ans;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int _=1;
    // cin>>_;
    while(_--) solve();
}

• 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