oj.uz

답안 #442852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442852 2021-07-09T09:13:28 Z mashrur_hossain Spiderman (COCI20_spiderman) C++17
70 / 70
 226 ms 12448 KB 
#include <bits/stdc++.h>
 
#define fast_cin         ios_base::sync_with_stdio(0); cin.tie(NULL); cerr.tie(NULL);
#define endl "\n"
#define dbg(x) cerr << #x << ": " << x << endl;
#define DBG    cerr << __LINE__ << ": I GOT STUCK\n";
 
using namespace std;    
typedef long long ll;
typedef long double db;
 
// 5 0
// 4 4 4 4 4
// 2 1
// 5 5
 
const int mxn = 3e5 + 10;
const int mxh = 1e6 + 10;
map<int, int>freq;
int h[mxn], ans[mxh];
void solve(){
    int n,k;cin >> n >> k;
    for(int i = 0;i<n;i++){
        cin >> h[i];
        freq[h[i]]++;
    }
    for(auto p: freq){
        if(p.first <= k)continue;
        // 0 <= x <= k, so to get k , the h[i] needs to be atleast k
        for(int j = k; j < mxh;j += p.first){
            ans[j] += p.second;
        }
        // so that it cant jump from itself to itself
        if(k == 0)ans[p.first]--;
    }
    for(int i = 0;i<n;i++){
        cout << ans[h[i]] << " \n"[i == n-1]; 
    }
    
}
 
int main() {
    fast_cin;
    int test;test = 1;
    // int test;cin >>test;
    while(test--){
        solve();
    }
    return 0;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4300 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 38 ms 5576 KB Output is correct
4 Correct 87 ms 8200 KB Output is correct
5 Correct 94 ms 10108 KB Output is correct
6 Correct 222 ms 12448 KB Output is correct
7 Correct 84 ms 10096 KB Output is correct
8 Correct 93 ms 10124 KB Output is correct
9 Correct 226 ms 12228 KB Output is correct
10 Correct 173 ms 12340 KB Output is correct