oj.uz

Submission #1032610

# Submission time Handle Problem Language Result Execution time Memory
1032610 2024-07-24T03:48:18 Z Khanhcsp2 Spiderman (COCI20_spiderman) C++14
70 / 70
 72 ms 19400 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e6+11;
int n, a[N], cnt[N], ans[N], k;
void sol()
{
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> a[i], cnt[a[i]]++;
    for(int i=k+1;i<=1e6;i++)
    {
        for(int j=k;j<=1e6;j+=i) ans[j]+=cnt[i];
        cnt[i]=0;
    }
    for(int i=1;i<=n;i++)
    {
        cout << ans[a[i]]-(k==0) << ' ';
    }
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Correct 26 ms 15928 KB Output is correct
3 Correct 42 ms 17120 KB Output is correct
4 Correct 72 ms 19400 KB Output is correct
5 Correct 37 ms 16988 KB Output is correct
6 Correct 59 ms 19116 KB Output is correct
7 Correct 36 ms 16976 KB Output is correct
8 Correct 36 ms 16900 KB Output is correct
9 Correct 60 ms 19280 KB Output is correct
10 Correct 60 ms 18996 KB Output is correct