oj.uz

Submission #590244

# Submission time Handle Problem Language Result Execution time Memory
590244 2022-07-05T16:58:12 Z nguyen31hoang08minh2003 Spiderman (COCI20_spiderman) C++14
42 / 70
 2000 ms 33904 KB 
/*
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
 ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
 ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )
(   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (  (   )  ) (
*/
#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[maxN];
vi p[maxH];

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]);
        p[h[i]].pb(i);
    }
    fort(i, 1, n) {
        if (h[i] <= k)
            continue;
        for (int j = k; j <= mxh; j += h[i])
            for (const int &z : p[j])
                ++res[z];
    }
    fort(i, 1, n)
        cout << res[i] << ' ';
    cout << '\n';
    return 0;
}

Subtask #1
42.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 23920 KB Output is correct
2 Correct 68 ms 23868 KB Output is correct
3 Execution timed out 2073 ms 26340 KB Time limit exceeded
4 Execution timed out 2041 ms 31156 KB Time limit exceeded
5 Incorrect 276 ms 28484 KB Output isn't correct
6 Incorrect 834 ms 33904 KB Output isn't correct
7 Correct 170 ms 28544 KB Output is correct
8 Correct 200 ms 28496 KB Output is correct
9 Correct 727 ms 33904 KB Output is correct
10 Correct 604 ms 33844 KB Output is correct