oj.uz

Submission #464702

# Submission time Handle Problem Language Result Execution time Memory
464702 2021-08-13T18:07:52 Z jackkkk A Huge Tower (CEOI10_tower) C++11
30 / 100
 1000 ms 11172 KB 
/* 
Problem title: A Huge Tower
Problem link: https://oj.uz/problem/view/CEOI10_tower
*/

#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <array>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <float.h>
#include <climits>
#include <cmath>

using namespace std;
#define _USE_MATH_DEFINES
#define F first
#define S second
#define MP make_pair

typedef long long LL;
typedef pair<long long, long long> pii;
typedef pair<LL, LL> pll;

void quit(){
    cout.flush();
    exit(0);
}
LL NM=10e9+9;
LL n, d;
vector <LL> nums;
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  cin >> n >> d;
  nums.resize(n);
  for(LL i = 0; i < n; i++){
    cin >> nums[i];
  }
  sort(nums.begin(), nums.end());
  LL ans = 1;
  for(int i = 0; i < n; i++){
    int p=0;
    for(int j = 0; j <= i; j++){
      if(nums[i]-nums[j]<=d){
        p++;
      }
    }
    ans*=p;
    ans %=NM;

  }

  /*
  long long r = 1;
  long long ans = 1;

  for(long long l = 0; l < n; l++){
    while(r<n && nums[r]-nums[l]<=d){
      ans *= r-l+1;
      ans %= NM;
      r++;
    }
  }
  */
  cout << ans << "\n";
  
	quit();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 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 0 ms 204 KB Output isn't correct

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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