oj.uz

답안 #844241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844241 2023-09-05T11:45:21 Z vjudge1 Spiderman (COCI20_spiderman) C++17
70 / 70
 49 ms 12940 KB 
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 1000005

const int modulo = 1e9 + 7;

int cnt[N], res[N], arr[N];

int32_t main()
{
	fastio();

	int n, k;
	cin>>n>>k;

	for (int i = 1; i <= n; i++){
		cin>>arr[i];
		cnt[arr[i]]++;
	}

	for (int i = k + 1; i < N; i++){
		for (int j = 0; j < N; j += i)
			res[j] += cnt[i];
	}

	for (int i = 1; i <= n; i++){
		if (arr[i] < k) cout<<0<<sp;
		else cout<<res[arr[i] - k] - (k == 0 ? 1 : 0)<<sp;
	}

	cout<<endl;
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9308 KB Output is correct
2 Correct 12 ms 9112 KB Output is correct
3 Correct 31 ms 11876 KB Output is correct
4 Correct 45 ms 12372 KB Output is correct
5 Correct 25 ms 12368 KB Output is correct
6 Correct 48 ms 12940 KB Output is correct
7 Correct 22 ms 12192 KB Output is correct
8 Correct 23 ms 12380 KB Output is correct
9 Correct 47 ms 12884 KB Output is correct
10 Correct 49 ms 12880 KB Output is correct