Submission #829720

#	Time	Username	Problem	Language	Result	Execution time	Memory
829720		FatihSolak	Duathlon (APIO18_duathlon)	C++17	5 / 100	1056 ms	59920 KiB

count_triplets

#include <bits/stdc++.h>
#define N 100005
using namespace std;
int ok[100][100];
void solve(){
    int n,m;
    cin >> n >> m;
    for(int i = 1;i<=m;i++){
        int u,v;
        cin >> u >> v;
        ok[u-1][v-1] = ok[v-1][u-1] = 1;
    }
    int ans = 0;
    for(int a = 0;a<n;a++){
        for(int b = 0;b<n;b++){
            for(int c = 0;c<n;c++){
                if(a == b || b == c || a == c)
                    continue;
                vector<vector<int>> cnt((1<<n),vector<int> (n,0));
                cnt[(1<<a)][a] = 1;
                bool f = 0;
                for(int mask = 0;mask < (1<<n);mask++){
                    for(int i = 0;i<n;i++){
                        if(cnt[mask][i] == 0)continue;
                        if(cnt[mask][i] == 3)
                            f = 1;
                        for(int to = 0;to<n;to++){
                            if(mask & (1<<to))
                                continue;
                            if(ok[i][to] == 0)
                                continue;
                            int num = cnt[mask][i];
                            if(num == 2 && to == c)
                                num++;
                            if(num == 1 && to == b)
                                num++;
                            cnt[mask + (1<<to)][to] = max(cnt[mask + (1<<to)][to],num);
                        }
                    }
                }
                ans += f;
            }
        }
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local    
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 5 / 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