# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
844255 | 2023-09-05T11:53:15 Z | vjudge1 | Spiderman (COCI20_spiderman) | C++17 | 406 ms | 117716 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define endl "\n" #define all(c) (c).begin(), (c).end() const int N = 1e6 + 6; int cnt[N],freq[N]; void solve(){ int n,k; cin >> n >> k; vector<int> v(n),ans(n); for(int i = 0; i < n; i++){ cin >> v[i]; if(v[i] > k) freq[v[i]]++; } for(int i = 1; i < N; i++){ for(int j = i; j < N; j += i){ cnt[j] += freq[i]; } } int fuck = 0; for(int i = n - 1; i >= 0; i--){ if(v[i] > k){ ans[i] = cnt[v[i] - k]; } else if(v[i] == k) ans[i] = fuck; fuck += (v[i] > k); } for(int x : ans){ cout << x << ' '; } } signed main(){ #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; while(t--){ solve(); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 370 ms | 117584 KB | Output isn't correct |
2 | Incorrect | 364 ms | 117584 KB | Output isn't correct |
3 | Incorrect | 358 ms | 117552 KB | Output isn't correct |
4 | Incorrect | 375 ms | 117716 KB | Output isn't correct |
5 | Incorrect | 406 ms | 117584 KB | Output isn't correct |
6 | Incorrect | 364 ms | 117560 KB | Output isn't correct |
7 | Incorrect | 370 ms | 117584 KB | Output isn't correct |
8 | Incorrect | 362 ms | 117552 KB | Output isn't correct |
9 | Incorrect | 363 ms | 117584 KB | Output isn't correct |
10 | Incorrect | 366 ms | 117476 KB | Output isn't correct |