oj.uz

답안 #440623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440623 2021-07-02T14:43:10 Z Abrar_Al_Samit Spiderman (COCI20_spiderman) C++17
70 / 70
 141 ms 10212 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;

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]  - (j+k==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
    PlayGround();

    return 0;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 8140 KB Output is correct
2 Correct 60 ms 8140 KB Output is correct
3 Correct 82 ms 8800 KB Output is correct
4 Correct 127 ms 10212 KB Output is correct
5 Correct 87 ms 8736 KB Output is correct
6 Correct 141 ms 10180 KB Output is correct
7 Correct 72 ms 8660 KB Output is correct
8 Correct 79 ms 8672 KB Output is correct
9 Correct 132 ms 10072 KB Output is correct
10 Correct 128 ms 9960 KB Output is correct