Submission #844308

#TimeUsernameProblemLanguageResultExecution timeMemory
844308vjudge1Spiderman (COCI20_spiderman)C++17
70 / 70
155 ms10576 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> h(N);
  map<int, int> cnt;
  for (int i = 0;i < N; ++i) {
    cin >> h[i];
    cnt[h[i]] += 1;
  }
  int MAX_H = 1e6 + 37;
  vector<int> div_cnt(MAX_H);
  for (auto [i, num] : cnt) {
    if (i <= K) {
      continue;
    }
    for (int j = 0;i * j < MAX_H; ++j) {
      div_cnt[i * j] += num;
    } 
  }
  for (int i = 0;i < N; ++i) {
    if (h[i] - K < 0) {
      cout << 0 << ' ';
      continue;
    }
    cout << (div_cnt[h[i] - K] - (K == 0)) << ' ';
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...