oj.uz

답안 #465449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465449 2021-08-16T06:58:53 Z Khizri 캥거루 (CEOI16_kangaroo) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=200+5;
ll t=1,l,r,n,arr[mxn];
set<vector<int>>ans;
void funk(int k,int ind,int x,vector<int>vt){
	bool q=true;
	vt[ind]=k;
	if(x==-1){
		for(int i=0;i<ind;i++){
			if(vt[i]==0){
				q=false;
				funk(k+1,i,1,vt);
			}
		}
		for(int i=ind+1;i<n;i++){
			if(vt[i]==0){
				q=false;
				funk(k+1,i,0,vt);
			}
		}
	}
	else if(x==0){
		for(int i=0;i<ind;i++){
			if(vt[i]==0){
				q=false;
				funk(k+1,i,1,vt);
			}
		}
	}
	else if(x==1){
		for(int i=ind+1;i<n;i++){
			if(vt[i]==0){
				q=false;
				funk(k+1,i,0,vt);
			}
		}
	}
	if(q){
		ans.insert(vt);
	}
}
void solve(){
	cin>>n>>l>>r;
	vector<int>vt;
	for(int i=1;i<=n;i++){
		vt.pb(0);
	}
	//vt[l]=1;
	vt[r-1]=n;
	arr[0]=1;
	for(int i=1;i<=n;i++){
		arr[i]=(arr[i-1]*n)%MOD;
	}
	funk(1,l-1,-1,vt);
	cout<<ans.size()<<endl;
}
int main(){
	//freopen("kangaroo.in","r",stdin);
    //freopen("kangaroo.out","w",stdout);
	//IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct