Submission #1256841
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pp; typedef pair<ll,ll> pll; void read(int& x){ scanf("%d",&x); } void read(ll& x){ scanf("%lld",&x); } template<typename T,typename... Args> void read(T& a,Args&... b){ read(a); read(b...); } #define all(x) (x).begin(),(x).end() #define pb push_back #define x first #define y second int n, v; int x[200010]; int hn; int gl[20][200010]; int gr[20][200010]; void in(){ read(n, v); for(int i=1; i<=n; ++i) read(x[i]); } void build(){ for(;;++hn, v/=2){ for(int i=1; i<=n;){ int j; for(j=i+1; j<=n && x[j]-x[j-1] <= v; ++j); for(int k=i; k<j; ++k){ gl[hn][k]=i; gr[hn][k]=j-1; } i=j; } if(v == 0) break; } } int dpL[524288]; int dpR[524288]; void do_dp(){ int M = (1<<hn); for(int i=0; i<M; ++i){ dpL[i] = 0; dpR[i] = n+1; for(int j=1; j<=hn; ++j){ int key = (1 << (j-1)); if(i & key){ int bl=dpL[i^key], br=dpR[i^key]; dpL[i] = max(dpL[i], bl == n ? n : gr[j][bl+1]); dpR[i] = min(dpR[i], br == 1 ? 1 : gl[j][br-1]); } } } } bool all_yes; bool yes[200010]; void apply_gugan(int a, int b){ if(a > b){ all_yes = true; } else { if(gl[0][a] == gl[0][b]){ yes[gl[0][a]]=1; } } } void Fill(){ int M = (1<<hn); for(int i=1; i<M; ++i){ dpL[i] = max(dpL[i], dpL[i&(i-1)]); dpR[i] = min(dpR[i], dpR[i&(i-1)]); } for(int i=0; i<M; ++i){ int l=dpL[i]+1; int r=dpR[(M-1)^i]-1; apply_gugan(l, r); } } int main() { in(); build(); do_dp(); Fill(); for(int i=1; i<=n; ++i){ puts((all_yes || yes[gl[0][i]])?"Possible":"Impossible"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Camel and Oases |
User | Namnamseo |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1723 Byte |
Status | AC |
Exec Time | 69 ms |
Memory | 36992 KB |
Compile Error
./Main.cpp: In function ‘void read(int&)’: ./Main.cpp:6:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(int& x){ scanf("%d",&x); } ^ ./Main.cpp: In function ‘void read(ll&)’: ./Main.cpp:7:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(ll& x){ scanf("%lld",&x); } ^
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 | 3 ms | 8448 KB |
00_example_03.txt | AC | 4 ms | 14592 KB |
01.txt | AC | 32 ms | 34048 KB |
02.txt | AC | 13 ms | 31232 KB |
03.txt | AC | 32 ms | 34048 KB |
04.txt | AC | 13 ms | 31232 KB |
05.txt | AC | 32 ms | 34048 KB |
06.txt | AC | 38 ms | 34432 KB |
07.txt | AC | 16 ms | 31488 KB |
08.txt | AC | 36 ms | 34304 KB |
09.txt | AC | 17 ms | 31616 KB |
10.txt | AC | 34 ms | 34176 KB |
11.txt | AC | 24 ms | 33920 KB |
12.txt | AC | 34 ms | 34176 KB |
13.txt | AC | 68 ms | 36992 KB |
14.txt | AC | 32 ms | 34048 KB |
15.txt | AC | 13 ms | 31232 KB |
16.txt | AC | 32 ms | 34048 KB |
17.txt | AC | 13 ms | 31232 KB |
18.txt | AC | 32 ms | 34048 KB |
19.txt | AC | 20 ms | 33536 KB |
20.txt | AC | 37 ms | 34432 KB |
21.txt | AC | 16 ms | 31488 KB |
22.txt | AC | 36 ms | 34432 KB |
23.txt | AC | 18 ms | 31616 KB |
24.txt | AC | 34 ms | 34176 KB |
25.txt | AC | 24 ms | 33792 KB |
26.txt | AC | 36 ms | 34432 KB |
27.txt | AC | 68 ms | 36992 KB |
28.txt | AC | 37 ms | 34432 KB |
29.txt | AC | 16 ms | 31488 KB |
30.txt | AC | 37 ms | 34432 KB |
31.txt | AC | 23 ms | 33792 KB |
32.txt | AC | 34 ms | 34176 KB |
33.txt | AC | 24 ms | 33792 KB |
34.txt | AC | 36 ms | 34304 KB |
35.txt | AC | 69 ms | 36992 KB |
36.txt | AC | 32 ms | 34048 KB |
37.txt | AC | 13 ms | 31232 KB |
38.txt | AC | 32 ms | 34048 KB |
39.txt | AC | 13 ms | 31232 KB |
40.txt | AC | 32 ms | 34048 KB |
41.txt | AC | 20 ms | 33536 KB |
42.txt | AC | 34 ms | 34048 KB |
43.txt | AC | 20 ms | 33536 KB |
44.txt | AC | 32 ms | 34048 KB |
45.txt | AC | 20 ms | 33536 KB |
46.txt | AC | 16 ms | 31488 KB |
47.txt | AC | 35 ms | 34304 KB |
48.txt | AC | 23 ms | 33792 KB |
49.txt | AC | 35 ms | 34304 KB |
50.txt | AC | 22 ms | 33792 KB |
51.txt | AC | 35 ms | 34304 KB |
52.txt | AC | 22 ms | 33792 KB |
53.txt | AC | 35 ms | 34304 KB |
54.txt | AC | 23 ms | 33792 KB |
55.txt | AC | 35 ms | 34304 KB |
56.txt | AC | 15 ms | 31360 KB |
57.txt | AC | 36 ms | 34304 KB |
58.txt | AC | 23 ms | 33792 KB |
59.txt | AC | 34 ms | 34176 KB |
60.txt | AC | 23 ms | 33792 KB |
61.txt | AC | 35 ms | 34304 KB |
62.txt | AC | 23 ms | 33792 KB |
63.txt | AC | 35 ms | 34304 KB |
64.txt | AC | 23 ms | 33792 KB |
65.txt | AC | 35 ms | 34304 KB |
66.txt | AC | 3 ms | 8448 KB |
67.txt | AC | 3 ms | 8448 KB |