Submission #104348

#TimeUsernameProblemLanguageResultExecution timeMemory
104348tc_abdDuathlon (APIO18_duathlon)C++14
10 / 100
25 ms512 KiB
#include <bits/stdc++.h>
using namespace std;
int n,m,ans;
bool done[1009];
vector < int > v[1009];
void dfs(int node,int w){
    if(w != 0) ans += w-1;
    done[node] = 1;
    for(int i=0;i<v[node].size();i++){
        int u = v[node][i];
        if(!done[u]) dfs(u,w+1);
    }
}
int main(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        a--;b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(int i=0;i<n;i++){
        memset(done,0,sizeof(done));
        dfs(i,0);
    }
    cout<<ans<<endl;
}

Compilation message (stderr)

count_triplets.cpp: In function 'void dfs(int, int)':
count_triplets.cpp:9:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[node].size();i++){
                 ~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...