Submission #1688690
Source Code Expand
#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <map> using namespace std; typedef long long LL; const int maxn = 550005; int x[maxn],l[maxn][19],r[maxn][19],n,V; int dpl[maxn],dpr[maxn],pos[maxn]; bool upd(int &x,int y) {x>y?x=y:0;} int main() { #ifdef Amberframe freopen("agc012e.in","r",stdin); freopen("agc012e.out","w",stdout); #endif scanf("%d %d",&n,&V); int k=0;while (V>>k) ++k;++k; for (int i=1;i<=n;i++) scanf("%d",&x[i]); for (int i=1;i<=n;i++) for (int j=0;j<k;j++) { if (i==1||x[i]-x[i-1]>(V>>j)) l[i][j]=i; else l[i][j]=l[i-1][j]; } for (int i=n;i>=1;i--) for (int j=0;j<k;j++) { if (i==n||x[i+1]-x[i]>(V>>j)) r[i][j]=i; else r[i][j]=r[i+1][j]; } int S=((1<<k)-1)^1; for (int i=1;i<(1<<k);i+=2) { dpl[i]=0;dpr[i]=n+1; for (int j=1;j<k;j++) if (i>>j&1) { dpl[i]=max(dpl[i],r[dpl[i^(1<<j)]+1][j]); dpr[i]=min(dpr[i],l[dpr[i^(1<<j)]-1][j]); } } for (int i=1;i<=n+1;i++) pos[i]=n+1; for (int i=1;i<(1<<k);i+=2) upd(pos[dpl[i]+1],dpr[S^i]-1); for (int i=n;i>=1;i--) upd(pos[i],pos[i+1]); for (int i=1;i<=n;i++) printf("%s\n",pos[l[i][0]]<=r[i][0]?"Possible":"Impossible"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Camel and Oases |
User | Amberframe |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1240 Byte |
Status | AC |
Exec Time | 74 ms |
Memory | 42112 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&n,&V); ^ ./Main.cpp:22:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i=1;i<=n;i++) scanf("%d",&x[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 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, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 3 ms | 10496 KB |
00_example_02.txt | AC | 3 ms | 10496 KB |
00_example_03.txt | AC | 3 ms | 10496 KB |
01.txt | AC | 25 ms | 10496 KB |
02.txt | AC | 8 ms | 10496 KB |
03.txt | AC | 25 ms | 10496 KB |
04.txt | AC | 8 ms | 10496 KB |
05.txt | AC | 25 ms | 10496 KB |
06.txt | AC | 32 ms | 14976 KB |
07.txt | AC | 12 ms | 10752 KB |
08.txt | AC | 29 ms | 10752 KB |
09.txt | AC | 12 ms | 10752 KB |
10.txt | AC | 27 ms | 10624 KB |
11.txt | AC | 18 ms | 10880 KB |
12.txt | AC | 28 ms | 10624 KB |
13.txt | AC | 74 ms | 42112 KB |
14.txt | AC | 25 ms | 10624 KB |
15.txt | AC | 8 ms | 10496 KB |
16.txt | AC | 25 ms | 10496 KB |
17.txt | AC | 8 ms | 10496 KB |
18.txt | AC | 25 ms | 10496 KB |
19.txt | AC | 14 ms | 10496 KB |
20.txt | AC | 31 ms | 14976 KB |
21.txt | AC | 12 ms | 10752 KB |
22.txt | AC | 30 ms | 10752 KB |
23.txt | AC | 14 ms | 14976 KB |
24.txt | AC | 28 ms | 10624 KB |
25.txt | AC | 18 ms | 10752 KB |
26.txt | AC | 30 ms | 10752 KB |
27.txt | AC | 71 ms | 42112 KB |
28.txt | AC | 31 ms | 12928 KB |
29.txt | AC | 12 ms | 10752 KB |
30.txt | AC | 31 ms | 12928 KB |
31.txt | AC | 17 ms | 10752 KB |
32.txt | AC | 28 ms | 10624 KB |
33.txt | AC | 17 ms | 10752 KB |
34.txt | AC | 29 ms | 10752 KB |
35.txt | AC | 71 ms | 42112 KB |
36.txt | AC | 25 ms | 10496 KB |
37.txt | AC | 8 ms | 10496 KB |
38.txt | AC | 25 ms | 10496 KB |
39.txt | AC | 8 ms | 10496 KB |
40.txt | AC | 25 ms | 10496 KB |
41.txt | AC | 14 ms | 10496 KB |
42.txt | AC | 25 ms | 10496 KB |
43.txt | AC | 13 ms | 10496 KB |
44.txt | AC | 25 ms | 10496 KB |
45.txt | AC | 14 ms | 10496 KB |
46.txt | AC | 11 ms | 10752 KB |
47.txt | AC | 28 ms | 10752 KB |
48.txt | AC | 17 ms | 10752 KB |
49.txt | AC | 28 ms | 10752 KB |
50.txt | AC | 16 ms | 10752 KB |
51.txt | AC | 28 ms | 10752 KB |
52.txt | AC | 16 ms | 10752 KB |
53.txt | AC | 28 ms | 10752 KB |
54.txt | AC | 16 ms | 10752 KB |
55.txt | AC | 28 ms | 10752 KB |
56.txt | AC | 10 ms | 10624 KB |
57.txt | AC | 28 ms | 10752 KB |
58.txt | AC | 17 ms | 10752 KB |
59.txt | AC | 29 ms | 10624 KB |
60.txt | AC | 17 ms | 10752 KB |
61.txt | AC | 28 ms | 10752 KB |
62.txt | AC | 16 ms | 10752 KB |
63.txt | AC | 28 ms | 10752 KB |
64.txt | AC | 17 ms | 10752 KB |
65.txt | AC | 29 ms | 10752 KB |
66.txt | AC | 3 ms | 10496 KB |
67.txt | AC | 3 ms | 10496 KB |