Submission #698814

#	Time	Username	Problem	Language	Result	Execution time	Memory
698814		vjudge1	Duathlon (APIO18_duathlon)	C++17	10 / 100	19 ms	468 KiB

count_triplets

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=1e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

int n,m,ans,tmp;
vector<int> v[1005];
bool vis[1005];
int sz[1005];

void clr() {
  for (int j=1;j<=n;j++) {
    vis[j]=false;
    sz[j]=0;
  }
  return;
}

void dfs(int i,int pp,int lvl) {
  vis[i]=true;
  sz[i]=1;
  for (int j:v[i]) {
    if (!vis[j]) {
      dfs(j,i,lvl+1); sz[i]+=sz[j];
    }
  }
  if (lvl>1) {
    //cout<<i<<' '<<sz[i]<<' '<<pp<<' '<<tmp<<endl;
    ans+=sz[i];
  }
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    cin>>n>>m;
    for (int i=0;i<m;i++) {
      int a,b; cin>>a>>b;
      v[a].push_back(b);
      v[b].push_back(a);
    }

    for (int i=1;i<=n;i++) {
      clr();
      tmp=i;
      dfs(i,-1,0);
      //cout<<i<<' '<<ans<<":  "; for (int j=1;j<=n;j++) cout<<sz[j]<<' '; cout<<endl;
    }
    cout<<ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 10 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10