oj.uz

답안 #679214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679214 2023-01-07T18:38:36 Z Vladth11 Spiderman (COCI20_spiderman) C++14
70 / 70
 98 ms 10208 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef pair <int, int> pii;
typedef long long ll;

const int NMAX = 1000001;
const int VMAX = 41;
const int INF = 1e9;
const int MOD = 1000000009;
const int BLOCK = 318;
const int base = 31;
const int nrbits = 21;

int c[NMAX];
int f[NMAX];
int v[NMAX];

int main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k, i;
    cin >> n >> k;
    for(i = 1; i <= n; i++){
        int x;
        cin >> x;
        f[x]++;
        v[i] = x;
    }
    for(i = k + 1; i < NMAX; i++){
        for(int j = k; j < NMAX; j += i){
            c[j] += f[i] - (i == j);
        }
    }
    for(i = 1; i <= n; i++){
        cout << c[v[i]] << " ";
    }
    return 0;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 6484 KB Output is correct
2 Correct 30 ms 5668 KB Output is correct
3 Correct 36 ms 7280 KB Output is correct
4 Correct 63 ms 8680 KB Output is correct
5 Correct 39 ms 8788 KB Output is correct
6 Correct 73 ms 10208 KB Output is correct
7 Correct 33 ms 8664 KB Output is correct
8 Correct 48 ms 8672 KB Output is correct
9 Correct 98 ms 10084 KB Output is correct
10 Correct 67 ms 10036 KB Output is correct