Submission #2711259
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; typedef long long ll; const int maxN = 3 * 1e5 + 5; int ans[maxN], tot; ll N, A, B; int main() { scanf("%lld%lld%lld", &N, &A, &B); if(A + B - 1 <= N && N <= A * B) { for(int i = N - A + 1; i <= N; ++i) ans[++tot] = i; N -= A; for(int i = B - 1; i >= 1; --i) { int t = min(N - i + 1, A); for(int j = N - t + 1; j <= N; ++j) ans[++tot] = j; N -= t; } for(int i = 1; i <= tot; ++i) printf("%d ", ans[i]); } else { printf("-1\n"); } }
Submission Info
Submission Time | |
---|---|
Task | E - LISDL |
User | amy1228 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 564 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 3328 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld%lld", &N, &A, &B); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.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, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 10 ms | 1152 KB |
02.txt | AC | 2 ms | 384 KB |
03.txt | AC | 13 ms | 1664 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 23 ms | 2944 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 12 ms | 1536 KB |
09.txt | AC | 14 ms | 1920 KB |
10.txt | AC | 24 ms | 3072 KB |
11.txt | AC | 25 ms | 3200 KB |
12.txt | AC | 27 ms | 3328 KB |
13.txt | AC | 21 ms | 2688 KB |
14.txt | AC | 20 ms | 2432 KB |
15.txt | AC | 7 ms | 896 KB |
16.txt | AC | 25 ms | 3200 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 9 ms | 1152 KB |
19.txt | AC | 18 ms | 2304 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 10 ms | 1152 KB |
22.txt | AC | 20 ms | 2560 KB |
23.txt | AC | 18 ms | 2304 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 23 ms | 2944 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 10 ms | 1280 KB |
29.txt | AC | 20 ms | 2560 KB |
30.txt | AC | 22 ms | 2816 KB |
31.txt | AC | 16 ms | 2048 KB |
32.txt | AC | 27 ms | 3328 KB |
33.txt | AC | 25 ms | 3200 KB |
34.txt | AC | 23 ms | 2816 KB |
35.txt | AC | 9 ms | 1152 KB |
36.txt | AC | 26 ms | 3328 KB |
37.txt | AC | 2 ms | 256 KB |
38.txt | AC | 10 ms | 1280 KB |
39.txt | AC | 19 ms | 2432 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 24 ms | 3072 KB |
46.txt | AC | 12 ms | 1536 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 22 ms | 2816 KB |
49.txt | AC | 4 ms | 512 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |