Submission #1887485


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))

#define SZ(a) (int) a.size()
#define ALL(a) a.begin(),a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;

const double PI = acos(-1.0);
const LL INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;

const int MAX = 200200;
const int MIN = 20;

int A[MAX];
VI V;

int L[MIN][MAX];
int R[MIN][MAX];

int DP1[1<<MIN];
int DP2[1<<MIN];

int main()
{
	//freopen("in.txt", "r", stdin);
	//ios::sync_with_stdio(false); cin.tie(0);

	int n, v;
	scanf("%d%d", &n, &v);

	FOR (i, 0, n)
	{
		scanf("%d", &A[i]);
	}

	while(v > 0)
	{
		V.PB(v);
		v /= 2;
	}

	V.PB(0);

	int m = SZ(V);

	FOR (it, 0, m)
	{
		int w = V[it];

		L[it][0] = 0;

		FOR (i, 1, n)
		{
			if (A[i] - A[i-1] <= w) L[it][i] = L[it][i-1];
			else L[it][i] = i;
		}

		R[it][n-1] = n-1;
		RFOR(i, n-1, 0)
		{
			if (A[i+1] - A[i] <= w) R[it][i] = R[it][i+1];
			else R[it][i] = i;
		}
	}


	FOR (mask, 0, 1<<m)
	{
		int ind = DP1[mask];

		FOR (i, 0, m)
		{
			if (mask & (1<<i)) continue;
			int nm = mask | (1<<i);
			if (ind == n)
			{
				DP1[nm] = n;
				continue;
			}

			int to = R[i][ind] + 1;

			DP1[nm] = max(DP1[nm], to);
		}
	}

	FOR (mask, 0, 1<<m)
	{
		DP2[mask] = n-1;
	}

	FOR (mask, 0, 1<<m)
	{
		int ind = DP2[mask];

		FOR (i, 0, m)
		{
			if (mask & (1<<i)) continue;
			int nm = mask | (1<<i);
			if (ind == -1)
			{
				DP2[nm] = -1;
				continue;
			}

			int to = L[i][ind] - 1;
			DP2[nm] = min(DP2[nm], to);
		}
	}

	int x = 0;
	while(x < n)
	{
		int to = R[0][x];

		bool ok = false;

		FOR (mask, 0, 1<<m)
		{
			if (mask & (1<<0)) continue;
			int m1 = mask;
			int m2 = (((1<<m)-1) - (1<<0)) ^ m1;

			if (DP1[m1] >= x && DP2[m2] <= to ) ok = true;
		}

		string res;
		if (ok) res = "Possible";
		else res = "Impossible";

		while(x <= to)
		{
			printf("%s\n", res.c_str());
			x++;
		}
	}


}

Submission Info

Submission Time
Task E - Camel and Oases
User vjudge2
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2153 Byte
Status AC
Exec Time 149 ms
Memory 42112 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &v);
                       ^
./Main.cpp:44:21: 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 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 3 ms 8448 KB
00_example_02.txt AC 3 ms 8448 KB
00_example_03.txt AC 3 ms 12544 KB
01.txt AC 99 ms 39168 KB
02.txt AC 30 ms 31488 KB
03.txt AC 103 ms 39168 KB
04.txt AC 29 ms 31488 KB
05.txt AC 91 ms 39168 KB
06.txt AC 108 ms 39552 KB
07.txt AC 35 ms 31744 KB
08.txt AC 108 ms 39424 KB
09.txt AC 34 ms 31744 KB
10.txt AC 95 ms 39296 KB
11.txt AC 58 ms 34432 KB
12.txt AC 106 ms 39296 KB
13.txt AC 149 ms 42112 KB
14.txt AC 103 ms 39168 KB
15.txt AC 31 ms 31488 KB
16.txt AC 101 ms 39168 KB
17.txt AC 30 ms 31488 KB
18.txt AC 87 ms 39168 KB
19.txt AC 52 ms 34048 KB
20.txt AC 109 ms 39552 KB
21.txt AC 34 ms 31744 KB
22.txt AC 100 ms 39424 KB
23.txt AC 35 ms 31872 KB
24.txt AC 92 ms 39296 KB
25.txt AC 52 ms 34304 KB
26.txt AC 99 ms 39424 KB
27.txt AC 143 ms 42112 KB
28.txt AC 104 ms 39552 KB
29.txt AC 34 ms 31744 KB
30.txt AC 107 ms 39552 KB
31.txt AC 53 ms 34304 KB
32.txt AC 99 ms 39296 KB
33.txt AC 59 ms 34304 KB
34.txt AC 102 ms 39424 KB
35.txt AC 147 ms 42112 KB
36.txt AC 102 ms 39168 KB
37.txt AC 32 ms 31488 KB
38.txt AC 102 ms 39168 KB
39.txt AC 30 ms 31488 KB
40.txt AC 94 ms 39168 KB
41.txt AC 52 ms 34048 KB
42.txt AC 97 ms 39168 KB
43.txt AC 49 ms 34048 KB
44.txt AC 104 ms 39168 KB
45.txt AC 48 ms 34048 KB
46.txt AC 33 ms 31744 KB
47.txt AC 105 ms 39424 KB
48.txt AC 53 ms 34304 KB
49.txt AC 98 ms 39424 KB
50.txt AC 54 ms 34304 KB
51.txt AC 102 ms 39296 KB
52.txt AC 54 ms 34304 KB
53.txt AC 109 ms 39424 KB
54.txt AC 52 ms 34304 KB
55.txt AC 102 ms 39424 KB
56.txt AC 33 ms 31616 KB
57.txt AC 100 ms 39424 KB
58.txt AC 53 ms 34304 KB
59.txt AC 101 ms 39296 KB
60.txt AC 54 ms 34304 KB
61.txt AC 102 ms 39424 KB
62.txt AC 54 ms 34304 KB
63.txt AC 106 ms 39424 KB
64.txt AC 53 ms 34304 KB
65.txt AC 103 ms 39424 KB
66.txt AC 3 ms 8448 KB
67.txt AC 2 ms 8448 KB