oj.uz

답안 #844637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844637 2023-09-05T15:12:23 Z fanwen Spiderman (COCI20_spiderman) C++17
70 / 70
 46 ms 10324 KB 
#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

const int MAXN = 3e5 + 5;
const int MAXM = 1e6 + 1;

int N, K, a[MAXN], cnt[MAXM], ans[MAXM];

void you_make_it(void) {
    cin >> N >> K;
    FOR(i, 1, N) cin >> a[i], cnt[a[i]]++;
    FORE(i, K + 1, MAXM) {
    	for (int j = i; j + K < MAXM; j += i) {
    		ans[j + K] += cnt[i];
    	} 
    }
    int sum = 0;
    FOR(i, 1, K) ans[K] += cnt[i];
    ans[K] = N - ans[K];
    FOR(i, 1, N) cout << ans[a[i]] - (K == 0) << " \n"[i == N];
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Compilation message

spiderman.cpp: In function 'void you_make_it()':
spiderman.cpp:31:9: warning: unused variable 'sum' [-Wunused-variable]
   31 |     int sum = 0;
      |         ^~~

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8792 KB Output is correct
2 Correct 10 ms 8792 KB Output is correct
3 Correct 21 ms 9052 KB Output is correct
4 Correct 45 ms 10324 KB Output is correct
5 Correct 23 ms 9040 KB Output is correct
6 Correct 46 ms 10280 KB Output is correct
7 Correct 20 ms 9040 KB Output is correct
8 Correct 21 ms 9048 KB Output is correct
9 Correct 46 ms 10068 KB Output is correct
10 Correct 45 ms 10064 KB Output is correct