Submission #203727

#	Time	Username	Problem	Language	Result	Execution time	Memory
203727		Segtree	Duathlon (APIO18_duathlon)	C++14	0 / 100	5 ms	380 KiB

count_triplets

#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)

int main(){
	ll n,m; cin>>n>>m;
	if(m==n-1)cout<<n*(n-1)*(n-2)/3<<endl;
	if(m==n)cout<<n*(n-1)*(n-2)<<endl;
}

• Subtask 1: 0 / 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