oj.uz

답안 #198494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
198494 2020-01-26T11:57:25 Z alishahali1382 Spiderman (COCI20_spiderman) C++14
70 / 70
 108 ms 8312 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 1000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN];
int cnt[MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>k;
	for (int i=1; i<=n; i++){
		cin>>A[i];
		if (A[i]>k) cnt[A[i]]++, cnt[0]++;
	}
	for (int i=MAXN-1; i; i--) for (int j=i+i; j<MAXN; j+=i) cnt[j]+=cnt[i];
	for (int i=1; i<=n; i++){
		if (A[i]<k) cout<<"0 ";
		else cout<<cnt[A[i]-k]-(k==0)<<' ';
	}
	cout<<'\n';
	
	return 0;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 4472 KB Output is correct
2 Correct 28 ms 4472 KB Output is correct
3 Correct 49 ms 5752 KB Output is correct
4 Correct 92 ms 8284 KB Output is correct
5 Correct 58 ms 5496 KB Output is correct
6 Correct 107 ms 8312 KB Output is correct
7 Correct 56 ms 5496 KB Output is correct
8 Correct 64 ms 5624 KB Output is correct
9 Correct 103 ms 8188 KB Output is correct
10 Correct 108 ms 8312 KB Output is correct