Submission #1197313


Source Code Expand

#include <bits/stdc++.h>

#define FI(i,a,b) for(int i=(a);i<=(b);i++)
#define FD(i,a,b) for(int i=(a);i>=(b);i--)

#define LL long long
#define Ldouble long double
#define PI 3.1415926535897932384626

#define PII pair<int,int>
#define PLL pair<LL,LL>
#define mp make_pair
#define fi first
#define se second

using namespace std;

int n, v, s[200005], pt, previous_pt = 1, p;
int fr[200005][20], dv[20];

void gen(int l, int r, int V){
//	printf("[%d %d %d]\n", l, r, V);
	FI(i, l, r){
		if(V) printf("Possible\n");
		else printf("Impossible\n");
	}
	return;
}

int dp[1111111];

bool res(int X){
	FI(i, 0, (1 << p + 1) - 1) dp[i] = -1;
	dp[0] = 0;
	FI(i, 0, (1 << p + 1) - 1){
		if(dp[i] == -1) continue;
		FI(j, 0, p){
			if(i & (1 << j)){}
			else{
				if(j == 0 && dp[i] + 1 != X) continue;
				if(j != 0 && dp[i] + 1 == X) continue;
				dp[i + (1 << j)] = max(dp[i + (1 << j)], fr[dp[i] + 1][j]);
			}
		}
	}
	FI(i, 0, (1 << p + 1) - 1) if(dp[i] == n) return true;
	return false;
}

int main(){
	scanf("%d %d", &n, &v);
	FI(i, 1, n) scanf("%d", &s[i]);
	FI(i, 2, n) if(s[i] - s[i - 1] > v) pt++;
	
	dv[0] = v;
	while(dv[p]){
		dv[p + 1] = dv[p];
		dv[++p] /= 2;
	}
	
	FI(i, 0, p){
		int q = 1;
		FI(j, 1, n){
			q = max(q, j);
			while(q < n && s[q + 1] - s[q] <= dv[i]) q++;
			fr[j][i] = q;
		}
		fr[n + 1][i] = n;
	}
	
	if(pt >= 20){
		FI(i, 1, n) printf("Impossible\n");
		return 0;
	}
	FI(i, 2, n) if(s[i] - s[i - 1] > v){
		gen(previous_pt, i - 1, res(previous_pt));
		previous_pt = i;
	}
	gen(previous_pt, n, res(previous_pt));
	return 0;
}

Submission Info

Submission Time
Task E - Camel and Oases
User alex20030190
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1633 Byte
Status AC
Exec Time 434 ms
Memory 23168 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &v);
                        ^
./Main.cpp:52:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  FI(i, 1, n) scanf("%d", &s[i]);
                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 70
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 4352 KB
00_example_02.txt AC 2 ms 4352 KB
00_example_03.txt AC 2 ms 4352 KB
01.txt AC 357 ms 8448 KB
02.txt AC 68 ms 4864 KB
03.txt AC 275 ms 8448 KB
04.txt AC 74 ms 4864 KB
05.txt AC 126 ms 8448 KB
06.txt AC 379 ms 10752 KB
07.txt AC 81 ms 4992 KB
08.txt AC 301 ms 8576 KB
09.txt AC 80 ms 5120 KB
10.txt AC 148 ms 8576 KB
11.txt AC 173 ms 7680 KB
12.txt AC 220 ms 8576 KB
13.txt AC 390 ms 23168 KB
14.txt AC 388 ms 8448 KB
15.txt AC 74 ms 4864 KB
16.txt AC 295 ms 8448 KB
17.txt AC 79 ms 4864 KB
18.txt AC 164 ms 8448 KB
19.txt AC 167 ms 5376 KB
20.txt AC 373 ms 10752 KB
21.txt AC 68 ms 4992 KB
22.txt AC 260 ms 8704 KB
23.txt AC 83 ms 7168 KB
24.txt AC 249 ms 8576 KB
25.txt AC 168 ms 5632 KB
26.txt AC 255 ms 8704 KB
27.txt AC 421 ms 23168 KB
28.txt AC 331 ms 10752 KB
29.txt AC 86 ms 4992 KB
30.txt AC 338 ms 10752 KB
31.txt AC 166 ms 5504 KB
32.txt AC 247 ms 8576 KB
33.txt AC 173 ms 5632 KB
34.txt AC 255 ms 8576 KB
35.txt AC 434 ms 23168 KB
36.txt AC 358 ms 8448 KB
37.txt AC 81 ms 4864 KB
38.txt AC 331 ms 8448 KB
39.txt AC 81 ms 4864 KB
40.txt AC 245 ms 8448 KB
41.txt AC 170 ms 5376 KB
42.txt AC 292 ms 8448 KB
43.txt AC 161 ms 5376 KB
44.txt AC 363 ms 8448 KB
45.txt AC 142 ms 5376 KB
46.txt AC 82 ms 4992 KB
47.txt AC 361 ms 8576 KB
48.txt AC 169 ms 5504 KB
49.txt AC 260 ms 8576 KB
50.txt AC 173 ms 5504 KB
51.txt AC 346 ms 8576 KB
52.txt AC 160 ms 5504 KB
53.txt AC 370 ms 8576 KB
54.txt AC 165 ms 5504 KB
55.txt AC 312 ms 8576 KB
56.txt AC 80 ms 4992 KB
57.txt AC 298 ms 8576 KB
58.txt AC 158 ms 5504 KB
59.txt AC 302 ms 8576 KB
60.txt AC 172 ms 5504 KB
61.txt AC 308 ms 8576 KB
62.txt AC 150 ms 5504 KB
63.txt AC 334 ms 8576 KB
64.txt AC 160 ms 5504 KB
65.txt AC 327 ms 8576 KB
66.txt AC 2 ms 4352 KB
67.txt AC 2 ms 4352 KB