Submission #771796

#	Time	Username	Problem	Language	Result	Execution time	Memory
771796		CyberCow	Duathlon (APIO18_duathlon)	C++17	0 / 100	1089 ms	1048576 KiB

count_triplets

//#include <bits/stdc++.h>
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);
const int N = 300005;
vector<int> v[N];
int ans = 0;

void Dfs(int g, int x, int y, vector<int> color)
{
    color[g] = 1;
    for (auto to : v[g])
    {
        if (color[x] == 0 && to == y)
            continue;
        if (color[to] == 0)
        {
            color[to] = 1;
            Dfs(to, x, y, color);
            color[to] = 0;
        }
    }
    if (color[y] == 1)
        ans = 1;
}

void solve()
{
    int n, i, j, x, y, m;
    cin >> n >> m;
    for ( i = 0; i < m; i++)
    {
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    vector<int> color;
    for ( i = 0; i <= n; i++)
    {
        color.push_back(0);
    }
    int anss = 0;
    for ( i = 1; i <= n; i++)
    {
        for ( j = 1; j <= n; j++)
        {
            for (int h= 1; h <= n; h++)
            {
                if (j != i && h != j && i != h)
                {
                    ans = 0;
                    //cout << i << ' ' << j << ' ' << h << '\n';
                    Dfs(i, j, h, color);
                    if (ans == 1)
                        anss++;
                }
            }
        }
    }
    cout << anss;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    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