oj.uz

Submission #135496

# Submission time Handle Problem Language Result Execution time Memory
135496 2019-07-24T06:51:15 Z 임유진(#3251) A Huge Tower (CEOI10_tower) C++14
45 / 100
 645 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long lint;

const int MOD = 1e9 + 9;

int S[20];
lint dp[1 << 20][20];
int big[20];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, D;

	cin >> N >> D;
	for(int i = 0; i < N; i++) cin >> S[i];
	
	sort(S, S + N);
	big[N - 1] = N - 1;
	for(int i = N - 2; i >= 0; i--) for(big[i] = big[i + 1]; S[big[i]] > S[i] + D; big[i]--);

	for(int i = 0; i < N; i++) dp[0][i] = 1ll;
	for(int i = 1; i < (1 << N); i++) for(int j = 0; j < N; j++) {
		dp[i][j] = j == 0 ? 0 : dp[i][j - 1];
		if(i & (1 << j)) dp[i][j] = (dp[i][j] + dp[i - (1 << j)][big[j]]) % MOD;
	}

	cout << dp[(1 << N) - 1][N - 1];
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1656 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5496 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 20856 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 82432 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5496 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 20856 KB Output is correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 536 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 41444 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 645 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 11 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -