oj.uz

답안 #499299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499299 2021-12-27T21:27:49 Z inksamurai Spiderman (COCI20_spiderman) C++17
56 / 70
 94 ms 13244 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int main(){
_3qplfh5;
	int n,k;
	cin>>n>>k;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	int ma=*max_element(all(a));
	vi cnt(ma+1);
	rep(i,n){
		cnt[a[i]]++;
	}
	vi oa=a;
	sort(all(a));
	a.erase(unique(all(a)),a.end());
	vi pans(ma+1,0);
	rep(i,sz(a)){
		int ai=a[i];
		int x=0;
		while(x<=ma){
			if(x+k<x+ai and x+k<=ma){
				pans[x+k]+=cnt[ai];
			}
			x+=ai;
		}
	}
	rep(i,n){
		cout<<pans[oa[i]]<<" ";
	}
	cout<<"\n";
//	
	return 0;
}

Subtask #1
56.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8060 KB Output is correct
2 Correct 10 ms 8120 KB Output is correct
3 Correct 30 ms 9820 KB Output is correct
4 Correct 69 ms 13244 KB Output is correct
5 Incorrect 40 ms 9788 KB Output isn't correct
6 Incorrect 86 ms 13224 KB Output isn't correct
7 Correct 38 ms 9668 KB Output is correct
8 Correct 40 ms 9796 KB Output is correct
9 Correct 94 ms 13120 KB Output is correct
10 Correct 91 ms 13124 KB Output is correct