Submission #1774086
Source Code Expand
#include <algorithm> #include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; typedef long long s64; inline s64 getint() { static char c; while ((c = getchar()) < '0' || c > '9'); s64 res = c - '0'; while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0'; return res; } const int MaxN = 100000; int n, m; int sta_n; s64 sta[MaxN + 2]; s64 occur[MaxN + 2]; s64 sum[MaxN + 2]; inline int jump(s64 x, int r) { int l = 1; while (l <= r) { int mid = l + r >> 1; if (sta[mid] > x) r = mid - 1; else l = mid + 1; } return r; } int main() { cin >> n >> m; sta[sta_n = 1] = n; for (int i = 1; i <= m; ++i) { s64 l = getint(); while (sta_n && l <= sta[sta_n]) --sta_n; sta[++sta_n] = l; } occur[sta_n] = 1; for (int i = sta_n; i; --i) { s64 l = sta[i]; int k = jump(l, i - 1); while (k > 0) { occur[k] += l / sta[k] * occur[i]; k = jump(l %= sta[k], k - 1); } sum[1] += occur[i]; sum[l + 1] -= occur[i]; } s64 cur = 0; for (int i = 1; i <= n; ++i) printf("%lld\n", cur += sum[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | InvUsr |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 1192 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 4096 KB |
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 | 28 ms | 1536 KB |
02.txt | AC | 28 ms | 1664 KB |
03.txt | AC | 28 ms | 1664 KB |
04.txt | AC | 28 ms | 1664 KB |
05.txt | AC | 28 ms | 1664 KB |
06.txt | AC | 36 ms | 3968 KB |
07.txt | AC | 37 ms | 4096 KB |
08.txt | AC | 37 ms | 4096 KB |
09.txt | AC | 39 ms | 3968 KB |
10.txt | AC | 36 ms | 3968 KB |
11.txt | AC | 35 ms | 4096 KB |
12.txt | AC | 38 ms | 3968 KB |
13.txt | AC | 39 ms | 4096 KB |
14.txt | AC | 36 ms | 3968 KB |
15.txt | AC | 35 ms | 3968 KB |
16.txt | AC | 37 ms | 3968 KB |
17.txt | AC | 37 ms | 4096 KB |
18.txt | AC | 36 ms | 3968 KB |
19.txt | AC | 35 ms | 3968 KB |
20.txt | AC | 37 ms | 4096 KB |
21.txt | AC | 50 ms | 2048 KB |
22.txt | AC | 33 ms | 3712 KB |
23.txt | AC | 41 ms | 3200 KB |
24.txt | AC | 27 ms | 3328 KB |
25.txt | AC | 27 ms | 3072 KB |
26.txt | AC | 22 ms | 2048 KB |
27.txt | AC | 14 ms | 384 KB |
28.txt | AC | 14 ms | 384 KB |
29.txt | AC | 14 ms | 512 KB |
30.txt | AC | 14 ms | 512 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 11 ms | 512 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 12 ms | 1664 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 |