Submission #531261

#	Time	Username	Problem	Language	Result	Execution time	Memory
531261		hohohaha	A Huge Tower (CEOI10_tower)	C++14	45 / 100	330 ms	82372 KiB

tower

#include<bits/stdc++.h>
using namespace std;
#define fori(i, a, b) for(int i = (int) (a); i <= (int) (b); i++) 
#define ford(i, a, b) for(int i = (int) (a); i >= (int) (b); i--) 
#define ii pair<int, int> 
#define fi first
#define se second
#define vi vector<int> 
#define eb emplace_back
#define sp ' '
#define int long long
const int maxn = 3e6 + 5, mod = 1e9 + 9; 
int n, d; 
int arr[maxn]; 
int dp[1 << 20][20]; 
signed main() { 
//	freopen("tower.inp", "r", stdin); 
//	freopen("tower.out", "w", stdout); 
	ios_base::sync_with_stdio(0); 
	cin.tie(0); 
	cout.tie(0); 
	cin >> n >> d; 
	fori(i, 0, n - 1) cin >> arr[i]; 
	fori(i, 0, n - 1) dp[1 << i][i] = 1; 
	fori(mask, 1, (1 << n) - 1) { 
		fori(last, 0, n - 1) { 
			if(mask >> last & 1) { 
				fori(nxt, 0, n - 1) { 
					if(!(mask >> nxt & 1)) { 
						if(arr[nxt] <= arr[last] + d) { 
							dp[mask ^ (1 << nxt)][nxt] += dp[mask][last]; 
							if(dp[mask ^ (1 << nxt)][nxt] >= mod) dp[mask ^ (1 << nxt)][nxt] -= mod; 
						}
					}
				}
			}
		}
	}
	int ans = 0; 
	fori(last, 0, n - 1) (ans += dp[(1 << n) - 1][last]) %= mod; 
	cout << ans; 
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 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