Submission #2215803
Source Code Expand
#include<cstdio> #include<algorithm> using namespace std; #define N 220000 inline char gc(){ static char now[1<<16],*S,*T; if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;} return *S++; } #define S 1<<19 inline int read(){ int x=0,f=1;char ch=gc(); while (ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();} while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();} return x*f; } int f1[S],f2[S],n,num,bin[20],st[N],a[N],right[N][20],left[N][20],v; int main(){ // freopen("agc.in","r",stdin); n=read();v=read();int Log=0; for (int i=1;i<=n;++i) a[i]=read(); while ((1<<Log)<=v) Log++;Log++; for (int i=0;i<=Log+1;++i) bin[i]=1<<i; num=1;for (int i=2;i<=n;++i) if (a[i]-a[i-1]>v) num++; for (int j=0;j<Log;++j){ left[1][j]=1;right[n][j]=n; for (int i=2;i<=n;++i) if (a[i]-a[i-1]>(v>>j)) left[i][j]=i;else left[i][j]=left[i-1][j]; for (int i=n-1;i>=1;--i) if (a[i+1]-a[i]>(v>>j)) right[i][j]=i;else right[i][j]=right[i+1][j]; } /*for (int j=0;j<Log;++j){ for (int i=1;i<=n;++i) printf("%d ",right[i][j]);printf("\n"); for (int i=n;i>=1;--i) printf("%d ",left[i][j]);printf("\n"); }*/ if (num>Log){ for (int i=1;i<=n;++i) printf("Impossible\n");return 0; } for (int s=0;s<=bin[Log]-1;++s) {f1[s]=0,f2[s]=n+1;} for (int s=0;s<=bin[Log]-1;++s){ for (int i=0;i<Log;++i){ if (s&bin[i])continue; if (f1[s]==n) f1[s|bin[i]]=n;else f1[s|bin[i]]=max(f1[s|bin[i]],right[f1[s]+1][Log-i-1]); if (f2[s]==1) f2[s|bin[i]]=1;else f2[s|bin[i]]=min(f2[s|bin[i]],left[f2[s]-1][Log-i-1]); } }for (int i=0;i<=n;++i) st[i]=n+2; for (int s=0;s<=bin[Log-1]-1;++s){ int s1=(bin[Log-1]-1)^s; st[f1[s]]=min(st[f1[s]],f2[s1]); } for (int i=n-1;i>=0;--i) st[i]=min(st[i],st[i+1]); //for (int i=0;i<=n;++i) printf("%d ",st[i]);printf("\n"); for (int i=1;i<=n;++i){ int l=left[i][0],r=right[i][0]; if (st[l-1]<=r+1) printf("Possible\n");else printf("Impossible\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Camel and Oases |
User | elijahqi |
Language | C++ (GCC 5.4.1) |
Score | 1000 |
Code Size | 1909 Byte |
Status | AC |
Exec Time | 140 ms |
Memory | 42496 KB |
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 | 2 ms | 8320 KB |
00_example_02.txt | AC | 2 ms | 8320 KB |
00_example_03.txt | AC | 2 ms | 8320 KB |
01.txt | AC | 56 ms | 9728 KB |
02.txt | AC | 15 ms | 8320 KB |
03.txt | AC | 56 ms | 9600 KB |
04.txt | AC | 15 ms | 8448 KB |
05.txt | AC | 56 ms | 9600 KB |
06.txt | AC | 63 ms | 16128 KB |
07.txt | AC | 18 ms | 12160 KB |
08.txt | AC | 63 ms | 13440 KB |
09.txt | AC | 19 ms | 12416 KB |
10.txt | AC | 58 ms | 10624 KB |
11.txt | AC | 33 ms | 12800 KB |
12.txt | AC | 58 ms | 10752 KB |
13.txt | AC | 139 ms | 42496 KB |
14.txt | AC | 56 ms | 9600 KB |
15.txt | AC | 14 ms | 8320 KB |
16.txt | AC | 56 ms | 9600 KB |
17.txt | AC | 14 ms | 8320 KB |
18.txt | AC | 56 ms | 9600 KB |
19.txt | AC | 28 ms | 8576 KB |
20.txt | AC | 62 ms | 16128 KB |
21.txt | AC | 19 ms | 12160 KB |
22.txt | AC | 64 ms | 13824 KB |
23.txt | AC | 20 ms | 12672 KB |
24.txt | AC | 58 ms | 10752 KB |
25.txt | AC | 33 ms | 12544 KB |
26.txt | AC | 61 ms | 13824 KB |
27.txt | AC | 137 ms | 42496 KB |
28.txt | AC | 62 ms | 13952 KB |
29.txt | AC | 18 ms | 12032 KB |
30.txt | AC | 61 ms | 13824 KB |
31.txt | AC | 31 ms | 10112 KB |
32.txt | AC | 59 ms | 10752 KB |
33.txt | AC | 32 ms | 12416 KB |
34.txt | AC | 60 ms | 13312 KB |
35.txt | AC | 140 ms | 42496 KB |
36.txt | AC | 56 ms | 9600 KB |
37.txt | AC | 14 ms | 8320 KB |
38.txt | AC | 56 ms | 9600 KB |
39.txt | AC | 14 ms | 8320 KB |
40.txt | AC | 56 ms | 9600 KB |
41.txt | AC | 28 ms | 8576 KB |
42.txt | AC | 58 ms | 9600 KB |
43.txt | AC | 28 ms | 8576 KB |
44.txt | AC | 56 ms | 9600 KB |
45.txt | AC | 28 ms | 8576 KB |
46.txt | AC | 18 ms | 11904 KB |
47.txt | AC | 60 ms | 13312 KB |
48.txt | AC | 31 ms | 12160 KB |
49.txt | AC | 60 ms | 13184 KB |
50.txt | AC | 30 ms | 9984 KB |
51.txt | AC | 59 ms | 11008 KB |
52.txt | AC | 31 ms | 9984 KB |
53.txt | AC | 59 ms | 11008 KB |
54.txt | AC | 30 ms | 9984 KB |
55.txt | AC | 60 ms | 13312 KB |
56.txt | AC | 17 ms | 9472 KB |
57.txt | AC | 60 ms | 13312 KB |
58.txt | AC | 31 ms | 12160 KB |
59.txt | AC | 58 ms | 10752 KB |
60.txt | AC | 32 ms | 12288 KB |
61.txt | AC | 62 ms | 13184 KB |
62.txt | AC | 31 ms | 12160 KB |
63.txt | AC | 62 ms | 13184 KB |
64.txt | AC | 31 ms | 12288 KB |
65.txt | AC | 60 ms | 13312 KB |
66.txt | AC | 2 ms | 8320 KB |
67.txt | AC | 2 ms | 8320 KB |