# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197951 | 2020-01-24T12:03:28 Z | model_code | Spiderman (COCI20_spiderman) | C++17 | 273 ms | 10716 KB |
#include <bits/stdc++.h> using namespace std; #define TRACE(x) cerr << #x << " " << x << endl #define FOR(i, a, b) for (int i = (a); i < int(b); ++i) #define REP(i, n) FOR(i, 0, n) #define _ << " " << typedef long long llint; const int MAXN = 3e5 + 10; const int MAXH = 1e6 + 10; int n, k; int h[MAXN], sol[MAXH]; map<int, int> cnt; int main(void) { scanf("%d%d", &n, &k); for (int i = 0; i < n; ++i) { scanf("%d", &h[i]); cnt[h[i]]++; } for (const auto &p : cnt) { if (p.first <= k) continue; for (int j = k; j < MAXH; j += p.first) sol[j] += p.second; if (k == 0) sol[p.first]--; } for (int i = 0; i < n; ++i) printf("%d ", sol[h[i]]); printf("\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 4344 KB | Output is correct |
2 | Correct | 18 ms | 4216 KB | Output is correct |
3 | Correct | 57 ms | 5012 KB | Output is correct |
4 | Correct | 115 ms | 6520 KB | Output is correct |
5 | Correct | 153 ms | 9592 KB | Output is correct |
6 | Correct | 269 ms | 10716 KB | Output is correct |
7 | Correct | 138 ms | 9568 KB | Output is correct |
8 | Correct | 141 ms | 9640 KB | Output is correct |
9 | Correct | 250 ms | 10492 KB | Output is correct |
10 | Correct | 273 ms | 10484 KB | Output is correct |