oj.uz

Submission #424626

# Submission time Handle Problem Language Result Execution time Memory
424626 2021-06-12T08:18:56 Z aris12345678 A Huge Tower (CEOI10_tower) C++14
30 / 100
 142 ms 8744 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1000005;
const int mod = 1e9+9;
int blocks[mxN];

int main() {
    int n, d;
    scanf("%d %d", &n, &d);
    for(int i = 0; i < n; i++)
        scanf("%d", &blocks[i]);
    sort(blocks, blocks+n);
    int i = 0, j = 0, ans = 1;
    while(i < n) {
        while(j < n-1 && blocks[j+1]-d <= blocks[i])
            j++;
        ans = (ans*(j-i+1))%mod;
        i++;
    }
    printf("%d\n", ans);
    return 0;
}

Compilation message

tower.cpp: In function 'int main()':
tower.cpp:10:10: 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:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%d", &blocks[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 972 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 3608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 142 ms 8744 KB Output isn't correct
2 Halted 0 ms 0 KB -