oj.uz

답안 #931624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931624 2024-02-22T07:14:23 Z Whisper Spiderman (COCI20_spiderman) C++17
70 / 70
 51 ms 20700 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e6 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, K;
int h[MAX];
int cnt[MAX], sum[MAX];
void Whisper(){
    cin >> nArr >> K;
    for (int i = 1; i <= nArr; ++i) cin >> h[i];
    FOR(i, 1, nArr) if(h[i] > K){
        cnt[h[i]]++;
    }
    for (int i = MAX - 1; i >= 1; --i){
        for (int j = 0; j < MAX; j += i){
            sum[j] += cnt[i];
        }
    }
    for (int i = 1; i <= nArr; ++i){
        if (h[i] < K) cout << 0;
        else cout << sum[h[i] - K] - (K == 0);
        cout << " ";
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 17056 KB Output is correct
2 Correct 15 ms 16984 KB Output is correct
3 Correct 26 ms 17240 KB Output is correct
4 Correct 49 ms 20304 KB Output is correct
5 Correct 26 ms 17232 KB Output is correct
6 Correct 51 ms 20700 KB Output is correct
7 Correct 26 ms 17244 KB Output is correct
8 Correct 25 ms 17060 KB Output is correct
9 Correct 51 ms 20056 KB Output is correct
10 Correct 51 ms 20052 KB Output is correct