제출 #1118759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1118759		Minbaev	A Huge Tower (CEOI10_tower)	C++17	20 / 100	1075 ms	208824 KiB

tower

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb 		push_back
#define all(x) 	x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f 		first
#define s 		second
#define int 	long long
#define ll 		long long
#define pii 	pair<int,int>
#define ar 		array
#define mps		make_pair
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
template<class T> using ste = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;
 
const int inf = 3e18 + 7;
const int mod = 1e9 + 9;
const int N = 2e5 + 5;
const int md = 998244353;
 
int binpow(int a, int b, int m){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2,m);
		return (c*c)%m;
	}
	return (binpow(a,b-1,m)*a)%m;
}
 
int divi(int a, int b, int m){
	return (a*(binpow(b,m-2, m)))%m;
}
 
int n,m,k,q;
int res;
ste<int>st;
vector<int>v(N);
 
void dfs(int x, int pos){
	if(pos == n){
		res += 1;
		return;
	}
	
	ste<int>s;
	for(auto to:st)s.insert(to);
	
//	cout << x << " " << pos << "\n";
//	for(auto to:st)cout << to << " ";
//	cout << "\n\n";
	
	for(auto to:s){
		if(to - x <= k){
			st.erase(st.find_by_order(st.order_of_key(to)));
			dfs(to, pos+1);
			st.insert(to);
		}
		else break;
	}
	
}

void solve(){
 
	cin >> n >> k;
	for(int i = 0;i<n;i++){
		cin >> v[i];
	}
	
	if(n <= 20 && false){
		int dp[(1<<n)][n]{};
		for(int i = 0;i<n;i++){
			dp[(1<<i)][i] = 1;
		}
		
		for(int mask = 1;mask<(1<<n);mask++){
			for(int i = 0;i<n;i++){
				if(mask >> i & 1 && dp[mask][i] > 0){	
					for(int j = 0;j<n;j++){
						if(!(mask >> j & 1)){
							if(v[j]-v[i] <= k){
								dp[mask+(1<<j)][j] += dp[mask][i];
								dp[mask+(1<<j)][j] %= mod;
							}
						}
					}
				}
			}
		}
		
		int res = 0;
		for(int i = 0;i<n;i++){
			res += dp[(1<<n)-1][i];
			res %= mod;
		}
		
		cout << res << "\n";
		return;
	}

	for(int i = 0;i<n;i++){
		st.insert(v[i]);
	}
 
	for(int i = 0;i<n;i++){
		st.erase(st.find_by_order(st.order_of_key(v[i])));
		dfs(v[i], 1);
		st.insert(v[i]);
	}
 
	cout << res << "\n";
}
/*
 
*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5