Submission #671609

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
671609	2022-12-13T09:50:22 Z	vjudge1	A Huge Tower (CEOI10_tower)	C++11	100 / 100	137 ms	11192 KB

tower

#include<iostream>
#include<algorithm>
using namespace std;
const long long maxn = 1000005;
const long long modv = (long long) 1e9+9;
long long n,d,ans = 1,arr[maxn];
int main () {
    scanf("%lld%lld",&n,&d);
    for(long long i = 0; i < n; i++) {
        scanf("%lld",&arr[i]);
    }
    sort(arr,arr+n);
    for(long long i = 0; i < n; i++) {
        long long prevP = lower_bound(arr,arr+n,arr[i]-d)-arr;
        ans = (ans*(i-prevP+1)%modv);
    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

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

Subtask #1

5.0 / 5.0

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

Subtask #2

5.0 / 5.0

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

Subtask #3

5.0 / 5.0

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

Subtask #4

5.0 / 5.0

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

Subtask #5

5.0 / 5.0

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

Subtask #6

5.0 / 5.0

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

Subtask #7

5.0 / 5.0

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

Subtask #8

5.0 / 5.0

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

Subtask #9

5.0 / 5.0

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

Subtask #10

5.0 / 5.0

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

Subtask #11

5.0 / 5.0

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

Subtask #12

5.0 / 5.0

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

Subtask #13

5.0 / 5.0

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

Subtask #14

5.0 / 5.0

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

Subtask #15

5.0 / 5.0

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

Subtask #16

5.0 / 5.0

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

Subtask #17

5.0 / 5.0

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

Subtask #18

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	1108 KB	Output is correct
2	Correct	10 ms	1108 KB	Output is correct

Subtask #19

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	57 ms	4584 KB	Output is correct
2	Correct	49 ms	4692 KB	Output is correct

Subtask #20

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	129 ms	11192 KB	Output is correct
2	Correct	137 ms	10532 KB	Output is correct