Submission #1678134
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; #define MAXN 100000 #define ll long long #define rint register int #define gc() getchar() inline ll read(ll ans = 0, rint sgn = ' ', rint ch = gc()) { for(; ch < '0' || ch > '9'; sgn = ch, ch = gc()); for(; ch >='0' && ch <='9';(ans*=10)+=ch-'0', ch = gc()); return sgn-'-'?ans:-ans; } int N, Q, tmp; ll X[MAXN+5], D[MAXN+5], R[MAXN+5], V, x; void DFS(ll T){if(T <= X[1]){R[T] += V; return;} tmp = lower_bound(X+1,X+Q+1,T)-X-1, D[tmp] += T/X[tmp]*V, DFS(T%X[tmp]);} int main() { N = read(); X[Q=1] = N; for(int i = read(); i--; X[++Q] = x) for(x = read(); Q && x <= X[Q]; Q--); D[Q] = 1; for(rint i = Q; i > 1; D[i-1] += X[i]/X[i-1]*D[i], V = D[i], DFS(X[i]%X[i-1]), i--); R[X[1]] += D[1]; for(rint i = N; i; R[i-1] += R[i], i--); for(rint i = 1; i <= N; printf("%lld\n",R[i]), i++); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Sequential operations on Sequence |
User | Magolor |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 944 Byte |
Status | AC |
Exec Time | 51 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 | 2304 KB |
02.txt | AC | 28 ms | 2432 KB |
03.txt | AC | 28 ms | 2432 KB |
04.txt | AC | 28 ms | 2432 KB |
05.txt | AC | 28 ms | 2432 KB |
06.txt | AC | 35 ms | 3968 KB |
07.txt | AC | 37 ms | 4096 KB |
08.txt | AC | 36 ms | 4096 KB |
09.txt | AC | 39 ms | 3968 KB |
10.txt | AC | 35 ms | 3968 KB |
11.txt | AC | 34 ms | 4096 KB |
12.txt | AC | 37 ms | 3968 KB |
13.txt | AC | 39 ms | 4096 KB |
14.txt | AC | 35 ms | 3968 KB |
15.txt | AC | 34 ms | 3968 KB |
16.txt | AC | 36 ms | 3968 KB |
17.txt | AC | 36 ms | 4096 KB |
18.txt | AC | 35 ms | 3968 KB |
19.txt | AC | 33 ms | 3968 KB |
20.txt | AC | 37 ms | 4096 KB |
21.txt | AC | 51 ms | 2816 KB |
22.txt | AC | 31 ms | 3712 KB |
23.txt | AC | 43 ms | 3968 KB |
24.txt | AC | 24 ms | 3840 KB |
25.txt | AC | 24 ms | 3712 KB |
26.txt | AC | 20 ms | 2816 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 | AC | 13 ms | 2560 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 |