Submission #1256655
Source Code Expand
#include<bits/stdc++.h> using namespace std; int n, v, lg, a[200005]; struct oneside { int rb[18][200005], dt[1<<18]; int solve () { int cv = v; for(int i=0;i<=lg;i++,cv/=2) { int un = 1; for(int j=1;j<n;j++) { if(a[j+1] - a[j] > cv) { for(int k=un;k<=j;k++) rb[i][k] = j; un = j+1; } } for(int k=un;k<=n;k++) rb[i][k] = n; } for(int i=0;i<(1<<lg);i++) { for(int j=1;j<=lg;j++) { int t = (1<<(j-1)); if(i & t) continue; dt[i|t] = max(dt[i|t], rb[j][min(dt[i]+1, n)]); } } } } ls, rs; struct segtree { int val[888888], lim; void init () { for(lim = 1; lim <= n; lim <<= 1); } void update (int S, int E, int X) { S += lim; E += lim; while(S<=E) { if(S%2 == 1) val[S] += X, S++; if(E%2 == 0) val[E] += X, E--; S>>=1; E>>=1; } } int query (int P) { P += lim; int ret = 0; while(P) { ret += val[P]; P>>=1; } return ret; } } seg; int main() { scanf("%d%d",&n,&v); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } for(int i=v;i;i/=2,lg++); ls.solve(); reverse(a+1, a+1+n); for(int i=1;i<=n;i++) a[i] *= -1; rs.solve(); seg.init(); for(int i=0;i<(1<<lg);i++) { int t = ((1<<lg)-1)^i; if(ls.dt[i] + 1 > n - rs.dt[t]) { for(int j=1;j<=n;j++) puts("Possible"); return 0; } else { int ss = n - rs.rb[0][min(n, rs.dt[t]+1)] + 1, se = ls.rb[0][min(n, ls.dt[i]+1)]; if(ss <= se) seg.update(ss, se, 1); } } for(int i=1;i<=n;i++) { puts(seg.query(i) ? "Possible" : "Impossible"); } }
Submission Info
Submission Time | |
---|---|
Task | E - Camel and Oases |
User | khsoo01 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1585 Byte |
Status | WA |
Exec Time | 86 ms |
Memory | 34432 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:55:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&v); ^ ./Main.cpp:57:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 4 ms | 14592 KB |
01.txt | WA | 47 ms | 31872 KB |
02.txt | AC | 17 ms | 31104 KB |
03.txt | WA | 47 ms | 31872 KB |
04.txt | AC | 17 ms | 31104 KB |
05.txt | WA | 47 ms | 31872 KB |
06.txt | WA | 53 ms | 32256 KB |
07.txt | AC | 21 ms | 31360 KB |
08.txt | WA | 51 ms | 32128 KB |
09.txt | AC | 22 ms | 31488 KB |
10.txt | WA | 49 ms | 32000 KB |
11.txt | AC | 32 ms | 31744 KB |
12.txt | WA | 49 ms | 32000 KB |
13.txt | WA | 84 ms | 34432 KB |
14.txt | WA | 47 ms | 31872 KB |
15.txt | AC | 17 ms | 31104 KB |
16.txt | WA | 47 ms | 31872 KB |
17.txt | AC | 17 ms | 31104 KB |
18.txt | AC | 47 ms | 31872 KB |
19.txt | AC | 27 ms | 31360 KB |
20.txt | WA | 52 ms | 32128 KB |
21.txt | AC | 21 ms | 31360 KB |
22.txt | WA | 51 ms | 32128 KB |
23.txt | AC | 22 ms | 31488 KB |
24.txt | AC | 49 ms | 32000 KB |
25.txt | AC | 31 ms | 31616 KB |
26.txt | WA | 51 ms | 32128 KB |
27.txt | WA | 84 ms | 34432 KB |
28.txt | WA | 52 ms | 32256 KB |
29.txt | AC | 21 ms | 31360 KB |
30.txt | WA | 52 ms | 32128 KB |
31.txt | AC | 30 ms | 31616 KB |
32.txt | WA | 49 ms | 32000 KB |
33.txt | AC | 31 ms | 31616 KB |
34.txt | WA | 50 ms | 32128 KB |
35.txt | WA | 86 ms | 34432 KB |
36.txt | WA | 47 ms | 31872 KB |
37.txt | AC | 17 ms | 31104 KB |
38.txt | WA | 47 ms | 31872 KB |
39.txt | AC | 17 ms | 31104 KB |
40.txt | AC | 47 ms | 31872 KB |
41.txt | AC | 27 ms | 31360 KB |
42.txt | AC | 47 ms | 31872 KB |
43.txt | AC | 27 ms | 31360 KB |
44.txt | WA | 47 ms | 31872 KB |
45.txt | AC | 27 ms | 31360 KB |
46.txt | AC | 20 ms | 31360 KB |
47.txt | WA | 50 ms | 32128 KB |
48.txt | AC | 30 ms | 31616 KB |
49.txt | WA | 50 ms | 32128 KB |
50.txt | AC | 30 ms | 31616 KB |
51.txt | WA | 49 ms | 32000 KB |
52.txt | AC | 30 ms | 31616 KB |
53.txt | WA | 50 ms | 32000 KB |
54.txt | AC | 30 ms | 31616 KB |
55.txt | WA | 50 ms | 32128 KB |
56.txt | AC | 20 ms | 31360 KB |
57.txt | AC | 50 ms | 32128 KB |
58.txt | AC | 31 ms | 31616 KB |
59.txt | WA | 49 ms | 32000 KB |
60.txt | AC | 30 ms | 31616 KB |
61.txt | WA | 50 ms | 32000 KB |
62.txt | AC | 30 ms | 31616 KB |
63.txt | WA | 50 ms | 32128 KB |
64.txt | AC | 30 ms | 31616 KB |
65.txt | WA | 50 ms | 32128 KB |
66.txt | AC | 3 ms | 10496 KB |
67.txt | AC | 3 ms | 10496 KB |