Kortit II

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD=1000000007;

ll n,a,b,ans;
vector<ll>t;
ll cnt;

void dfsans(ll u,vector<ll>v,vector<ll>c){
	if(u==n){
		ll sca=0,scb=0;
		for(ll i=0;i<n;i++){
			if(c[i]>v[i])sca++;
			else if(v[i]>c[i])scb++;
		}
		if(sca==a&&scb==b){
			ans++;
			ans%=MOD;
//			Sleep(500);
		}
		return;
	}
	for(ll i=1;i<=n;i++){
		vector<ll>::iterator it=find(v.begin(),v.end(),i);
		if(it==v.end()){
			v.push_back(i);
			dfsans(u+1,v,c);
			v.pop_back();
		}
	}
}

void dfs(ll u,vector<ll>v){
	if(u==n){
		dfsans(0,t,v);
	}
	for(ll i=1;i<=n;i++){
		vector<ll>::iterator it=find(v.begin(),v.end(),i);
		if(it==v.end()){
			v.push_back(i);
			dfs(u+1,v);
			v.pop_back();
		}
	}
}

int main(){
	ll Q;cin>>Q;
	while(Q--){
		cin>>n>>a>>b;
		dfs(0,t);
		cout<<ans<<endl;
		ans=0;
	}
	
//	cout<<a00<<" "<<a11<<" "<<a12<<" "<<a13<<" "<<a21<<" "<<a22<<" "<<a31<<endl;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED