Submission #848444

---

Source Code Expand

#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;
using ll=long long;

ll ary[100010];
map<ll,ll> cnt;

vector<ll> order;

ll ans[100010];

int main(void){
	int n,q;
	cin >> n >> q;
	rep(i,q) cin >> ary[i];

	ll cur=1LL<<60;
	rrep(i,q){
		if(cur>ary[i]){
			order.push_back(ary[i]);
			cur=ary[i];
		}
	}

	cnt[order[0]]++;
	const int m=order.size();
	rep(i,1,m){
		ll num=cnt[order[i-1]]*(order[i-1]/order[i]);
		ll add=cnt[order[i-1]];
		cnt[order[i-1]]=0;
		cnt[order[i]]+=num;
		if(order[i-1]%order[i]!=0) cnt[order[i-1]%order[i]]+=add;
	}

	//rep(i,1,n+1) cout << cnt[i] << endl;

	rep(i,1,n+1) ans[1]+=cnt[i],ans[i+1]-=cnt[i];
	rep(i,1,n+1) ans[i]+=ans[i-1];
	rep(i,1,n+1) cout << ans[i] << endl;
	return 0;
}

Submission Info

Judge Result