Submission #9166362
Source Code Expand
// =================================== // author: M_sea // website: http://m-sea-blog.com/ // =================================== #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio> #include <vector> #include <cmath> #define re register #define int long long using namespace std; inline int read() { int X=0,w=1; char c=getchar(); while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); } while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar(); return X*w; } const int N=100000+10; int n,Q,q[N]; int w[N],ans[N]; inline void solve(int x,int v) { if (!x) return; int p=upper_bound(q+1,q+Q+1,x)-q-1; if (!p) ans[1]+=v,ans[x+1]-=v; else w[p]+=v*(x/q[p]),solve(x%q[p],v); } signed main() { n=read(); q[++Q]=n; for (re int i=read();i;--i) { int x=read(); while (Q&&x<=q[Q]) --Q; q[++Q]=x; } w[Q]=1; for (re int i=Q;i>1;--i) w[i-1]+=w[i]*(q[i]/q[i-1]),solve(q[i]%q[i-1],w[i]); ans[1]+=w[1],ans[q[1]+1]-=w[1]; for (re int i=2;i<=n;++i) ans[i]+=ans[i-1]; for (re int i=1;i<=n;++i) printf("%lld\n",ans[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | M_sea |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 1155 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 4096 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1400 / 1400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 28 ms | 2304 KB |
02.txt | AC | 28 ms | 2432 KB |
03.txt | AC | 28 ms | 2432 KB |
04.txt | AC | 29 ms | 2432 KB |
05.txt | AC | 28 ms | 2432 KB |
06.txt | AC | 35 ms | 3968 KB |
07.txt | AC | 37 ms | 4096 KB |
08.txt | AC | 36 ms | 4096 KB |
09.txt | AC | 39 ms | 3968 KB |
10.txt | AC | 35 ms | 3968 KB |
11.txt | AC | 34 ms | 4096 KB |
12.txt | AC | 38 ms | 3968 KB |
13.txt | AC | 39 ms | 4096 KB |
14.txt | AC | 35 ms | 3968 KB |
15.txt | AC | 34 ms | 3968 KB |
16.txt | AC | 36 ms | 3968 KB |
17.txt | AC | 37 ms | 4096 KB |
18.txt | AC | 36 ms | 3968 KB |
19.txt | AC | 33 ms | 3968 KB |
20.txt | AC | 37 ms | 4096 KB |
21.txt | AC | 50 ms | 2816 KB |
22.txt | AC | 32 ms | 3712 KB |
23.txt | AC | 41 ms | 3968 KB |
24.txt | AC | 25 ms | 3840 KB |
25.txt | AC | 24 ms | 3712 KB |
26.txt | AC | 21 ms | 2816 KB |
27.txt | AC | 14 ms | 1280 KB |
28.txt | AC | 14 ms | 1280 KB |
29.txt | AC | 14 ms | 1280 KB |
30.txt | AC | 16 ms | 1280 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 10 ms | 1280 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 12 ms | 2432 KB |
35.txt | AC | 1 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |