oj.uz

Submission #374735

# Submission time Handle Problem Language Result Execution time Memory
374735 2021-03-08T04:46:01 Z wzy A Huge Tower (CEOI10_tower) C++11
100 / 100
 143 ms 13036 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = (ll) 1e9 + 9;



int32_t main(){
	int n , d , j = 1;
	scanf("%d%d" , &n , &d);
	vector<int> v(n+1);
	vector<long long> dp(n+1);
	dp[0] = 1;
	for(int i = 1; i <= n; i ++){
		scanf("%d" , &v[i]);
	}
	sort(v.begin() + 1 , v.end());
	for(int i = 1; i <= n; i ++){
		while(v[i] > v[j] + d)
			j++;
		dp[i] = (dp[i-1] * ((ll) i-j+1))%mod;
	}
	printf("%lld\n" , dp[n]);
}

Compilation message

tower.cpp: In function 'int32_t main()':
tower.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |  scanf("%d%d" , &n , &d);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
tower.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |   scanf("%d" , &v[i]);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 876 KB Output is correct
2 Correct 14 ms 1388 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3308 KB Output is correct
2 Correct 56 ms 5752 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 7660 KB Output is correct
2 Correct 143 ms 13036 KB Output is correct