oj.uz

Submission #899701

# Submission time Handle Problem Language Result Execution time Memory
899701 2024-01-06T22:05:10 Z ivaziva A Huge Tower (CEOI10_tower) C++14
90 / 100
 1000 ms 8612 KB 
#include <bits/stdc++.h>

using namespace std;

#define MOD 1000000009
#define MAXN 10000001

long long n,d;
long long niz[MAXN];
long long val[MAXN];

int main()
{
    cin>>n>>d;
    for (long long i=1;i<=n;i++) cin>>niz[i];
    sort(niz+1,niz+n+1);
    for (long long i=1;i<=n;i++)
    {
        long long br=0;
        for (long long j=i-1;j>=1;j--)
        {
            if (niz[i]-niz[j]<=d) br++;
            else break;
        }
        val[i]=br;
    }
    long long ans=1;
    for (long long i=1;i<=n;i++)
    {
        ans*=(val[i]+1);
        if (ans>=MOD) ans%=MOD;
    }
    cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4700 KB Output is correct
2 Correct 680 ms 4704 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 6920 KB Output is correct
2 Execution timed out 1074 ms 6740 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1032 ms 8612 KB Time limit exceeded
2 Halted 0 ms 0 KB -