Submission #199880

#	Time	Username	Problem	Language	Result	Execution time	Memory
199880		milagrosvilla1803	Spiderman (COCI20_spiderman)	C++11	0 / 70	93 ms	15224 KiB

spiderman

#include <bits/stdc++.h>
using namespace std;
int alturas1[300005];
int alturas2[300005];
int cubeta[1000005];
int n,k,aux=0;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>alturas1[i];
        alturas2[i]=alturas1[i];
    }
    sort(alturas2,alturas2+n);
    int maximo=alturas2[n-1];
    for(int i=0;i<n;i++){
        if(alturas2[i]==alturas2[i-1] || k>=alturas2[i]) continue;
        int mult=0, result=1;
        while(result<maximo){
            result=alturas2[i]*mult+k;
            cubeta[result]++;
            mult++;
        }
    }
    for(int i=0;i<n;i++){
        cout<<cubeta[alturas1[i]]<<" ";
    }
    return 0;
}

• Subtask 1: 0 / 70