Submission #1174217

#TimeUsernameProblemLanguageResultExecution timeMemory
1174217hewfhlwejflSpiderman (COCI20_spiderman)C++20
56 / 70
534 ms29896 KiB
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define pll pair<long long, long long> #define ppl pair<pll, long long> #define ll long long #define se second #define fi first #define pb push_back ll T,n,nq,a[1001009],m,cmp,ind,k,b[1001009],bn,r,res,y,vis1[4000009],vis[4000009],x,ma[400009],l; string s[10009][59],t; struct st { ll sc,m,ind; }; st pen[10009]; bool prime(ll num) { if(num<=1)return 1; for(ll i=2;i*i<=num;i++) if(num%i==0)return 0; return 1; } ll f(string s1) { ll ret=0; l=1; while(s1[l]!='/') { ret+=s1[l]-'0'; ret*=10; l++; } return ret/10; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); ll fl=-9; cin>>n>>k; for(int i=1;i<=n;i++){cin>>a[i];ma[a[i]]++;} for(int i=1;i<=n;i++) { if(a[i]<k)cout<<0<<" "; else if(a[i]==k && fl<0) { fl=n; for(int j=1;j<=n;j++)if(a[j]<=k ||j==i)fl--; cout<<fl<<" "; } else if(a[i]==k)cout<<fl<<" "; else { ll rs=0; a[i]-=k; for(int j=1;j*j<=a[i];j++) { if(a[i]%j)continue; if(j>k)rs+=ma[j]; if(j*j!=a[i] && a[i]/j>k)rs+=ma[a[i]/j]; else if(j==1 && k==0)rs--; } a[i]+=k; cout<<rs<<" "; } } //for(int i=1;i<=n;i++)cout<<a[i]<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...