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

Submission #847723

Source Code Expand

Copy
```#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;

int n, q;
vector<LL> st;
vector<LL> cnt;
LL ans[100005] = {};

int main() {
//freopen("input.txt", "r", stdin);
scanf("%d%d", &n, &q);
st.pb(n);
forn(i, q) {
LL x;
scanf("%lld", &x);
while (!st.empty() && st.back() >= x) {
st.pop_back();
}
st.pb(x);
}
forn(i, st.size()) cnt.pb(0);
cnt.back() = 1;
while ((int)st.size() > 1) {
LL b = st.back();
st.pop_back();
LL c = cnt.back();
cnt.pop_back();
while (b > st[0]) {
int lo = 0, hi = (int)st.size() - 1, mid;
while (lo < hi) {
mid = (lo + hi + 1) >> 1;
if (st[mid] > b) {
hi = mid - 1;
} else {
lo = mid;
}
}
cnt[lo] += c * (b / st[lo]);
b %= st[lo];
}
if (b > 0) {
ans[b] += c;
}
}
ans[st[0]] += cnt[0];
for (int i = n - 1; i >= 1; --i) {
ans[i] += ans[i + 1];
}
for (int i = 1; i <= n; ++i) {
printf("%lld\n", ans[i]);
}
return 0;
}
```

#### Submission Info

Submission Time 2016-08-21 22:21:49+0900 E - Sequential operations on Sequence HellKitsune C++14 (GCC 5.4.1) 1400 1404 Byte AC 144 ms 4212 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:17:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &q);
^
./Main.cpp:21:26: 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 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 59 ms 2304 KB
02.txt AC 60 ms 2432 KB
03.txt AC 65 ms 2432 KB
04.txt AC 62 ms 2432 KB
05.txt AC 63 ms 2432 KB
06.txt AC 90 ms 4084 KB
07.txt AC 99 ms 4212 KB
08.txt AC 96 ms 4212 KB
09.txt AC 101 ms 4084 KB
10.txt AC 90 ms 4084 KB
11.txt AC 87 ms 4212 KB
12.txt AC 97 ms 4084 KB
13.txt AC 100 ms 4212 KB
14.txt AC 88 ms 4084 KB
15.txt AC 86 ms 4084 KB
16.txt AC 93 ms 4084 KB
17.txt AC 95 ms 4212 KB
18.txt AC 91 ms 4084 KB
19.txt AC 84 ms 4084 KB
20.txt AC 97 ms 4212 KB
21.txt AC 144 ms 2932 KB
22.txt AC 88 ms 3828 KB
23.txt AC 112 ms 4084 KB
24.txt AC 67 ms 3956 KB
25.txt AC 64 ms 3828 KB
26.txt AC 56 ms 2932 KB
27.txt AC 36 ms 1152 KB
28.txt AC 36 ms 1152 KB
29.txt AC 40 ms 1152 KB
30.txt AC 37 ms 1152 KB
31.txt AC 4 ms 256 KB
32.txt AC 20 ms 1152 KB
33.txt AC 4 ms 256 KB
34.txt AC 30 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