oj.uz

답안 #844350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844350 2023-09-05T12:31:24 Z vjudge1 Spiderman (COCI20_spiderman) C++14
63 / 70
 1108 ms 16184 KB 
// Aber der schlimmste Fiend, dem du begegnen kannst, wirst du immer dir selber sein
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define int long long int
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define rev reverse
#define all(x) x.begin(),x.end()
#define acc accumulate
#define sz size()
#define MOD 1000000007
#define rall(x) x.rbegin(),x.rend()
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const int N = 1e6 + 5;
int cnt[N];
inline void solve(){
    int n, k;
    cin >> n >> k;
    pair<int, int> a[n];
    rep(i, 0, n) cin >> a[i].ff;
    rep(i, 0, n) a[i].ss = i;
    int ans[n];
    sort(a, a+n);
    rev(a, a+n);
    rep(i, 0, n){
        cnt[a[i].ff]++;
    }
    rep(i, 0, n){
        ans[a[i].ss] = 0;
        if(a[i].ff == k){
            ans[a[i].ss] = i;
        }
        cnt[a[i].ff] --;
        a[i].ff -= k;
        vector<int> v;
        for(int j = 1; j <= sqrt(a[i].ff); j++){
            if(a[i].ff % j == 0){
                v.pb(j);
                if(j != (a[i].ff/j)) v.pb(a[i].ff / j);
            }
        }
        for(int j : v) {
            if(j <= k) continue;
            ans[a[i].ss] += cnt[j];
        }
        a[i].ff += k;
        cnt[a[i].ff]++;
    }
    rep(i, 0, n) cout << ans[i] << " ";
    cout << endl;
}
int32_t main(){
    fast_io
    int t;
    t = 1;
    while(t--) solve();
}

Subtask #1
63.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 7256 KB Output is correct
2 Correct 7 ms 7000 KB Output is correct
3 Incorrect 290 ms 9904 KB Output isn't correct
4 Correct 852 ms 15184 KB Output is correct
5 Correct 338 ms 10728 KB Output is correct
6 Correct 979 ms 16184 KB Output is correct
7 Correct 373 ms 10616 KB Output is correct
8 Correct 379 ms 10612 KB Output is correct
9 Correct 1108 ms 15952 KB Output is correct
10 Correct 1107 ms 15816 KB Output is correct