Submission #881321

#TimeUsernameProblemLanguageResultExecution timeMemory
881321ilhan_ardaSpiderman (COCI20_spiderman)C++17
0 / 70
1020 ms6888 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define fi first #define se second #define pb push_back #define endl "\n" //~ #define int long long using namespace std; typedef tuple<int, int, int> iii; typedef long long ll; const int mod =998244353; int n, k; int a[300005], mp[1000005]; int32_t main(){ fast; cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; mp[a[i]]++; } //~ sort(a+1, a+n+1); int temp=0; for(int i=1;i<=n;i++){ if(a[i]<k){ cout<<0<<" "; continue; } if(a[i]==k && !temp){ temp=n; for(int j=1;j<=n;j++){ if(a[j]<=k)temp--; } cout<<temp<<" "; //~ for(int j=1;j<=mp[k];j++)cout<<temp<<" "; continue; } else if(a[i]==k){ cout<<temp<<" "; continue; } int ans=0; for(int j=1;j*j<=a[i];j++){ if(a[i]/j*j==a[i]){ if(j>k)ans+=mp[j]; if(j*j!=a[i] && a[i]/j>k)ans+=mp[a[i]/j]; } } a[i]+=k; cout<<ans<<" "; } cout<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...