oj.uz

Submission #56590

# Submission time Handle Problem Language Result Execution time Memory
56590 2018-07-11T23:18:06 Z Xellos Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 645 ms 66560 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890123456789LL
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
 
typedef long long cat;
 
#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif
 
int cost_arr[2][1<<19];
int cost[1<<20];
int ans[1000000];
cat query[1000000];

constexpr int pw3(int e) {
	if(e <= 0) return 1;
	return 3 * pw3(e-1);
}

constexpr int C = 10;
int v[pw3(C)];
int ids[pw3(C)][2];

constexpr void compute_ids() {
	for(int i = 0; i < pw3(C); i++) {
		int x = i, y = 0;
		for(int j = 0; j <= C; j++) {
			if(j == C) {
				ids[i][0] = ids[i][1] = y;
				break;
			}
			if(x%3 == 2) {
				ids[i][0] = i-pw3(j), ids[i][1] = i-2*pw3(j);
				break;
			}
			y += (1<<j) * (x%3);
			x /= 3;
		}
	}
}

void solve(int d, int B, int cl, int cr, int ql, int qr) {
	if(ql == qr) return;
	if(d == B-C) {
		for(int i = 0; i < pw3(C); i++) {
			if(ids[i][0] == ids[i][1]) v[i] = cost[cl+ids[i][0]];
			else v[i] = v[ids[i][0]] + v[ids[i][1]];
		}
		for(int i = ql; i < qr; i++) {
			int w = 0;
			for(int j = C-1; j >= 0; j--) {
				if((query[i]>>(20+d+j))&1) w = 3 * w + ((query[i]>>(d+j))&1);
				else w = 3 * w + 2;
			}
			ans[(query[i]>>40)&((1LL<<20)-1)] += ((query[i]>>60) ? -v[w] : v[w]);
		}
		return;
	}
	if(d == B) {
		for(int i = ql; i < qr; i++) 
			ans[(query[i]>>40)&((1LL<<20)-1)] += ((query[i]>>60) ? -cost[cl] : cost[cl]);
		return;
	}
	int cnt[3] = {};
	for(int i = ql; i < qr; i++) {
		if((query[i]>>(20+d))&1) cnt[(query[i]>>(d))&1]++;
		else cnt[2]++;
	}
	if(cnt[2] <= cnt[0] && cnt[2] <= cnt[1]) {
		for(int i = 0; i < (1<<(B-1-d)); i++) {
			cost_arr[0][i] = cost[cl+2*i];
			cost_arr[1][i] = cost[cl+2*i+1];
		}
		for(int i = 0; i < (1<<(B-1-d)); i++) cost[cl+i] = cost_arr[0][i];
		for(int i = 0; i < (1<<(B-1-d)); i++) cost[cl+(1<<(B-1-d))+i] = cost_arr[1][i];
		int a = ql, b = ql+cnt[0]+cnt[2];
		cat bits = (1LL<<(20+d)) + (1LL<<(d));
		for(int i = ql; i < ql+cnt[0]+cnt[2]; i++) {
			if((query[i]>>(20+d))&1) {
				if((query[i]>>(d))&1) {
					for(; b < qr && (query[b]&bits) == bits; b++) {}
					if(b == qr) break;
					swap(query[i], query[b]);
					b++;
				}
				else {
					while(a < i && ((query[a]>>(20+d))&1) == 1 && ((query[a]>>(d))&1) == 0) a++;
					if(a == i) continue;
					swap(query[i], query[a]);
					a++;
				}
			}
		}
		solve(d+1, B, cl, cl+(1<<(B-1-d)), ql, ql+cnt[0]+cnt[2]);
		a = ql;
		for(int i = ql+cnt[0]; i < ql+cnt[0]+cnt[2]; i++) if(((query[i]>>(20+d))&1) == 1) {
			for(; a < ql+cnt[0] && ((query[a]>>(20+d))&1) == 1; a++) {}
			if(a == ql+cnt[0]) break;
			swap(query[i], query[a]);
			a++;
		}
		solve(d+1, B, cl+(1<<(B-1-d)), cr, qr-cnt[2]-cnt[1], qr);
		return;
	}
	int x = (int) (cnt[1] < cnt[0]);
	for(int i = 0; i < (1<<(B-1-d)); i++) {
		cost_arr[0][i] = cost[cl+2*i+1-x];
		cost_arr[1][i] = cost[cl+2*i] + cost[cl+2*i+1];
	}
	for(int i = 0; i < (1<<(B-1-d)); i++) cost[cl+i] = cost_arr[0][i];
	for(int i = 0; i < (1<<(B-1-d)); i++) cost[cl+(1<<(B-1-d))+i] = cost_arr[1][i];
	int a = ql, b = ql+cnt[1-x]+cnt[x];
	for(int i = ql; i < ql+cnt[1-x]+cnt[x]; i++) {
		if((query[i]>>(20+d))&1) {
			if(((query[i]>>(d))&1) != x) {
				while(a < i && ((query[a]>>(20+d))&1) == 1 && ((query[a]>>(d))&1) != x) a++;
				if(a == i) continue;
				swap(query[i], query[a]);
				a++;
			}
		}
		else {
			while(b < qr && ((query[b]>>(20+d))&1) == 0) b++;
			swap(query[i], query[b]);
			b++;
			i--;
		}
	}
	for(int i = ql+cnt[1-x]; i < ql+cnt[1-x]+cnt[x]; i++) query[i] ^= 1LL<<60;
	solve(d+1, B, cl, cl+(1<<(B-1-d)), ql, ql+cnt[1-x]+cnt[x]);
	a = ql+cnt[1-x];
	cat bits = (1LL<<(20+d)) + (1LL<<(d));
	cat expect = (1LL<<(20+d)) + x * (1LL<<(d));
	for(int i = ql; i < ql+cnt[1-x]; i++) if((query[i]&bits) == expect) {
		while(a < ql+cnt[1-x]+cnt[x] && (query[a]&bits) == expect) a++;
		if(a == ql+cnt[1-x]+cnt[x]) break;
		swap(query[i], query[a]);
		a++;
	}
	for(int i = ql+cnt[1-x]; i < ql+cnt[1-x]+cnt[x]; i++) query[i] ^= 1LL<<60;
	solve(d+1, B, cl+(1<<(B-1-d)), cr, qr-cnt[2]-cnt[x], qr);
}

int main() {
	compute_ids();
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int B, Q;
	char buf[(1<<20) + 10];
	scanf("%d %d %s", &B, &Q, buf);
	for(int i = 0; i < (1<<B); i++) {
		int b = 0;
		for(int j = 0; j < B; j++) b = 2*b + ((i>>j)&1);
		cost[b] = buf[i]-'0';
	}
	// query: mask, bits, id
	char buf_small[30];
	for(int i = 0; i < Q; i++) {
		scanf("%s", buf_small);
		query[i] = (1LL*i)<<40;
		for(int j = 0; j < B; j++) {
			if(buf_small[j] == '?') continue;
			query[i] += 1LL<<(j+20);
			if(buf_small[j] == '1') query[i] += 1LL<<(j+0);
		}
	}
	memset(ans, 0, sizeof(ans));
	solve(0, B, 0, 1<<B, 0, Q);
	for(int i = 0; i < Q; i++) cout << ans[i] << "\n";
	return 0;}
 
// look at my code
// my code is amazing

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:184:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %s", &B, &Q, buf);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:193:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", buf_small);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 33 ms 4984 KB Output is correct
3 Correct 6 ms 5040 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 7 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 7 ms 5244 KB Output is correct
8 Correct 6 ms 5288 KB Output is correct
9 Correct 6 ms 5288 KB Output is correct
10 Correct 6 ms 5288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 33 ms 4984 KB Output is correct
3 Correct 6 ms 5040 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 7 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 7 ms 5244 KB Output is correct
8 Correct 6 ms 5288 KB Output is correct
9 Correct 6 ms 5288 KB Output is correct
10 Correct 6 ms 5288 KB Output is correct
11 Correct 325 ms 16976 KB Output is correct
12 Correct 332 ms 16976 KB Output is correct
13 Correct 292 ms 16976 KB Output is correct
14 Correct 297 ms 16976 KB Output is correct
15 Correct 326 ms 17000 KB Output is correct
16 Correct 310 ms 17000 KB Output is correct
17 Correct 488 ms 17000 KB Output is correct
18 Correct 217 ms 17932 KB Output is correct
19 Correct 246 ms 17932 KB Output is correct
20 Correct 340 ms 17932 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 33 ms 4984 KB Output is correct
3 Correct 6 ms 5040 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 7 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 7 ms 5244 KB Output is correct
8 Correct 6 ms 5288 KB Output is correct
9 Correct 6 ms 5288 KB Output is correct
10 Correct 6 ms 5288 KB Output is correct
11 Correct 325 ms 16976 KB Output is correct
12 Correct 332 ms 16976 KB Output is correct
13 Correct 292 ms 16976 KB Output is correct
14 Correct 297 ms 16976 KB Output is correct
15 Correct 326 ms 17000 KB Output is correct
16 Correct 310 ms 17000 KB Output is correct
17 Correct 488 ms 17000 KB Output is correct
18 Correct 217 ms 17932 KB Output is correct
19 Correct 246 ms 17932 KB Output is correct
20 Correct 340 ms 17932 KB Output is correct
21 Correct 406 ms 17932 KB Output is correct
22 Correct 441 ms 17932 KB Output is correct
23 Correct 507 ms 17932 KB Output is correct
24 Correct 437 ms 17932 KB Output is correct
25 Correct 416 ms 18156 KB Output is correct
26 Correct 478 ms 18156 KB Output is correct
27 Correct 466 ms 18156 KB Output is correct
28 Correct 255 ms 23868 KB Output is correct
29 Correct 275 ms 23868 KB Output is correct
30 Correct 476 ms 23868 KB Output is correct
31 Correct 464 ms 23868 KB Output is correct
32 Correct 508 ms 26260 KB Output is correct
33 Correct 368 ms 26260 KB Output is correct
34 Correct 464 ms 26260 KB Output is correct
35 Correct 645 ms 26260 KB Output is correct
36 Correct 322 ms 37892 KB Output is correct
37 Correct 422 ms 53812 KB Output is correct
38 Correct 300 ms 65476 KB Output is correct
39 Runtime error 458 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
40 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 33 ms 4984 KB Output is correct
3 Correct 6 ms 5040 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 7 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 7 ms 5244 KB Output is correct
8 Correct 6 ms 5288 KB Output is correct
9 Correct 6 ms 5288 KB Output is correct
10 Correct 6 ms 5288 KB Output is correct
11 Runtime error 154 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 33 ms 4984 KB Output is correct
3 Correct 6 ms 5040 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 7 ms 5244 KB Output is correct
6 Correct 6 ms 5244 KB Output is correct
7 Correct 7 ms 5244 KB Output is correct
8 Correct 6 ms 5288 KB Output is correct
9 Correct 6 ms 5288 KB Output is correct
10 Correct 6 ms 5288 KB Output is correct
11 Correct 325 ms 16976 KB Output is correct
12 Correct 332 ms 16976 KB Output is correct
13 Correct 292 ms 16976 KB Output is correct
14 Correct 297 ms 16976 KB Output is correct
15 Correct 326 ms 17000 KB Output is correct
16 Correct 310 ms 17000 KB Output is correct
17 Correct 488 ms 17000 KB Output is correct
18 Correct 217 ms 17932 KB Output is correct
19 Correct 246 ms 17932 KB Output is correct
20 Correct 340 ms 17932 KB Output is correct
21 Correct 406 ms 17932 KB Output is correct
22 Correct 441 ms 17932 KB Output is correct
23 Correct 507 ms 17932 KB Output is correct
24 Correct 437 ms 17932 KB Output is correct
25 Correct 416 ms 18156 KB Output is correct
26 Correct 478 ms 18156 KB Output is correct
27 Correct 466 ms 18156 KB Output is correct
28 Correct 255 ms 23868 KB Output is correct
29 Correct 275 ms 23868 KB Output is correct
30 Correct 476 ms 23868 KB Output is correct
31 Correct 464 ms 23868 KB Output is correct
32 Correct 508 ms 26260 KB Output is correct
33 Correct 368 ms 26260 KB Output is correct
34 Correct 464 ms 26260 KB Output is correct
35 Correct 645 ms 26260 KB Output is correct
36 Correct 322 ms 37892 KB Output is correct
37 Correct 422 ms 53812 KB Output is correct
38 Correct 300 ms 65476 KB Output is correct
39 Runtime error 458 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
40 Halted 0 ms 0 KB -