Submission #1240794


Source Code Expand

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

#define MAX 200002

int n;
int v;

vector<int> vv;

int dp[MAX][20];
int val[MAX];



map<int, vector<int> > mp;

vector<vector<int> > V;


vector<int> VV;

int mx = 0;

int D[1 << 17];
bool ok(){
	if (VV.size() == 0){
		return true;
	}
	int N = VV.size();
	for (int i = 1; i <= mx; i++){
		dp[N - 1][i] = N - 1;
	}
	for (int i = N - 2; i >= 0; i--){
		long long int d = VV[i + 1] - VV[i];
		for (int j = 1; j <= mx; j++){
			if (d <= val[j]){
				dp[i][j] = dp[i + 1][j];
			}
			else{
				dp[i][j] = i;
			}
		}
	}
	memset(D, 0, sizeof(D));
	for (int i = 0; i < (1 << mx); i++){
		if (D[i] >= N){
			return true;
		}
		for (int j = 1; j <= mx; j++){
			if ((i >> (j - 1)) & 1)continue;
			int go = i | (1 << (j - 1));
			D[go] = max(D[go], dp[D[i]][j]+1);
		}
	}
	return false;
}
bool ans[MAX];

int main(){
	cin >> n >> v;
	for (int i = 0; i < n; i++){
		int x;
		scanf("%d", &x);
		vv.push_back(x);
	}
	
	val[0] = v;
	for (mx = 1; v / 2 >= 0; mx++){
		v /= 2;
		val[mx] = v;
		if (v == 0)break;
	}
	for (int i = 0; i <= mx; i++){
		dp[n - 1][i] = n-1;
	}
	for (int i = n - 2; i >= 0; i--){
		long long int d = vv[i + 1] - vv[i];
		for (int j = 0; j <= mx; j++){
			if (d <= val[j]){
				dp[i][j] = dp[i + 1][j];
			}
			else{
				dp[i][j] = i;
			}
		}
	}
	for (int i = 0; i < n; i++){
		mp[dp[i][0]].push_back(i);
	}
	if (mp.size()>mx+1){
		
	}
	else{
		for (auto it = mp.begin(); it != mp.end(); it++){
			VV.clear();
			for (int i = 0; i < n; i++){
				if (i < (*it).second[0] || (*it).second.back() < i){
					VV.push_back(vv[i]);
				}
			}
			if (ok()){
				vector<int> &vvv = (*it).second;
				for (int j = 0; j < vvv.size(); j++){
					ans[vvv[j]] = true;
				}
			}
		}
	}
	for (int i = 0; i < n; i++){
		if (ans[i] == true){
			puts("Possible");
		}
		else{
			puts("Impossible");
		}
	}
	return 0;
}

Submission Info

Submission Time
Task E - Camel and Oases
User Kmcode
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2028 Byte
Status RE
Exec Time 152 ms
Memory 19476 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:66:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 3
AC × 34
RE × 36
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 1 ms 768 KB
00_example_02.txt AC 1 ms 768 KB
00_example_03.txt AC 1 ms 768 KB
01.txt RE 106 ms 1280 KB
02.txt AC 56 ms 768 KB
03.txt RE 105 ms 1280 KB
04.txt AC 46 ms 768 KB
05.txt RE 106 ms 1280 KB
06.txt RE 110 ms 4352 KB
07.txt AC 72 ms 3968 KB
08.txt RE 121 ms 8320 KB
09.txt AC 55 ms 3968 KB
10.txt RE 108 ms 4096 KB
11.txt AC 145 ms 4096 KB
12.txt RE 108 ms 4096 KB
13.txt RE 142 ms 19460 KB
14.txt RE 105 ms 1280 KB
15.txt AC 64 ms 768 KB
16.txt RE 109 ms 1280 KB
17.txt AC 28 ms 768 KB
18.txt RE 97 ms 768 KB
19.txt AC 142 ms 768 KB
20.txt RE 110 ms 4352 KB
21.txt AC 55 ms 3968 KB
22.txt RE 110 ms 4352 KB
23.txt AC 60 ms 4096 KB
24.txt RE 100 ms 3584 KB
25.txt AC 120 ms 3968 KB
26.txt RE 110 ms 4352 KB
27.txt RE 142 ms 19476 KB
28.txt RE 151 ms 8448 KB
29.txt AC 74 ms 3968 KB
30.txt RE 111 ms 4352 KB
31.txt AC 111 ms 3840 KB
32.txt RE 111 ms 4096 KB
33.txt AC 152 ms 3968 KB
34.txt RE 111 ms 4224 KB
35.txt RE 145 ms 19460 KB
36.txt RE 108 ms 1280 KB
37.txt AC 66 ms 768 KB
38.txt RE 106 ms 1280 KB
39.txt AC 66 ms 768 KB
40.txt RE 98 ms 768 KB
41.txt AC 142 ms 768 KB
42.txt RE 100 ms 896 KB
43.txt AC 134 ms 768 KB
44.txt RE 106 ms 1280 KB
45.txt AC 85 ms 768 KB
46.txt AC 59 ms 3840 KB
47.txt RE 122 ms 8320 KB
48.txt AC 150 ms 3840 KB
49.txt RE 101 ms 3712 KB
50.txt AC 149 ms 3712 KB
51.txt RE 110 ms 4096 KB
52.txt AC 141 ms 3840 KB
53.txt RE 108 ms 4096 KB
54.txt AC 141 ms 3840 KB
55.txt RE 132 ms 8320 KB
56.txt AC 50 ms 3712 KB
57.txt RE 101 ms 3712 KB
58.txt AC 136 ms 3840 KB
59.txt RE 101 ms 3584 KB
60.txt AC 151 ms 3968 KB
61.txt RE 109 ms 4096 KB
62.txt AC 133 ms 3840 KB
63.txt RE 110 ms 4224 KB
64.txt AC 142 ms 3968 KB
65.txt RE 118 ms 8320 KB
66.txt AC 1 ms 768 KB
67.txt AC 1 ms 768 KB