Contest Duration: - (local time) (110 minutes) Back to Home

Submission #846400

Source Code Expand

Copy
```#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<pair<int,int> >
#define PLL pair<long long,long long>
#define VPLL vector<pair<long long,long long> >
#define F first
#define S second
typedef long long LL;
using namespace std;
const int MOD = 1e9+7;
const int SIZE = 1e6+10;
LL an[SIZE],d[SIZE],cc[SIZE];
int main(){
DRII(N,Q);
d[Q]=N;
REP(i,Q)cin>>d[Q-i-1];
{
int it=1;
REPP(i,1,Q+1){
if(d[i]<d[it-1])d[it++]=d[i];
}
Q=it;
reverse(d,d+Q);
}
cc[Q-1]=1;
for(int i=Q-1;i>0;i--){
LL me=cc[i];
int it=i;
LL now=d[i];
while(it){
cc[it-1]+=me*(now/d[it-1]);
now%=d[it-1];
it=upper_bound(d,d+it,now)-d;
}
an[now]+=me;
}
an[d[0]]+=cc[0];
for(int i=N;i>0;i--)an[i]+=an[i+1];
REPP(i,1,N+1)cout<<an[i]<<endl;
return 0;
}```

#### Submission Info

Submission Time 2016-08-21 21:35:43+0900 E - Sequential operations on Sequence dreamoon C++14 (GCC 5.4.1) 1400 1578 Byte AC 957 ms 4096 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:32:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
DRII(N,Q);
^
```

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
 AC × 2
 AC × 38
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 853 ms 3072 KB
02.txt AC 849 ms 3200 KB
03.txt AC 926 ms 3200 KB
04.txt AC 910 ms 3200 KB
05.txt AC 928 ms 3200 KB
06.txt AC 942 ms 3968 KB
07.txt AC 821 ms 4096 KB
08.txt AC 942 ms 4096 KB
09.txt AC 901 ms 3968 KB
10.txt AC 941 ms 3968 KB
11.txt AC 940 ms 4096 KB
12.txt AC 946 ms 3968 KB
13.txt AC 870 ms 4096 KB
14.txt AC 941 ms 3968 KB
15.txt AC 934 ms 3968 KB
16.txt AC 859 ms 3968 KB
17.txt AC 957 ms 4096 KB
18.txt AC 942 ms 3968 KB
19.txt AC 795 ms 3968 KB
20.txt AC 811 ms 4096 KB
21.txt AC 830 ms 2816 KB
22.txt AC 763 ms 3712 KB
23.txt AC 857 ms 3968 KB
24.txt AC 824 ms 3840 KB
25.txt AC 774 ms 3712 KB
26.txt AC 772 ms 2816 KB
27.txt AC 769 ms 2048 KB
28.txt AC 791 ms 2048 KB
29.txt AC 788 ms 2048 KB
30.txt AC 788 ms 2048 KB
31.txt AC 4 ms 256 KB
32.txt AC 721 ms 1280 KB
33.txt AC 4 ms 256 KB
34.txt AC 593 ms 2432 KB
35.txt AC 4 ms 256 KB
36.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB