Submission #644546

#TimeUsernameProblemLanguageResultExecution timeMemory
644546Essa2006Spiderman (COCI20_spiderman)C++14
70 / 70
799 ms26632 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define endl '\n' #define FF first #define SS second #define all(a) a.begin(),a.end() #define mod (1000000007) signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int n, k; cin>>n>>k; map<int, int>mp, inc; vector<int>A(n); for(int i=0;i<n;i++){ cin>>A[i]; mp[A[i]]++; } int cnt = 0; for(auto i = mp.begin();i!=mp.end();i++){ int num = 0; if(i->FF>k) cnt+=i->SS , num = i->FF - k; if(num){ for(int j=1;j*j<=num;j++){ if(num%j==0){ if(j>k) inc[num+k]+=mp[j]; if(j*j!=num && num/j>k) inc[num+k]+=mp[num/j]; } } } } for(int i=0;i<n;i++){ if(A[i]==k){ inc[A[i]]=cnt; } cout<<inc[A[i]]-(k==0)<<' '; } }
#Verdict Execution timeMemoryGrader output
Fetching results...