Submission #671168

#TimeUsernameProblemLanguageResultExecution timeMemory
671168NimbostratusSpiderman (COCI20_spiderman)C++17
70 / 70
123 ms21116 KiB
#include <bits/stdc++.h> #define endl '\n' #define int long long using namespace std; using lint = long long; const int maxn = 3e5 + 5; const int maxk = 1e6 + 5; const int inf = 1e9 + 5; const int mod = 1e9 + 7; int n, k; int a[maxn]; int freq[maxk]; int ans[maxk]; signed main() { #ifdef Local freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> a[i]; freq[a[i]]++; } for(int i = 1; i <= 1e6; i++) { if(k >= i) continue; for(int j = 0; i * j + k <= 1e6 ; j++) ans[i * j + k] += freq[i] - (i * j + k == i); } for(int i = 1; i <= n; i++) cout << ans[a[i]] << " "; }
#Verdict Execution timeMemoryGrader output
Fetching results...