Submission #848103

---

Source Code Expand

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

struct /* ow the */ edge {
	int v;
	long long mult,rem;
	edge() {}
	edge(long long mult, int v, long long rem): v(v), mult(mult), rem(rem) {}
	};

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N,Q;
	cin >> N >> Q;
	vector<long long> L(Q+1);
	vector< vector<edge> > E(Q+1);
	vector< vector<long long> > RMQ(17,vector<long long>(Q+1,2e18));
	L[0] =RMQ[0][0] =N;
	for(int q =0; q < Q; q++) {
		long long x;
		cin >> x;
		L[q+1] =RMQ[0][q+1] =x;
		int cur =q+1;
		for(int i =1; i < 17; i++) if(q+2 >= (1<<i)) RMQ[i][q+1] =min(RMQ[i-1][q+1],RMQ[i-1][q+1-(1<<(i-1))]);
		while(x > 0) {
			int nxt =cur-1;
			for(int k =16; k >= 0; k--) if((1<<k) <= nxt+1 && RMQ[k][nxt] >= x) nxt -=(1<<k);
/*			for(int i =cur-1; i >= 0; i--) if(L[i] < x) {
				nxt =i;
				break;}
*/			
//			cout << nxt << ".\n";
			if(nxt == -1) {
				E[q+1].push_back(edge(1,0,x));
				break;}
			E[q+1].push_back(edge(x/L[nxt],nxt,-1));
			x =x%L[nxt];
			cur =nxt;}
		}
	vector<long long> ans(N+1,0),mult(Q+1,0);
	mult[Q] =1;
	for(int q =Q; q >= 0; q--) 
		ALL_THE(E[q],it) {
			if(it->rem == -1) mult[it->v] +=mult[q]*(it->mult);
			else ans[it->rem] +=mult[q];}
	for(int i =N; i >= 1; i--) ans[i-1] +=ans[i];
	for(int i =1; i <= N; i++) cout << ans[i] << "\n";
	return 0;}

// look at my code
// my code is amazing

Submission Info

Judge Result