Submission #1838521
Source Code Expand
#include <cstdio> #include <iostream> #include <cstring> #include <algorithm> #include <cmath> using namespace std; const int N = 1e5 + 5; typedef long long LL; int n , m , tot; LL cnt[N] , S[N] , stk[N] , num[N] , x; int main(void) { cin >> n >> m; stk[++ tot] = n; for(int i = 1;i <= m;++ i) { scanf("%lld" , &x); while(tot && stk[tot] >= x) tot --; stk[++ tot] = x; } num[tot] = 1; int whi; for(int i = tot;i >= 1;-- i) { if(i == 1) { S[stk[i]] += num[i]; break; } num[i - 1] += (stk[i] / stk[i - 1]) * num[i]; stk[i] %= stk[i - 1]; while(stk[i] >= stk[1]) { whi = upper_bound(stk + 1 , stk + i + 1 , stk[i]) - stk - 1; S[whi] += num[i] * (stk[i] / stk[whi]); stk[i] %= stk[whi]; } S[stk[i]] += num[i]; } for(int i = n;i >= 1;-- i) S[i] += S[i + 1]; for(int i = 1;i <= n;++ i)printf("%lld\n" , S[i]); }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | Timsei |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 890 Byte |
Status | WA |
Exec Time | 53 ms |
Memory | 3584 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:21: 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 | 0 / 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 | WA | 29 ms | 2176 KB |
02.txt | WA | 29 ms | 2304 KB |
03.txt | WA | 29 ms | 2304 KB |
04.txt | WA | 29 ms | 2304 KB |
05.txt | WA | 29 ms | 2176 KB |
06.txt | WA | 35 ms | 3584 KB |
07.txt | WA | 37 ms | 3584 KB |
08.txt | WA | 36 ms | 3584 KB |
09.txt | WA | 38 ms | 3456 KB |
10.txt | WA | 35 ms | 3584 KB |
11.txt | WA | 34 ms | 3584 KB |
12.txt | WA | 37 ms | 3584 KB |
13.txt | WA | 38 ms | 3456 KB |
14.txt | WA | 35 ms | 3584 KB |
15.txt | WA | 34 ms | 3584 KB |
16.txt | WA | 36 ms | 3584 KB |
17.txt | WA | 36 ms | 3456 KB |
18.txt | WA | 35 ms | 3584 KB |
19.txt | WA | 33 ms | 3584 KB |
20.txt | WA | 36 ms | 3456 KB |
21.txt | WA | 53 ms | 2816 KB |
22.txt | WA | 32 ms | 3200 KB |
23.txt | WA | 41 ms | 3072 KB |
24.txt | WA | 25 ms | 2944 KB |
25.txt | WA | 24 ms | 2944 KB |
26.txt | WA | 24 ms | 2944 KB |
27.txt | AC | 19 ms | 1280 KB |
28.txt | AC | 19 ms | 1280 KB |
29.txt | AC | 19 ms | 1280 KB |
30.txt | AC | 19 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 | 2560 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 |