Submission #1185464

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185464		Moonn	Spiderman (COCI20_spiderman)	C++20	56 / 70	1080 ms	19244 KiB

spiderman

#pragma GCC optimize("O3")//
#include<bits/stdc++.h>//
#define ll long long
#define endl "\n"
#define AI ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const ll sz=3e5+23;//
bool comp(pair<string,ll>&a,pair<string,ll>&b)
{
    if(a.second==b.second)
    return a.first<b.first;
    return a.second>b.second;
}
void solve()
{
    ll n,k,i,j,say=0;
    cin>>n>>k;
    ll a[n];
    map<ll,ll>mp;
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        mp[a[i]]++;
        if(a[i]>k)
        say++;
    }
    for(i=0;i<n;i++)
    {
        if(a[i]==k)
        {
            cout<<say<<' ';
            continue;
        }
        if(k>a[i])
        {
            cout<<0<<' ';
            continue;
        }
        a[i]-=k;
        ll co=0;
        for(j=2;j<=sqrt(a[i]);j++)
        {
            if(a[i]%j==0)
            {
                if(j>k)
                co+=mp[j];
                if(a[i]/j!=j and a[i]/j>k)
                co+=mp[a[i]/j];
            }
        }
        if(a[i]>k)
        co+=mp[a[i]];
        if(k==0)
        co--;
        cout<<co<<' ';
    }
}
int main()
{
    AI
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ll t=1;
  //  cin>>t;
    while(t--)
    solve();
}

• Subtask 1: 56 / 70