oj.uz

답안 #644824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
644824 2022-09-25T10:05:46 Z 1zaid1 Spiderman (COCI20_spiderman) C++17
21 / 70
 1101 ms 19496 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n';

const int M = 2e6+5, MOD = 1e9+7;
int fr[M], ans[M];

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, k;
    cin >> n >> k;

    vector<int> v(n);
    for (int&i:v) cin >> i;
    for (int i:v) fr[i]++;
    for (int&i:v) i -= k;

    for (int i:v) {
        if (i < 0) continue;
        for (int x = 1; x*x <= i; x++) {
            if (i%x == 0) {
                if ((i+k)%x == k) ans[i] += fr[x];
                if (x*x != i) if ((i+k)%(i/x) == k) ans[i] += fr[i/x];
            }
        }
    }

    for (int i:v) ans[0] += i > 0;

    for (int i:v) {
        if (i >= 0) cout << ans[i] << ' ';
        else cout << 0 << ' ';
    } cout << endl;

    return 0;
}
/*
a%b = k
6 3
4 3 12 6 8 2
   0 1 2 3 4 5 6 7 8 9 10 11 12
fr:1 1 0 1 0 0 0 0 0 1 0  0  0
as:0 0 0 0 0 0 0 0 0 0 0  0  0
*/

Subtask #1
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Incorrect 8 ms 3772 KB Output isn't correct
3 Incorrect 292 ms 7804 KB Output isn't correct
4 Incorrect 845 ms 10344 KB Output isn't correct
5 Incorrect 345 ms 16904 KB Output isn't correct
6 Incorrect 968 ms 19496 KB Output isn't correct
7 Correct 384 ms 16896 KB Output is correct
8 Correct 386 ms 16900 KB Output is correct
9 Incorrect 1101 ms 19236 KB Output isn't correct
10 Incorrect 1098 ms 19228 KB Output isn't correct