# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
644928 | 2022-09-25T14:27:56 Z | 1zaid1 | Spiderman (COCI20_spiderman) | C++17 | 541 ms | 19180 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define endl '\n'; const int M = 2e6+5, MOD = 1e9+7; int fr[M], ans[M]; signed main() { cin.tie(0)->sync_with_stdio(0); int n, k; cin >> n >> k; vector<int> v(n); for (int&i:v) cin >> i; for (int i:v) fr[i]++; for (int&i:v) i -= k; for (int i:v) { if (i < 0) continue; if (ans[i]) continue; fr[i+k]--; for (int x = 1; x*x <= i; x++) { if (i%x == 0) { if ((i+k)%x == k) ans[i] += fr[x]; if (x*x != i) if ((i+k)%(i/x) == k) ans[i] += fr[i/x]; } } fr[i+k]++; } for (int i:v) ans[0] += i > 0; for (int i:v) { if (i >= 0) cout << ans[i] << ' '; else cout << 0 << ' '; } cout << endl; return 0; } /* a%b = k 6 3 4 3 12 6 8 2 0 1 2 3 4 5 6 7 8 9 10 11 12 fr:1 1 0 1 0 0 0 0 0 1 0 0 0 as:0 0 0 0 0 0 0 0 0 0 0 0 0 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 6228 KB | Output is correct |
2 | Correct | 8 ms | 3668 KB | Output is correct |
3 | Correct | 40 ms | 7648 KB | Output is correct |
4 | Correct | 259 ms | 9696 KB | Output is correct |
5 | Correct | 353 ms | 16900 KB | Output is correct |
6 | Correct | 355 ms | 19180 KB | Output is correct |
7 | Correct | 392 ms | 17080 KB | Output is correct |
8 | Correct | 398 ms | 16904 KB | Output is correct |
9 | Correct | 494 ms | 19124 KB | Output is correct |
10 | Correct | 541 ms | 19100 KB | Output is correct |