Submission #2707310
Source Code Expand
#include<iostream> #include<stdio.h> #include<string.h> #include<algorithm> #define maxn 10000005 using namespace std; int n,a,b,tot; int ans[maxn]; int main() { scanf("%d%d%d",&n,&a,&b); if(n<a+b-1 || n>a*b) { printf("-1\n"); return 0; } for(int i=n-a+1;i<=n;i++) ans[++tot]=i; n-=a; b--; for(int i=b;i>=1;i--) { int now=min(a,n-(n-i-1)); for(int j=n-now+1;j<=n;j++) ans[++tot]=j; n-=now; } for(int i=1;i<=tot;i++) printf("%d ",ans[i]); }
Submission Info
Submission Time | |
---|---|
Task | E - LISDL |
User | yyxzhj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 506 Byte |
Status | RE |
Exec Time | 487 ms |
Memory | 72192 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&n,&a,&b); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 487 ms | 72192 KB |
03.txt | RE | 112 ms | 39296 KB |
04.txt | WA | 2 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 | WA | 12 ms | 1536 KB |
09.txt | WA | 9 ms | 1152 KB |
10.txt | RE | 111 ms | 39296 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | RE | 111 ms | 39296 KB |
13.txt | WA | 1 ms | 256 KB |
14.txt | WA | 174 ms | 24448 KB |
15.txt | WA | 42 ms | 5888 KB |
16.txt | RE | 113 ms | 39296 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 2 ms | 256 KB |
19.txt | WA | 12 ms | 1536 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 10 ms | 1152 KB |
22.txt | WA | 486 ms | 71680 KB |
23.txt | RE | 111 ms | 39296 KB |
24.txt | WA | 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 | WA | 12 ms | 1536 KB |
29.txt | WA | 9 ms | 1280 KB |
30.txt | RE | 111 ms | 39296 KB |
31.txt | WA | 1 ms | 256 KB |
32.txt | RE | 114 ms | 39296 KB |
33.txt | WA | 1 ms | 256 KB |
34.txt | WA | 173 ms | 24320 KB |
35.txt | WA | 42 ms | 5760 KB |
36.txt | RE | 111 ms | 39296 KB |
37.txt | WA | 1 ms | 256 KB |
38.txt | WA | 2 ms | 256 KB |
39.txt | WA | 12 ms | 1536 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 | WA | 2 ms | 256 KB |
45.txt | RE | 113 ms | 39296 KB |
46.txt | WA | 1 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | WA | 12 ms | 1536 KB |
49.txt | WA | 1 ms | 256 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 |