oj.uz

Submission #844261

# Submission time Handle Problem Language Result Execution time Memory
844261 2023-09-05T11:55:15 Z vjudge1 Spiderman (COCI20_spiderman) C++17
56 / 70
 66 ms 19376 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int MAXN = 1e6 + 5;

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    #define OPEN freopen(".in", "r", stdin); \
                 freopen(".out", "w", stdout);
#else
    #define OPEN void(23);
#endif

int sieve[MAXN];
int cnts[MAXN];

void solve()
{
    int n, k; cin >> n >> k;
    vector <int> vec(n);
    for(int &i : vec) cin >> i, cnts[i]++;

    for(int i = k +1; i < MAXN; i++)
    {
        for(int j = 0; j + k < MAXN; j += i)
            sieve[j + k] += cnts[i];
    }

    for(int &i : vec) cout << sieve[i] << " ";

    return;
}

int32_t main()
{
    OPEN;

    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1; //cin >> t;
    while(t--)
    {
        solve();
    }
}

Subtask #1
56.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16128 KB Output is correct
2 Correct 13 ms 15964 KB Output is correct
3 Correct 26 ms 17164 KB Output is correct
4 Correct 48 ms 19376 KB Output is correct
5 Incorrect 27 ms 16992 KB Output isn't correct
6 Incorrect 66 ms 19284 KB Output isn't correct
7 Correct 26 ms 17116 KB Output is correct
8 Correct 26 ms 16988 KB Output is correct
9 Correct 50 ms 19136 KB Output is correct
10 Correct 52 ms 19028 KB Output is correct