Submission #1483611
Source Code Expand
// This amazing code is by Eric Sunli Chen. #include <algorithm> #include <bitset> #include <cmath> #include <cstring> #include <cstdio> #include <cstdlib> #include <ctime> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <utility> #include <vector> using namespace std; template<typename T> void get_int(T &x) { char t=getchar(); bool neg=false; x=0; for(; (t>'9'||t<'0')&&t!='-'; t=getchar()); if(t=='-')neg=true,t=getchar(); for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0'; if(neg)x=-x; } template<typename T> void print_int(T x) { if(x<0)putchar('-'),x=-x; short a[20]= {},sz=0; while(x>0)a[sz++]=x%10,x/=10; if(sz==0)putchar('0'); for(int i=sz-1; i>=0; i--)putchar('0'+a[i]); } #define ff first #define ss second #define pb push_back #define mp make_pair #define get1(a) get_int(a) #define get2(a,b) get1(a),get1(b) #define get3(a,b,c) get1(a),get2(b,c) #define printendl(a) print_int(a),puts("") typedef long long LL; typedef unsigned long long uLL; typedef pair<int,int> pii; const int inf=0x3f3f3f3f; const LL Linf=1ll<<61; const double pi=acos(-1.0); int n,v,a[200111],nxt[20][200111],pre[20][200111],k,v2[20],dp1[1<<20],dp2[1<<20]; bool ans[200111]; int main() { get2(n,v); int tmp=v; while(tmp) { v2[k++]=tmp; tmp>>=1; } v2[k++]=0;reverse(v2,v2+k); for(int i=1;i<=n;i++)get1(a[i]); for(int i=0;i<k;i++) { nxt[i][n+1]=n+1;pre[i][0]=0; for(int j=1,j2;j<=n;j=j2) { j2=j+1; while(j2<=n&&a[j2]-a[j2-1]<=v2[i])j2++; for(int t=j;t<j2;t++) { nxt[i][t]=j2; pre[i][t]=j-1; } } } for(int i=0;i<(1<<k-1);i++) { dp1[i]=1; dp2[i]=n; } for(int i=0;i<(1<<k-1);i++) { for(int j=0;j<k-1;j++)if(((i>>j)&1)==0) { dp1[i^(1<<j)]=max(dp1[i^(1<<j)],nxt[j][dp1[i]]); dp2[i^(1<<j)]=min(dp2[i^(1<<j)],pre[j][dp2[i]]); } } if(dp1[(1<<k-1)-1]==n+1) { for(int i=1;i<=n;i++)puts("Possible"); return 0; } int all=(1<<k-1)-1; for(int i=0;i<(1<<k-1);i++)if(dp2[all^i]<nxt[k-1][dp1[i]])ans[dp1[i]]=1; for(int i=1;i<=n;i=nxt[k-1][i]) { for(int j=i;j<nxt[k-1][i];j++) { if(ans[i])puts("Possible"); else puts("Impossible"); } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Camel and Oases |
User | OhWeOnFire |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 2291 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 36992 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 | 3 ms | 8448 KB |
00_example_02.txt | AC | 2 ms | 8448 KB |
00_example_03.txt | AC | 4 ms | 14592 KB |
01.txt | AC | 27 ms | 34048 KB |
02.txt | AC | 12 ms | 31232 KB |
03.txt | AC | 27 ms | 34048 KB |
04.txt | AC | 12 ms | 31232 KB |
05.txt | AC | 27 ms | 34048 KB |
06.txt | AC | 32 ms | 34432 KB |
07.txt | AC | 14 ms | 31488 KB |
08.txt | AC | 29 ms | 34304 KB |
09.txt | AC | 15 ms | 31616 KB |
10.txt | AC | 28 ms | 34176 KB |
11.txt | AC | 20 ms | 33920 KB |
12.txt | AC | 29 ms | 34176 KB |
13.txt | AC | 58 ms | 36992 KB |
14.txt | AC | 27 ms | 34048 KB |
15.txt | AC | 12 ms | 31232 KB |
16.txt | AC | 28 ms | 34048 KB |
17.txt | AC | 11 ms | 31232 KB |
18.txt | AC | 27 ms | 34048 KB |
19.txt | AC | 16 ms | 33536 KB |
20.txt | AC | 31 ms | 34432 KB |
21.txt | AC | 13 ms | 31488 KB |
22.txt | AC | 31 ms | 34432 KB |
23.txt | AC | 15 ms | 31616 KB |
24.txt | AC | 29 ms | 34176 KB |
25.txt | AC | 19 ms | 33792 KB |
26.txt | AC | 30 ms | 34432 KB |
27.txt | AC | 55 ms | 36992 KB |
28.txt | AC | 31 ms | 34432 KB |
29.txt | AC | 14 ms | 31488 KB |
30.txt | AC | 31 ms | 34432 KB |
31.txt | AC | 19 ms | 33792 KB |
32.txt | AC | 29 ms | 34176 KB |
33.txt | AC | 19 ms | 33792 KB |
34.txt | AC | 30 ms | 34304 KB |
35.txt | AC | 57 ms | 36992 KB |
36.txt | AC | 27 ms | 34048 KB |
37.txt | AC | 11 ms | 31232 KB |
38.txt | AC | 27 ms | 34048 KB |
39.txt | AC | 11 ms | 31232 KB |
40.txt | AC | 27 ms | 34048 KB |
41.txt | AC | 16 ms | 33536 KB |
42.txt | AC | 27 ms | 34048 KB |
43.txt | AC | 16 ms | 33536 KB |
44.txt | AC | 27 ms | 34048 KB |
45.txt | AC | 16 ms | 33536 KB |
46.txt | AC | 13 ms | 31488 KB |
47.txt | AC | 29 ms | 34304 KB |
48.txt | AC | 18 ms | 33792 KB |
49.txt | AC | 29 ms | 34304 KB |
50.txt | AC | 18 ms | 33792 KB |
51.txt | AC | 29 ms | 34304 KB |
52.txt | AC | 18 ms | 33792 KB |
53.txt | AC | 29 ms | 34304 KB |
54.txt | AC | 18 ms | 33792 KB |
55.txt | AC | 30 ms | 34304 KB |
56.txt | AC | 12 ms | 31360 KB |
57.txt | AC | 29 ms | 34304 KB |
58.txt | AC | 19 ms | 33792 KB |
59.txt | AC | 28 ms | 34176 KB |
60.txt | AC | 19 ms | 33792 KB |
61.txt | AC | 29 ms | 34304 KB |
62.txt | AC | 19 ms | 33792 KB |
63.txt | AC | 29 ms | 34304 KB |
64.txt | AC | 18 ms | 33792 KB |
65.txt | AC | 30 ms | 34304 KB |
66.txt | AC | 3 ms | 8448 KB |
67.txt | AC | 3 ms | 8448 KB |