제출 #217797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217797		Vimmer	철인 이종 경기 (APIO18_duathlon)	C++14	5 / 100	1064 ms	640 KiB

count_triplets

#include <bits/stdc++.h>

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 300005
#define M ll(998244353)

using namespace std;

typedef long double ld;
typedef long long ll;
typedef short int si;


vector <int> g[51];

bool mk[51], mkr[51];

int ans, i, j, kol, n;

bool dostig(int v, int to)
{
    if (mk[v] || kol == n - 2) return 0;

    if (v == to || mkr[v]) return 1;

    mk[v] = 1;

    bool f = 0;

    for (auto it : g[v]) f |= dostig(it, to);

    mk[v] = 0;

    if (f && v != i && !mkr[v]) {mkr[v] = 1; kol++; ans++;}

    return f;
}
int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int  m;

    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);

        g[y].pb(x);
    }

    ans = 0;

    for (i = 1; i <= n; i++)
      for (j = 1; j <= n; j++)
        if (i != j){for (int u = 0; u < 51; u++) mkr[u] = 0; kol = 0; dostig(i, j);}

    cout << ans << endl;
}

• 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