Submission #732837

#TimeUsernameProblemLanguageResultExecution timeMemory
732837vjudge1Spiderman (COCI20_spiderman)C++17
70 / 70
78 ms10436 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define pr pair #define vct vector #define ins insert #define pb push_back #define sz(x) ((int)(x.size())) const int N = 1e6 + 5; int b[N]; int c[N]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) b[a[i]]++; for (int i = 1; i < N; i++){ if (i <= k) continue; for (int j = i; j + k < N; j += i) c[j+k] += b[i]; } int cnt = 0; for (int i = 0; i < n; i++){ if (a[i] > k) cnt++; } for (int i = 0; i < n; i++){ if (k == 0){ if (a[i] == k){ cout << c[a[i]]+cnt-1 << ' '; }else{ cout << c[a[i]]-1 << ' '; } }else{ if (a[i] == k){ cout << c[a[i]]+cnt << ' '; }else{ cout << c[a[i]] << ' '; } } } cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...