Submission #846333


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
Task A - Wanna go back home
User dreamoon
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1578 Byte
Status WA
Exec Time 5 ms
Memory 256 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 0 / 200
Status
WA × 4
WA × 15
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 13.txt, 15.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt WA 4 ms 256 KB
04.txt WA 4 ms 256 KB
05.txt WA 4 ms 256 KB
06.txt WA 4 ms 256 KB
07.txt WA 4 ms 256 KB
08.txt WA 5 ms 256 KB
09.txt WA 4 ms 256 KB
10.txt WA 4 ms 256 KB
11.txt WA 4 ms 256 KB
13.txt WA 4 ms 256 KB
15.txt WA 4 ms 256 KB
s1.txt WA 4 ms 256 KB
s2.txt WA 4 ms 256 KB
s3.txt WA 4 ms 256 KB
s4.txt WA 4 ms 256 KB