oj.uz

Submission #899714

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

using namespace std;

#define MOD 1000000009
#define MAXN 1000010

long long n,d;
long long niz[MAXN];
long long val[MAXN];
vector<long long> levo,desno;

void mergee(long long l,long long mid,long long r)
{
    for (long long i=l;i<=mid;i++) levo.push_back(niz[i]);
    for (long long i=mid+1;i<=r;i++) desno.push_back(niz[i]);
    long long poz1=0,poz2=0;
    long long poz=l;
    while (poz1<levo.size() and poz2<desno.size())
    {
        if (levo[poz1]<desno[poz2])
        {
            niz[poz]=levo[poz1];
            poz1++;poz++;
        }
        else
        {
            niz[poz]=desno[poz2];
            poz2++;poz++;
        }
    }
    while (poz1<levo.size())
    {
        niz[poz]=levo[poz1];
        poz1++;poz++;
    }
    while (poz2<desno.size())
    {
        niz[poz]=desno[poz2];
        poz2++;poz++;
    }
    levo.clear();desno.clear();
}

void mergesort(long long l,long long r)
{
    if (l>=r) return;
    long long mid=(l+r)/2;
    mergesort(l,mid);
    mergesort(mid+1,r);
    mergee(l,mid,r);
}

int main()
{
    ios_base::sync_with_stdio(false);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>d;
    for (long long i=1;i<=n;i++) cin>>niz[i];
    mergesort(1,n);
    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;
}

Compilation message

tower.cpp: In function 'void mergee(long long int, long long int, long long int)':
tower.cpp:19:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     while (poz1<levo.size() and poz2<desno.size())
      |            ~~~~^~~~~~~~~~~~
tower.cpp:19:37: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     while (poz1<levo.size() and poz2<desno.size())
      |                                 ~~~~^~~~~~~~~~~~~
tower.cpp:32:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     while (poz1<levo.size())
      |            ~~~~^~~~~~~~~~~~
tower.cpp:37:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     while (poz2<desno.size())
      |            ~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5332 KB Output is correct
2 Correct 991 ms 5208 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 8888 KB Output is correct
2 Execution timed out 1072 ms 8932 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 1029 ms 17696 KB Time limit exceeded
2 Halted 0 ms 0 KB -