oj.uz

답안 #849737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849737 2023-09-15T08:51:34 Z efedmrlr Spiderman (COCI20_spiderman) C++17
70 / 70
 642 ms 15696 KB 
#include <bits/stdc++.h>
#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)



using namespace std;

const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e6+5;
int n,m,q,k;
vector<int> cnt,h;
vector<int> ans;
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

}

void solve() {
    cin>>n>>k;
    h.resize(n);
    ans.resize(n);
    cnt.resize(N,0);
    for(int i = 0; i<n; i++) {
        cin>>h[i];
    }
    for(int i = 0; i<n; i++) {
        if(h[i] <= k) continue;
        int ind = h[i];
        while(ind < N) {
            cnt[ind]++;
            ind+=h[i];
        }
    }
    for(int i = 0; i<n; i++) {
        if(h[i] - k < 0) {
            ans[i] = 0;
            continue;
        } 
        if(h[i] == k) {
            ans[i] = -1;   
            continue;
        }
        ans[i] = cnt[h[i] - k];
    }
    sort(h.begin(),h.end());
    int ind = 0;
    while(ind < n && h[ind] <= k) ind++;
    int x = n - ind;
    for(int i = 0; i<n; i++) {
        if(k==0) ans[i]--;
        if(ans[i] == -1) ans[i] = x;
        cout<<ans[i]<<" ";
    }
}
 
signed main() {
    
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8280 KB Output is correct
2 Correct 9 ms 8280 KB Output is correct
3 Correct 329 ms 10832 KB Output is correct
4 Correct 642 ms 15696 KB Output is correct
5 Correct 32 ms 10832 KB Output is correct
6 Correct 94 ms 15696 KB Output is correct
7 Correct 26 ms 10576 KB Output is correct
8 Correct 28 ms 10576 KB Output is correct
9 Correct 96 ms 15444 KB Output is correct
10 Correct 86 ms 15440 KB Output is correct