Submission #1677827
Source Code Expand
#include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<iostream> using namespace std; typedef long long LL; const int maxn=100010; int n,m,Q; LL q[maxn]; LL x; LL tag[maxn],a[maxn]; void solve(LL x,LL y){ if(x<=q[1]){ if(x) a[x]+=y;return; } int l=1,r=n,ret=1; while(l<=r){ int mid=(l+r)>>1; if(q[mid]<x){ ret=mid; l=mid+1; }else r=mid-1; } tag[ret]+=x/q[ret]*y; solve(x%q[ret],y); } int main(){ scanf("%d%d",&m,&Q); q[n=1]=m;q[0]=q[1]; for(int i=1;i<=Q;i++){ scanf("%lld",&x); while(n && x<=q[n]) n--; q[++n]=x; } tag[n]=1; for(int i=n;i>1;i--){ tag[i-1]+=(q[i]/q[i-1])*tag[i]; solve(q[i]%q[i-1],tag[i]); } a[q[1]]+=tag[1]; for(int i=m;i>=1;i--) a[i]+=a[i+1]; for(int i=1;i<=m;i++) printf("%lld\n",a[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | ljs |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 828 Byte |
Status | AC |
Exec Time | 61 ms |
Memory | 4096 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&m,&Q); ^ ./Main.cpp:32:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&x); ^
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 | 31 ms | 2304 KB |
02.txt | AC | 31 ms | 2432 KB |
03.txt | AC | 31 ms | 2432 KB |
04.txt | AC | 31 ms | 2432 KB |
05.txt | AC | 31 ms | 2432 KB |
06.txt | AC | 37 ms | 3968 KB |
07.txt | AC | 41 ms | 4096 KB |
08.txt | AC | 40 ms | 4096 KB |
09.txt | AC | 43 ms | 3968 KB |
10.txt | AC | 39 ms | 3968 KB |
11.txt | AC | 38 ms | 4096 KB |
12.txt | AC | 42 ms | 3968 KB |
13.txt | AC | 43 ms | 4096 KB |
14.txt | AC | 38 ms | 3968 KB |
15.txt | AC | 37 ms | 3968 KB |
16.txt | AC | 40 ms | 3968 KB |
17.txt | AC | 40 ms | 4096 KB |
18.txt | AC | 38 ms | 3968 KB |
19.txt | AC | 36 ms | 3968 KB |
20.txt | AC | 40 ms | 4096 KB |
21.txt | AC | 61 ms | 2816 KB |
22.txt | AC | 36 ms | 3712 KB |
23.txt | AC | 48 ms | 3968 KB |
24.txt | AC | 28 ms | 3840 KB |
25.txt | AC | 28 ms | 3712 KB |
26.txt | AC | 24 ms | 2816 KB |
27.txt | AC | 20 ms | 1280 KB |
28.txt | AC | 19 ms | 1280 KB |
29.txt | AC | 19 ms | 1280 KB |
30.txt | AC | 20 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 | 13 ms | 2560 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 |