oj.uz

답안 #881342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881342 2023-12-01T07:06:29 Z ilhan_arda Spiderman (COCI20_spiderman) C++17
70 / 70
 1014 ms 7888 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define pb push_back
#define endl "\n"
//~ #define int long long
using namespace std;
 
typedef tuple<int, int, int> iii;
typedef long long ll;
const int mod =998244353;
 
int n, k;
int a[300005], mp[1000005];
 
int32_t main(){
	fast;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		mp[a[i]]++;
	}
	//~ sort(a+1, a+n+1);
	int temp=-1;
	for(int i=1;i<=n;i++){
		if(a[i]<k){
			cout<<0<<" ";
			continue;
		}
		if(a[i]==k && temp==-1){
			temp=n;
			for(int j=1;j<=n;j++){
				if(a[j]<=k)temp--;
			}
			cout<<temp<<" ";
			continue;
		}
		else if(a[i]==k){
			cout<<temp<<" ";
			continue;
		}
		int ans=0;
		a[i]-=k;
		for(int  j=1;j*j<=a[i];j++){
			if(a[i]/j*j==a[i]){
				if(j>k)ans+=mp[j];
				if(j*j!=a[i] && a[i]/j>k)ans+=mp[a[i]/j];
				if(j==1 && k==0){
					ans--;
				}
			}
		}
		a[i]+=k;
		cout<<ans<<" ";
	}
	cout<<endl;
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4696 KB Output is correct
2 Correct 6 ms 4696 KB Output is correct
3 Correct 262 ms 5892 KB Output is correct
4 Correct 771 ms 7888 KB Output is correct
5 Correct 302 ms 5460 KB Output is correct
6 Correct 887 ms 7564 KB Output is correct
7 Correct 342 ms 5712 KB Output is correct
8 Correct 347 ms 5580 KB Output is correct
9 Correct 1014 ms 7364 KB Output is correct
10 Correct 1012 ms 7788 KB Output is correct