Submission #708935

#	Time	Username	Problem	Language	Result	Execution time	Memory
708935		Stickfish	Duathlon (APIO18_duathlon)	C++17	5 / 100	2 ms	468 KiB

count_triplets

#include <iostream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
using ll = long long;

const int MAXN = 10;
vector<int> edg[MAXN];
bitset<1 << MAXN> dp[MAXN][MAXN];

signed main() {
    int n, m; 
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        edg[u].push_back(v);
        edg[v].push_back(u);
    }
    for (int i = 0; i < n; ++i)
        dp[i][i][1 << i] = 1;
    for (int msk = 1; msk < (1 << n); ++msk) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (!dp[i][j][msk])
                    continue;
                for (auto u : edg[j]) {
                    if ((msk & (1 << u)) == 0)
                        dp[i][u][msk + (1 << u)] = 1;
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (i == j)
                continue;
            int c = (1 << i) + (1 << j);
            for (int msk = 0; msk < (1 << n); ++msk) {
                if (!dp[i][j][msk])
                    continue;
                c |= msk;
            }
            ans += __builtin_popcount(c) - 2;
        }
    }
    cout << ans << '\n';
}

• 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