제출 #844500

#제출 시각아이디문제언어결과실행 시간메모리
844500vjudge1Spiderman (COCI20_spiderman)C++17
56 / 70
751 ms24860 KiB
#pragma GCC optimize("unroll-loops,Ofast,O3") #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define spc << " " << #define all(x) x.begin(), x.end() #define ll long long #define int long long #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define st first #define nd second #define inf 1000000009 #define MOD 1000000007 using namespace std; void solve(){ int n,k; cin >> n >> k; int arr[n+1]; map<int, int> num; map<int, int> ans; int fork=0; for(int i=1; i<=n; i++){ cin >> arr[i]; if(arr[i]>k){ num[arr[i]]++; fork++; } } ans[k]=fork; for(auto p:num){ int div=p.st-k; for(int i=1; i*i<=div; i++){ if(i*i==div) ans[p.st]+= num[i]; else if(div%i==0){ ans[p.st]+= num[div/i] + num[i]; } } } for(int i=1; i<=n; i++) cout << ans[arr[i]] << " "; } signed main(){ ios_base::sync_with_stdio(false);cin.tie(0); #ifdef Local freopen("in.txt","r",stdin); freopen("out","w",stdout); #endif ll t=1; //cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...