Submission #3219791
Source Code Expand
// Copyright (C) 2018 Skqliao. All rights served. #include <bits/stdc++.h> #define rep(i, l, r) for (__typeof(l) i = (l), _##i##_ = (r); i < _##i##_; ++i) #define rof(i, l, r) for (__typeof(l) i = (l) - 1, _##i##_ = (r); i >= _##i##_; --i) #define irep(i, x) for (__typeof(x.begin()) i = x.begin(); i != x.end(); ++i) #define ALL(x) (x).begin(), (x).end() #define SZ(x) static_cast<int>((x).size()) typedef long long ll; typedef std::pair<int, int> pii; template<typename T> inline bool chkMin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template<typename T> inline bool chkMax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } ll N, A, B; int main() { scanf("%lld%lld%lld", &N, &A, &B); if(A * B < N || A + B > N + 1) { puts("-1"); } else { while(N > 0) { ll x = std::min(A, N - B + 1); rep(i, N - x + 1, N + 1) { printf("%lld ", i); } --B; N -= x; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - LISDL |
User | Skqliao |
Language | C++ (GCC 5.4.1) |
Score | 700 |
Code Size | 937 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 2176 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17: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 | 768 KB |
02.txt | AC | 2 ms | 256 KB |
03.txt | AC | 13 ms | 1152 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 24 ms | 1920 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 12 ms | 1024 KB |
09.txt | AC | 15 ms | 1280 KB |
10.txt | AC | 25 ms | 2048 KB |
11.txt | AC | 25 ms | 2048 KB |
12.txt | AC | 27 ms | 2176 KB |
13.txt | AC | 22 ms | 1792 KB |
14.txt | AC | 20 ms | 1664 KB |
15.txt | AC | 7 ms | 640 KB |
16.txt | AC | 25 ms | 2048 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 9 ms | 768 KB |
19.txt | AC | 19 ms | 1536 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 10 ms | 768 KB |
22.txt | AC | 20 ms | 1664 KB |
23.txt | AC | 18 ms | 1536 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 24 ms | 1920 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 10 ms | 896 KB |
29.txt | AC | 21 ms | 1664 KB |
30.txt | AC | 23 ms | 1920 KB |
31.txt | AC | 17 ms | 1408 KB |
32.txt | AC | 27 ms | 2176 KB |
33.txt | AC | 27 ms | 2048 KB |
34.txt | AC | 24 ms | 1920 KB |
35.txt | AC | 9 ms | 768 KB |
36.txt | AC | 26 ms | 2176 KB |
37.txt | AC | 2 ms | 256 KB |
38.txt | AC | 10 ms | 896 KB |
39.txt | AC | 20 ms | 1664 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 | 1920 KB |
46.txt | AC | 12 ms | 1024 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 22 ms | 1792 KB |
49.txt | AC | 4 ms | 384 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 |