oj.uz

Submission #56592

# Submission time Handle Problem Language Result Execution time Memory
56592 2018-07-11T23:23:25 Z Xellos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1498 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 = 12;
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 12 ms 8440 KB Output is correct
2 Correct 11 ms 8552 KB Output is correct
3 Correct 17 ms 8552 KB Output is correct
4 Correct 12 ms 8552 KB Output is correct
5 Correct 12 ms 8680 KB Output is correct
6 Correct 15 ms 8680 KB Output is correct
7 Correct 15 ms 8680 KB Output is correct
8 Correct 12 ms 8736 KB Output is correct
9 Correct 12 ms 8736 KB Output is correct
10 Correct 12 ms 8736 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8440 KB Output is correct
2 Correct 11 ms 8552 KB Output is correct
3 Correct 17 ms 8552 KB Output is correct
4 Correct 12 ms 8552 KB Output is correct
5 Correct 12 ms 8680 KB Output is correct
6 Correct 15 ms 8680 KB Output is correct
7 Correct 15 ms 8680 KB Output is correct
8 Correct 12 ms 8736 KB Output is correct
9 Correct 12 ms 8736 KB Output is correct
10 Correct 12 ms 8736 KB Output is correct
11 Correct 485 ms 20432 KB Output is correct
12 Correct 476 ms 20432 KB Output is correct
13 Correct 748 ms 20432 KB Output is correct
14 Correct 858 ms 20432 KB Output is correct
15 Correct 676 ms 20504 KB Output is correct
16 Correct 878 ms 20504 KB Output is correct
17 Correct 1074 ms 20504 KB Output is correct
18 Correct 233 ms 21420 KB Output is correct
19 Correct 323 ms 21420 KB Output is correct
20 Correct 412 ms 21420 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8440 KB Output is correct
2 Correct 11 ms 8552 KB Output is correct
3 Correct 17 ms 8552 KB Output is correct
4 Correct 12 ms 8552 KB Output is correct
5 Correct 12 ms 8680 KB Output is correct
6 Correct 15 ms 8680 KB Output is correct
7 Correct 15 ms 8680 KB Output is correct
8 Correct 12 ms 8736 KB Output is correct
9 Correct 12 ms 8736 KB Output is correct
10 Correct 12 ms 8736 KB Output is correct
11 Correct 485 ms 20432 KB Output is correct
12 Correct 476 ms 20432 KB Output is correct
13 Correct 748 ms 20432 KB Output is correct
14 Correct 858 ms 20432 KB Output is correct
15 Correct 676 ms 20504 KB Output is correct
16 Correct 878 ms 20504 KB Output is correct
17 Correct 1074 ms 20504 KB Output is correct
18 Correct 233 ms 21420 KB Output is correct
19 Correct 323 ms 21420 KB Output is correct
20 Correct 412 ms 21420 KB Output is correct
21 Correct 383 ms 22660 KB Output is correct
22 Correct 397 ms 22828 KB Output is correct
23 Correct 378 ms 22828 KB Output is correct
24 Correct 408 ms 22828 KB Output is correct
25 Correct 399 ms 23740 KB Output is correct
26 Correct 517 ms 23740 KB Output is correct
27 Correct 473 ms 23740 KB Output is correct
28 Correct 252 ms 29372 KB Output is correct
29 Correct 302 ms 29372 KB Output is correct
30 Correct 486 ms 29372 KB Output is correct
31 Correct 431 ms 29372 KB Output is correct
32 Correct 492 ms 31808 KB Output is correct
33 Correct 446 ms 31808 KB Output is correct
34 Correct 562 ms 31808 KB Output is correct
35 Correct 498 ms 31808 KB Output is correct
36 Correct 322 ms 31808 KB Output is correct
37 Correct 387 ms 32540 KB Output is correct
38 Correct 302 ms 32540 KB Output is correct
39 Correct 423 ms 32540 KB Output is correct
40 Correct 437 ms 32540 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8440 KB Output is correct
2 Correct 11 ms 8552 KB Output is correct
3 Correct 17 ms 8552 KB Output is correct
4 Correct 12 ms 8552 KB Output is correct
5 Correct 12 ms 8680 KB Output is correct
6 Correct 15 ms 8680 KB Output is correct
7 Correct 15 ms 8680 KB Output is correct
8 Correct 12 ms 8736 KB Output is correct
9 Correct 12 ms 8736 KB Output is correct
10 Correct 12 ms 8736 KB Output is correct
11 Correct 323 ms 32540 KB Output is correct
12 Correct 300 ms 32540 KB Output is correct
13 Correct 308 ms 32540 KB Output is correct
14 Correct 319 ms 32540 KB Output is correct
15 Correct 285 ms 32540 KB Output is correct
16 Correct 351 ms 32540 KB Output is correct
17 Correct 329 ms 32540 KB Output is correct
18 Correct 80 ms 32540 KB Output is correct
19 Correct 292 ms 32540 KB Output is correct
20 Correct 291 ms 32540 KB Output is correct
21 Correct 326 ms 32540 KB Output is correct
22 Correct 296 ms 32540 KB Output is correct
23 Correct 286 ms 32540 KB Output is correct
24 Correct 269 ms 32540 KB Output is correct
25 Correct 316 ms 32540 KB Output is correct
26 Correct 69 ms 32540 KB Output is correct
27 Correct 263 ms 32540 KB Output is correct
28 Correct 248 ms 32540 KB Output is correct
29 Correct 329 ms 32540 KB Output is correct
30 Correct 359 ms 32540 KB Output is correct
31 Correct 378 ms 32540 KB Output is correct
32 Correct 319 ms 32540 KB Output is correct
33 Correct 409 ms 32540 KB Output is correct
34 Correct 142 ms 32540 KB Output is correct
35 Correct 312 ms 32540 KB Output is correct
36 Correct 359 ms 32540 KB Output is correct
37 Correct 319 ms 32540 KB Output is correct
38 Correct 289 ms 32540 KB Output is correct
39 Correct 289 ms 32540 KB Output is correct
40 Correct 297 ms 32540 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8440 KB Output is correct
2 Correct 11 ms 8552 KB Output is correct
3 Correct 17 ms 8552 KB Output is correct
4 Correct 12 ms 8552 KB Output is correct
5 Correct 12 ms 8680 KB Output is correct
6 Correct 15 ms 8680 KB Output is correct
7 Correct 15 ms 8680 KB Output is correct
8 Correct 12 ms 8736 KB Output is correct
9 Correct 12 ms 8736 KB Output is correct
10 Correct 12 ms 8736 KB Output is correct
11 Correct 485 ms 20432 KB Output is correct
12 Correct 476 ms 20432 KB Output is correct
13 Correct 748 ms 20432 KB Output is correct
14 Correct 858 ms 20432 KB Output is correct
15 Correct 676 ms 20504 KB Output is correct
16 Correct 878 ms 20504 KB Output is correct
17 Correct 1074 ms 20504 KB Output is correct
18 Correct 233 ms 21420 KB Output is correct
19 Correct 323 ms 21420 KB Output is correct
20 Correct 412 ms 21420 KB Output is correct
21 Correct 383 ms 22660 KB Output is correct
22 Correct 397 ms 22828 KB Output is correct
23 Correct 378 ms 22828 KB Output is correct
24 Correct 408 ms 22828 KB Output is correct
25 Correct 399 ms 23740 KB Output is correct
26 Correct 517 ms 23740 KB Output is correct
27 Correct 473 ms 23740 KB Output is correct
28 Correct 252 ms 29372 KB Output is correct
29 Correct 302 ms 29372 KB Output is correct
30 Correct 486 ms 29372 KB Output is correct
31 Correct 431 ms 29372 KB Output is correct
32 Correct 492 ms 31808 KB Output is correct
33 Correct 446 ms 31808 KB Output is correct
34 Correct 562 ms 31808 KB Output is correct
35 Correct 498 ms 31808 KB Output is correct
36 Correct 322 ms 31808 KB Output is correct
37 Correct 387 ms 32540 KB Output is correct
38 Correct 302 ms 32540 KB Output is correct
39 Correct 423 ms 32540 KB Output is correct
40 Correct 437 ms 32540 KB Output is correct
41 Correct 323 ms 32540 KB Output is correct
42 Correct 300 ms 32540 KB Output is correct
43 Correct 308 ms 32540 KB Output is correct
44 Correct 319 ms 32540 KB Output is correct
45 Correct 285 ms 32540 KB Output is correct
46 Correct 351 ms 32540 KB Output is correct
47 Correct 329 ms 32540 KB Output is correct
48 Correct 80 ms 32540 KB Output is correct
49 Correct 292 ms 32540 KB Output is correct
50 Correct 291 ms 32540 KB Output is correct
51 Correct 326 ms 32540 KB Output is correct
52 Correct 296 ms 32540 KB Output is correct
53 Correct 286 ms 32540 KB Output is correct
54 Correct 269 ms 32540 KB Output is correct
55 Correct 316 ms 32540 KB Output is correct
56 Correct 69 ms 32540 KB Output is correct
57 Correct 263 ms 32540 KB Output is correct
58 Correct 248 ms 32540 KB Output is correct
59 Correct 329 ms 32540 KB Output is correct
60 Correct 359 ms 32540 KB Output is correct
61 Correct 378 ms 32540 KB Output is correct
62 Correct 319 ms 32540 KB Output is correct
63 Correct 409 ms 32540 KB Output is correct
64 Correct 142 ms 32540 KB Output is correct
65 Correct 312 ms 32540 KB Output is correct
66 Correct 359 ms 32540 KB Output is correct
67 Correct 319 ms 32540 KB Output is correct
68 Correct 289 ms 32540 KB Output is correct
69 Correct 289 ms 32540 KB Output is correct
70 Correct 297 ms 32540 KB Output is correct
71 Correct 850 ms 42616 KB Output is correct
72 Correct 919 ms 64412 KB Output is correct
73 Runtime error 1498 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.
74 Halted 0 ms 0 KB -