Submission #3218635
Source Code Expand
#include <iostream> #include <vector> #include <map> #include <algorithm> #include <string> #include <queue> #include <stack> #include <math.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef pair<ll, ll> P; typedef vector<int> vi; typedef vector<vi> vvi; #define REP(i, n) for (ll i = 0; i < (n); ++i) #define REPR(i, n) for (ll i = (n) - 1; i >= 0; --i) #define FOR(i, n, m) for (ll i = (n); i < (m); ++i) #define FORR(i, n, m) for (ll i = (m) - 1; i >= (n); --i) #define FORE(x, xs) for (auto &x: (xs)) #define ALL(v) v.begin(), v.end() #define ZERO(a) memset(a,0,sizeof(a)) const int INF = 1000000009; const int MOD = 1000000007; const double EPS = 1e-14; const double PI = acos(-1); const int MAX = 1e5; int N, A, B; int judge() { if (A+B == N+1) return 1; /// 幅がぴったりの時 if (A == 1 || B == 1 || A+B > N+1) return -1; /// 幅が足りない、もしくは幅が狭すぎる時 return 0; } int main() { cin >> N >> A >> B; int j = judge(); if (j == -1) { /// できなとき cout << -1 << endl; return 0; } else if (j == 1) { /// 単調増加してから単調減少数する FOR (i, B, N+1) cout << i << " "; FORR (i, 2, B) cout << i << " "; cout << 1 << endl; return 0; } else { int top = N-A+1; FOR (i, top, N+1) cout << i << " "; int bottom = B-1; FORR (i, 1, bottom+1) cout << i << " "; while (1) { if (top - bottom > 2) cout << --top << " "; else { cout << top-1 << endl; break; } if (top - bottom > 2) cout << ++bottom << " "; else { cout << bottom+1 << endl; break; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - LISDL |
User | tnyo43 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1783 Byte |
Status | WA |
Exec Time | 27 ms |
Memory | 2176 KB |
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 | 768 KB |
02.txt | WA | 2 ms | 256 KB |
03.txt | WA | 14 ms | 1152 KB |
04.txt | WA | 2 ms | 256 KB |
05.txt | WA | 24 ms | 1920 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | WA | 12 ms | 1024 KB |
09.txt | WA | 15 ms | 1280 KB |
10.txt | AC | 25 ms | 2048 KB |
11.txt | WA | 26 ms | 2048 KB |
12.txt | AC | 27 ms | 2176 KB |
13.txt | AC | 22 ms | 1792 KB |
14.txt | WA | 20 ms | 1664 KB |
15.txt | WA | 8 ms | 640 KB |
16.txt | AC | 25 ms | 2048 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 10 ms | 768 KB |
19.txt | WA | 19 ms | 1536 KB |
20.txt | WA | 1 ms | 256 KB |
21.txt | AC | 10 ms | 768 KB |
22.txt | WA | 21 ms | 1664 KB |
23.txt | WA | 19 ms | 1536 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 24 ms | 1920 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | WA | 10 ms | 896 KB |
29.txt | WA | 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 | 26 ms | 2048 KB |
34.txt | WA | 23 ms | 1920 KB |
35.txt | WA | 10 ms | 768 KB |
36.txt | AC | 26 ms | 2176 KB |
37.txt | WA | 2 ms | 256 KB |
38.txt | WA | 11 ms | 896 KB |
39.txt | WA | 21 ms | 1664 KB |
40.txt | WA | 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 | WA | 1 ms | 256 KB |
48.txt | WA | 23 ms | 1792 KB |
49.txt | WA | 4 ms | 384 KB |
50.txt | WA | 25 ms | 2048 KB |
51.txt | WA | 25 ms | 2048 KB |
52.txt | WA | 13 ms | 1024 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |