제출 #1316439

#제출 시각아이디문제언어결과실행 시간메모리
1316439ninstroyerSpiderman (COCI20_spiderman)C++20
21 / 70
2096 ms5836 KiB
#include<bits/stdc++.h> using namespace std; const int nx = 3e5+5, hx = 1e6+5; int n, k, arr[nx], actual[nx], cnt[hx]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin>>n>>k; for(int i = 1; i <= n; i++) cin>>actual[i], arr[i] = actual[i]; sort(arr+1, arr+1+n); for(int i = 1; i <= n; i++) { if(arr[i] == arr[i-1]) continue; if(arr[i]==k) cnt[arr[i]] += n-i; for(int j = 1; j < i; j++) { if(arr[i]%arr[j] == k) cnt[arr[i]]++; } } for(int i = 1; i <= n; i++) cout<<cnt[actual[i]]<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...