oj.uz

Submission #592432

# Submission time Handle Problem Language Result Execution time Memory
592432 2022-07-09T07:50:29 Z web A Huge Tower (CEOI10_tower) C++17
90 / 100
 1000 ms 34196 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

constexpr long long mod = 1000000009;
long long numWaysTower(vector<long>& blocks, int index,const long D)
{
    if(index == blocks.size())
        return 1;
    else
    {
        long long numWaysPrev = numWaysTower(blocks, index+1,D);
        long long validPositions =1;
        for(int i = index+1; i < blocks.size(); ++i)
        {
            if(blocks[index] <= blocks[i] + D)
                validPositions++;
            else
                break;
        }
        return ((validPositions)*(numWaysPrev))%mod;
    }
}

int main()
{
    long N,D;cin>>N>>D;
    vector<long> blocks(N);
    for(int i =0; i<N; ++i)
        cin>>blocks[i];
    sort(blocks.rbegin(), blocks.rend());
    cout<<numWaysTower(blocks, 0, D)<<endl;
    return 0;
}

Compilation message

tower.cpp: In function 'long long int numWaysTower(std::vector<long int>&, int, long int)':
tower.cpp:10:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     if(index == blocks.size())
      |        ~~~~~~^~~~~~~~~~~~~~~~
tower.cpp:16:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(int i = index+1; i < blocks.size(); ++i)
      |                              ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 212 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 0 ms 212 KB Output is correct

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3024 KB Output is correct
2 Correct 867 ms 3020 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 13980 KB Output is correct
2 Execution timed out 1089 ms 13896 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 1084 ms 34196 KB Time limit exceeded
2 Halted 0 ms 0 KB -