oj.uz

답안 #440620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440620 2021-07-02T14:40:54 Z Abrar_Al_Samit Spiderman (COCI20_spiderman) C++17
56 / 70
 1886 ms 124936 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define debug(x) cerr << '[' << (#x) << "] = " << x << '\n';

template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;

const int maxn = 1e6 + 6;
vector<int>divisor[maxn];
void sieve() {  
    for(int i=1; i<maxn; ++i) {
        for(int j=i; j<maxn; j+=i)  
            divisor[j].push_back(i); 
    }
}

void PlayGround() {
    int n; cin >> n;
    int k; cin >> k;
    vector<int>freq(maxn), ans(maxn);
    vector<int>h(n);
    int big = 0;
    for(int i=0; i<n; ++i) {
        cin >> h[i];
        freq[h[i]]++;
        big += h[i]>k;
    }
    for(int i=k+1; i<maxn; ++i) {
        for(int j=i; j+k<maxn; j+=i) {
            ans[j+k] += freq[i];
        }
    }

    // int seen = 0;
    // for(int i=1; i<maxn; ++i) {
    //     seen += freq[i];
    //     if(freq[i]==0) continue;
    //     if(i==k) {
    //         ans[i] += n - seen;
    //     } else if(i > k) {
    //         int x = i - k;
    //         for(auto d : divisor[x]) 
    //             if(i % d == k) ans[i] += freq[d];
    //         if(x==i) --ans[i];
    //     }
    // }
    for(int i=0; i<n; ++i) {
        cout << ans[h[i]] + (h[i]==k ? big : 0) << ' ';
    }
    cout << '\n';

    #ifndef ONLINE_JUDGE
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
} 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    // #endif
    sieve();
    PlayGround();

    return 0;
}

Subtask #1
56.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1709 ms 122772 KB Output is correct
2 Correct 1776 ms 122660 KB Output is correct
3 Correct 1864 ms 123512 KB Output is correct
4 Correct 1872 ms 124936 KB Output is correct
5 Incorrect 1869 ms 123356 KB Output isn't correct
6 Incorrect 1872 ms 124700 KB Output isn't correct
7 Correct 1782 ms 123228 KB Output is correct
8 Correct 1872 ms 123332 KB Output is correct
9 Correct 1886 ms 124644 KB Output is correct
10 Correct 1859 ms 124676 KB Output is correct