Submission #848095

---

Source Code Expand

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;


int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n,q;
  cin>>n>>q;
  vector<ll> qs={n};
  rep(i,q){
    ll x;
    cin>>x;
    while(qs.size() && qs.back()>=x) qs.pop_back();
    qs.pb(x);
  }
  //cout<<qs;
  map<ll,ll> cnt;
  ll sum=qs.back();
  cnt[qs.back()]=1;
  rrep(i,qs.size()-1){
    map<ll,ll> tmp;
    for(auto it=cnt.lower_bound(qs[i]);it!=cnt.end();++it){
      tmp[it->X%qs[i]]+=it->Y;
      //cout<<*it<<"->"<<it->X%qs[i]<<endl;
      //cout<<sum<<"=>";
      sum-=it->X*it->Y;
      sum+=(it->X%qs[i])*it->Y;
      //cout<<sum<<endl;
    }
    cnt.erase(cnt.lower_bound(qs[i]),cnt.end());
    for(auto p:tmp) cnt[p.X]+=p.Y;
    cnt[qs[i]]+=(qs.back()-sum)/qs[i];
    //cout<<qs.back()-sum<<","<<qs[i]<<","<<(qs.back()-sum)%qs[i]<<endl;
    sum=qs.back();
    //  for(auto p:cnt) cout<<p;cout<<endl;
  }
  vector<ll> re(n);
  for(auto p:cnt) re[p.X]=p.Y;
  //cout<<re;
  ll s=accumulate(all(re),0ll);
  rep(i,n){
    s-=re[i];
    cout<<s<<endl;
  }
  return 0;
}

Submission Info

Judge Result