Submission #2099737


Source Code Expand

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, V;
int M, SM;

int T[22][MAX_N];
int nex[22][MAX_N];

int dp[(1 << 22)], rdp[(1 << 22)];
int ok[MAX_N];

vector<ll> v;
ll A[MAX_N];

void pre(int dp[MAX_N]) {
	rep(i, 0, M) {
		rep(j, 0, N - 1) {
			T[0][j] = (abs(A[j + 1] - A[j]) > v[i]) ? j : (j + 1);
		}
		T[0][N - 1] = N - 1;
		rep(q, 0, 20) {
			rep(j, 0, N) {
				T[q + 1][j] = T[q][T[q][j]];
			}
		}
		rep(j, 0, N) {
			nex[i][j] = T[20][j];
		}
	}
	fill(dp, dp + (1 << SM), -1);
	rep(bit, 0, (1 << SM)) {
		if(dp[bit] == N - 1) continue;
		rep(i, 0, SM) {
			if(bit & (1 << i)) continue;
			MAX(dp[bit | (1 << i)], nex[i][dp[bit] + 1]);
		}
	}
	rep(bit, 0, (1 << SM)) {
		if(dp[bit] == N - 1) continue;
		dp[bit] = nex[SM][dp[bit] + 1];
	}
}

void solve() {
	cin >> N >> V;
	rep(i, 0, N) cin >> A[i];
	while(V >= 1) {
		v.pb(V);
		V /= 2;
	}
	v.pb(0);
	M = sz(v);
	SM = M - 1;

	reverse(all(v));
	
	pre(dp);

	reverse(A, A + N);
	pre(rdp);

	rep(bit, 0, (1 << SM)) rdp[bit] = N - 1 - rdp[bit];

	rep(bit, 0, (1 << SM)) {
		int rbit = (1 << SM) - 1 - bit;
		int l = dp[bit], r = rdp[rbit];
		l++;
		if(l > r) {
			ok[l]--;
			ok[r]++;
		}
	}
	rep(i, 0, N) {
		ok[i + 1] += ok[i];
		if(ok[i]) cout << "Possible\n";
		else cout << "Impossible\n";
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}

Submission Info

Submission Time
Task E - Camel and Oases
User omochana2
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 3202 Byte
Status AC
Exec Time 239 ms
Memory 42496 KB

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 6 ms 22784 KB
00_example_02.txt AC 6 ms 22784 KB
00_example_03.txt AC 6 ms 26880 KB
01.txt AC 45 ms 37120 KB
02.txt AC 17 ms 35072 KB
03.txt AC 45 ms 37120 KB
04.txt AC 17 ms 35072 KB
05.txt AC 45 ms 37120 KB
06.txt AC 74 ms 37888 KB
07.txt AC 33 ms 35584 KB
08.txt AC 64 ms 37632 KB
09.txt AC 36 ms 35712 KB
10.txt AC 54 ms 37376 KB
11.txt AC 47 ms 35712 KB
12.txt AC 57 ms 37504 KB
13.txt AC 237 ms 42496 KB
14.txt AC 45 ms 37120 KB
15.txt AC 17 ms 35072 KB
16.txt AC 45 ms 37120 KB
17.txt AC 17 ms 35072 KB
18.txt AC 45 ms 37120 KB
19.txt AC 25 ms 35072 KB
20.txt AC 70 ms 37760 KB
21.txt AC 34 ms 35584 KB
22.txt AC 66 ms 37760 KB
23.txt AC 39 ms 35712 KB
24.txt AC 57 ms 37504 KB
25.txt AC 45 ms 35584 KB
26.txt AC 67 ms 37760 KB
27.txt AC 238 ms 42496 KB
28.txt AC 69 ms 37760 KB
29.txt AC 31 ms 35584 KB
30.txt AC 68 ms 37760 KB
31.txt AC 40 ms 35456 KB
32.txt AC 56 ms 37504 KB
33.txt AC 43 ms 35584 KB
34.txt AC 62 ms 37632 KB
35.txt AC 239 ms 42496 KB
36.txt AC 45 ms 37120 KB
37.txt AC 17 ms 35072 KB
38.txt AC 45 ms 37120 KB
39.txt AC 17 ms 35072 KB
40.txt AC 46 ms 37120 KB
41.txt AC 26 ms 35072 KB
42.txt AC 46 ms 37120 KB
43.txt AC 26 ms 35072 KB
44.txt AC 45 ms 37120 KB
45.txt AC 26 ms 35072 KB
46.txt AC 31 ms 35456 KB
47.txt AC 62 ms 37632 KB
48.txt AC 41 ms 35584 KB
49.txt AC 62 ms 37504 KB
50.txt AC 39 ms 35456 KB
51.txt AC 59 ms 37504 KB
52.txt AC 39 ms 35456 KB
53.txt AC 60 ms 37504 KB
54.txt AC 40 ms 35456 KB
55.txt AC 63 ms 37632 KB
56.txt AC 28 ms 35456 KB
57.txt AC 64 ms 37632 KB
58.txt AC 42 ms 35584 KB
59.txt AC 58 ms 37376 KB
60.txt AC 43 ms 35584 KB
61.txt AC 63 ms 37632 KB
62.txt AC 41 ms 35584 KB
63.txt AC 63 ms 37632 KB
64.txt AC 43 ms 35584 KB
65.txt AC 64 ms 37632 KB
66.txt AC 6 ms 22784 KB
67.txt AC 6 ms 22784 KB