Submission #590262

#	Time	Username	Problem	Language	Result	Execution time	Memory
590262		nguyen31hoang08minh2003	Spiderman (COCI20_spiderman)	C++14	70 / 70	886 ms	6608 KiB

spiderman

/*
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
 ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
 ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (signed i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (signed i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (signed i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define subtree(x) num[x], num[x] + d[x] - 1
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

const int maxN = 300005, maxH = 1e6 + 5;

int n, k, mxh, h[maxN], res[maxH];
bool seen[maxN];

int main() {
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n >> k;
    fort(i, 1, n) {
        cin >> h[i];
        maxi(mxh, h[i]);
    }
    fort(i, 1, n) {
        if (h[i] <= k)
            continue;
        for (int j = k; j <= mxh; j += h[i]) {
            ++res[j];
            if (j == h[i])
                seen[i] = true;
        }
    }
    fort(i, 1, n)
        cout << res[h[i]] - seen[i] << ' ';
    cout << '\n';
    return 0;
}

• Subtask 1: 70 / 70