제출 #922354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922354		Shayan86	Spiderman (COCI20_spiderman)	C++14	70 / 70	63 ms	21788 KiB

spiderman

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 1e6 + 50;
const ll Mod = 1e9 + 7;

ll n, k, arr[N], cnt[N], sum[N];

int main(){
    fast_io;

    cin >> n >> k;

    for(int i = 1; i <= n; i++){
        cin >> arr[i]; 
        if(arr[i] > k) cnt[arr[i]]++;
    }

    for(int i = N-1; i > 0; i--){
        for(int j = 0; j < N; j += i) sum[j] += cnt[i];
    }

    for(int i = 1; i <= n; i++){
        if(arr[i] < k) cout << 0;
        else if(k) cout << sum[arr[i] - k];
        else cout << sum[arr[i] - k] - 1;
        cout << sep;
    }

}

• Subtask 1: 70 / 70