Submission #981536

#	Time	Username	Problem	Language	Result	Execution time	Memory
981536		vjudge1	Duathlon (APIO18_duathlon)	C++17	5 / 100	1034 ms	2264 KiB

count_triplets

#include <bits/stdc++.h>
 
#pragma optimize("Ofast")
#pragma target("avx2")
 
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=1e5+15;
const int B=300;
const int N=104;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=2e18;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;
 
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,m;
int g[20][20];
int use[20][20][20];

void solve(){
  cin>>n>>m;
  vector<int> vec;
  for(int i=1;i<=n;i++){
    vec.pb(i);
  }
  for(int i=1;i<=m;i++){
    int a,b;
    cin>>a>>b;
    g[a][b]=g[b][a]=1;
  }
  do{
    int r=0;
    for(int i=1;i<sz(vec);i++){
      if(g[vec[i]][vec[i-1]])r++;
      else break;
    }
    for(int i=0;i<=r;i++){
      for(int j=i+1;j<=r;j++){
        for(int k=j+1;k<=r;k++){
          use[vec[i]][vec[j]][vec[k]]=1;
        }
      }
    }
  }while(next_permutation(all(vec)));
  int ans=0;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      if(i==j)continue;
      for(int k=1;k<=n;k++){
        if(k==i||k==j)continue;
        ans+=use[i][j][k];
      }
    }
  }
  cout<<ans;
}
 
signed main(){
  //  freopen("help.in","r",stdin);
  //  freopen("help.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

Compilation message (stderr)

count_triplets.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
count_triplets.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

• 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