Submission #1864394
Source Code Expand
#include"bits/stdc++.h"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
const int maxn = 100010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);
template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}
template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}
int n,m,Q;
ll tim[maxn],A[maxn],Ans[maxn];
void Work(){
tim[n]=1;
RREP(i,n,1){
int k=A[i];
int t;
while(t=upper_bound(A+1,A+i,k)-A-1){
tim[t]+=tim[i]*(k/A[t]);
k%=A[t];
}
Ans[k]+=tim[i];
}
RREP(i,m,1)Ans[i]+=Ans[i+1];
REP(i,1,m)printf("%lld\n",Ans[i]);
}
void Init(){
read(m,Q);
A[++n]=m;
REP(i,1,Q){
int x;read(x);
while(n&&A[n]>=x)n--;
A[++n]=x;
}
}
int main(){
Init();
Work();
return 0;
}
Submission Info
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1400 |
Status |
|
AC |
× 10 |
WA |
× 1 |
TLE |
× 23 |
RE |
× 4 |
|
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 |
TLE |
2103 ms |
256 KB |
02.txt |
TLE |
2103 ms |
256 KB |
03.txt |
TLE |
2103 ms |
256 KB |
04.txt |
TLE |
2103 ms |
256 KB |
05.txt |
TLE |
2103 ms |
256 KB |
06.txt |
TLE |
2103 ms |
256 KB |
07.txt |
TLE |
2103 ms |
256 KB |
08.txt |
TLE |
2103 ms |
256 KB |
09.txt |
TLE |
2103 ms |
256 KB |
10.txt |
TLE |
2103 ms |
256 KB |
11.txt |
TLE |
2103 ms |
384 KB |
12.txt |
TLE |
2103 ms |
256 KB |
13.txt |
TLE |
2103 ms |
256 KB |
14.txt |
TLE |
2103 ms |
256 KB |
15.txt |
TLE |
2103 ms |
256 KB |
16.txt |
TLE |
2103 ms |
256 KB |
17.txt |
TLE |
2103 ms |
256 KB |
18.txt |
TLE |
2103 ms |
256 KB |
19.txt |
TLE |
2103 ms |
256 KB |
20.txt |
TLE |
2103 ms |
256 KB |
21.txt |
TLE |
2103 ms |
256 KB |
22.txt |
TLE |
2103 ms |
256 KB |
23.txt |
TLE |
2103 ms |
256 KB |
24.txt |
RE |
110 ms |
512 KB |
25.txt |
RE |
104 ms |
512 KB |
26.txt |
RE |
102 ms |
640 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 |
15 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 |
RE |
96 ms |
256 KB |
35.txt |
AC |
1 ms |
256 KB |
36.txt |
WA |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |