# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198227 | alrad | Spiderman (COCI20_spiderman) | C++17 | 2067 ms | 57680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int LIMIT = 1e6 + 5;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0) , cout.tie(0);
int n , k;
cin >> n >> k;
vector<int> a(n);
unordered_map<int , int> tot;
unordered_map<int , int> ans;
for (int i = 0; i < n; i++) {
cin >> a[i];
tot[a[i]]++;
}
for (auto e : tot) {
int num = e.first;
int counter = e.second;
if (num <= k) {
continue;
}
for (int j = k; j < LIMIT; j += num) {
ans[j] += counter;
}
if (k == 0) {
ans[num]--;
}
}
for (int i = 0; i < n; i++) {
cout << ans[a[i]] << " ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |