oj.uz

Submission #201074

# Submission time Handle Problem Language Result Execution time Memory
201074 2020-02-09T09:38:03 Z mraron Spiderman (COCI20_spiderman) C++14
70 / 70
 166 ms 21216 KB 
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=3.1415926535897932384626433832795;
const ll INF = 1LL<<62;
const ll MINF = -1LL<<62;

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)


ll n,k;
ll cnt[1000001];
ll ans[1000001];

int main() {
	IO;
	cin>>n>>k;
	vector<ll> lst;
	for(int i=0;i<n;++i) {
		ll x;
		cin>>x;
		lst.push_back(x);
		cnt[x]++;
	}
	
	for(int i=k+1;i<=1000000;++i) {
		for(int j=k;j<=1000000;j+=i) {
			ans[j]+=cnt[i];
		}
	}
	
	for(auto i:lst) {
		cout<<ans[i]-(k==0)<<" ";
	}
	cout<<"\n";
	return 0;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 11256 KB Output is correct
2 Correct 71 ms 9976 KB Output is correct
3 Correct 102 ms 13168 KB Output is correct
4 Correct 128 ms 16480 KB Output is correct
5 Correct 118 ms 17772 KB Output is correct
6 Correct 166 ms 21216 KB Output is correct
7 Correct 99 ms 17904 KB Output is correct
8 Correct 100 ms 17772 KB Output is correct
9 Correct 159 ms 21092 KB Output is correct
10 Correct 159 ms 21088 KB Output is correct