제출 #710371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
710371		vjudge1	철인 이종 경기 (APIO18_duathlon)	C++17	5 / 100	1082 ms	468 KiB

count_triplets

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 55;
int n,m;
vector <int> adj[maxn],adj2[maxn];
int dp[maxn],dp2[maxn];
stack <int> st;
int l[maxn],t[maxn],cnt2;
int scc, id[maxn], s[maxn];
int rt[maxn];
bool dau[maxn];
vector <int> root;
int ans = 0LL;
vector <int> path;
bool res[maxn][maxn][maxn];
void dequy(int sl, int last)
{
    path.push_back(last);
//    for (int i:path) cout<<i<<' '; cout<<"!!"<<endl;
    for (int i=1; i<path.size()-1; i++)
        res[path[0]][path[i]][last]=1, res[last][path[i]][path[0]] = 1;
    for (int i:adj[last])
    {
//        cout<<last<<" -> "<<i<<endl;
        if (!dau[i])
    {

        dau[i]=1;
        dequy(sl+1,i);
        dau[i]=0;
    }
    }
    path.pop_back();
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int u,v; cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i=1; i<=n; i++)
    {
        dau[i] = 1;
        dequy(1,i);
        dau[i] = 0;
    }
    int ans=0;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            for (int z=1; z<=n; z++)
                if (i!=j&&j!=z&&i!=z)
                {
//                    if (res[i][j][z]) cout<<i<<' '<<j<<' '<<z<<" !! "<<endl;
                    ans += res[i][j][z];
                }
    cout<<ans<<'\n';
}

컴파일 시 표준 에러 (stderr) 메시지

count_triplets.cpp: In function 'void dequy(long long int, long long int)':
count_triplets.cpp:21:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for (int i=1; i<path.size()-1; i++)
      |                   ~^~~~~~~~~~~~~~

• 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