-
Notifications
You must be signed in to change notification settings - Fork 0
/
Just Update and Print the Array - KOL15C.cpp
102 lines (87 loc) · 5.41 KB
/
Just Update and Print the Array - KOL15C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
// https://www.codechef.com/problems/KOL15C
// Innovative observation to see square root decomposition. It can be splitted into heavy and light subproblem
// light
// if a is greater than sqrt(n), then we can do brute force as it can run for a max of sqrt(n) time complexity
// heavy
// if a is less than sqrt(n), then we see that the prefix sum array of a particular index (i.e a), can be directly
// added to the original array. It can have at max of sqrt(n) elements consisting of at max n elements
// So total time complexity = O(n*sqrt(n))
/*
░██████╗██████╗░░█████╗░██████╗░░██████╗██╗░░██╗ ░██████╗░██╗░░░██╗██████╗░████████╗░█████╗░
██╔════╝██╔══██╗██╔══██╗██╔══██╗██╔════╝██║░░██║ ██╔════╝░██║░░░██║██╔══██╗╚══██╔══╝██╔══██╗
╚█████╗░██████╔╝███████║██████╔╝╚█████╗░███████║ ██║░░██╗░██║░░░██║██████╔╝░░░██║░░░███████║
░╚═══██╗██╔═══╝░██╔══██║██╔══██╗░╚═══██╗██╔══██║ ██║░░╚██╗██║░░░██║██╔═══╝░░░░██║░░░██╔══██║
██████╔╝██║░░░░░██║░░██║██║░░██║██████╔╝██║░░██║ ╚██████╔╝╚██████╔╝██║░░░░░░░░██║░░░██║░░██║
╚═════╝░╚═╝░░░░░╚═╝░░╚═╝╚═╝░░╚═╝╚═════╝░╚═╝░░╚═╝ ░╚═════╝░░╚═════╝░╚═╝░░░░░░░░╚═╝░░░╚═╝░░╚═╝
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗
╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define ll long long
#define pll pair<ll, ll>
#define vll vector<long long>
#define mll map<ll, ll>
#define inf 1e18
#define gcd(a, b) __gcd(a, b)
#define range(a,b) substr(a,b-a+1)
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define fori(a, n) for (ll i = a; i < n; i++)
#define forj(a, n) for (ll j = a; j < n; j++)
#define fork(a, n) for (ll k = a; k < n; k++)
#define print(x) for (auto i : x) {cout << i << " ";}
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
bool comp(T a, T b) {
if (a < b)
return true;
return false;
}
int main()
{
#ifndef ONLINE_JUDGE
//remove this piece of code when this has to be submitted in kickstart, coding ninjas
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
//freopen is used to associate a file with stdin or stdout stream in C++
#endif
ll n, q;
cin >> n >> q;
vll arr(n);
vector<vll> queries(ceil(sqrt(n)), vll());
fori(0, q) {
ll a, b;
cin >> a >> b;
if (a > (ll)sqrt(n)) {
ll j = 0;
while (j * a + b - 1 < n) {
arr[j * a + b - 1] += 1;
j++;
}
}
else
queries[a].pb(b);
}
fori(0, queries.size()) {
if (queries[i].size()) {
vll pre_sum(n);
forj(0, queries[i].size())
pre_sum[queries[i][j] - 1] += 1;
forj(i, n)
pre_sum[j] += pre_sum[j - i];
forj(0, n)
arr[j] += pre_sum[j];
}
}
print(arr);
return 0;
}