oj.uz

Submission #198913

# Submission time Handle Problem Language Result Execution time Memory
198913 2020-01-28T05:38:20 Z dimash241 Spiderman (COCI20_spiderman) C++17
70 / 70
 112 ms 10232 KB 
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e6 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int a[N];

int ans[N];
int cnt[N];


int main () {
	SpeedForce;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		cnt[a[i]]++;
	}

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

	for (int i = 1; i <= n; i ++) {
		int res = ans[a[i]];
		if (a[i] % a[i] == k) res--;
		cout << res << ' ';
	}

   	return Accepted;
}

// B...a

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6520 KB Output is correct
2 Correct 14 ms 5752 KB Output is correct
3 Correct 37 ms 7416 KB Output is correct
4 Correct 73 ms 8824 KB Output is correct
5 Correct 53 ms 8824 KB Output is correct
6 Correct 112 ms 10232 KB Output is correct
7 Correct 53 ms 8824 KB Output is correct
8 Correct 50 ms 8824 KB Output is correct
9 Correct 111 ms 10104 KB Output is correct
10 Correct 105 ms 10104 KB Output is correct