oj.uz

답안 #675745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675745 2022-12-27T19:35:03 Z MilosMilutinovic Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1898 ms 38980 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
using namespace std;

#ifdef LOCAL
	#define eprintf(...) {fprintf(stderr, __VA_ARGS__);fflush(stderr);}
#else
	#define eprintf(...) 42
#endif

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
	return (ull)rng() % B;
}

#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}

const int N = (1 << 20);
int n, q;
char s[N];
char t[N];
int sub[N];
int sup[N];

char nextChar() {
	char c = getchar();
	while (!isdigit(c) && c != '?') c = getchar();
	return c;
}

int main()
{
	startTime = clock();
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

	scanf("%d%d", &n, &q);
	for (int i = 0; i < (1 << n); i++)
		s[i] = nextChar();
	for (int i = 0; i < (1 << n); i++) {
		sub[i] = (int)(s[i] - '0');
		sup[i] = (int)(s[i] - '0');
	}
	for (int i = 0; i < n; i++)
		for (int mask = 0; mask < (1 << n); mask++)
			if (mask >> i & 1)
				sub[mask] += sub[mask ^ (1 << i)];
	for (int i = 0; i < n; i++)
		for (int mask = (1 << n) - 1; mask >= 0; mask--)
			if (!(mask >> i & 1))
				sup[mask] += sup[mask ^ (1 << i)];
	vector<int> zero, one, qmark;
	while(q--) {
		for (int i = 0; i < n; i++)
			t[i] = nextChar();
		reverse(t, t + n);
		zero.clear();
		one.clear();
		qmark.clear();
		for (int i = 0; i < n; i++) {
			if (t[i] == '0') zero.push_back(i);
			if (t[i] == '1') one.push_back(i);
			if (t[i] == '?') qmark.push_back(i);
		}
		int tmask = 0;
		for (int i = 0; i < n; i++)
			if (t[i] == '1')
				tmask += (1 << i);
		int ans = 0;
		if (qmark.size() <= 6) {
			int sz = qmark.size();
			for (int mask = 0; mask < (1 << sz); mask++) {
				int nmask = tmask;
				for (int i = 0; i < sz; i++)
					if (mask >> i & 1)
						nmask += (1 << qmark[i]);
				ans += (int)(s[nmask] - '0');
			}
		} else if (zero.size() <= 6) {
			int sz = zero.size();
			for (int mask = 0; mask < (1 << sz); mask++) {
				int nmask = tmask;
				for (int i = 0; i < sz; i++)
					if (mask >> i & 1)
						nmask += (1 << zero[i]);
				ans += sup[nmask] * (__builtin_popcount(mask) % 2 == 0 ? 1 : -1);
			}
		} else {
			assert(one.size() <= 6);
			int sz = one.size();
			tmask = 0;
			for (int i = 0; i < n; i++)
				if (t[i] == '?')
					tmask += (1 << i);
			for (int mask = 0; mask < (1 << sz); mask++) {
				int nmask = tmask;
				for (int i = 0; i < sz; i++)
					if (mask >> i & 1)
						nmask += (1 << one[i]);
				ans += sub[nmask] * ((sz - __builtin_popcount(mask)) % 2 == 0 ? 1 : -1);
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |  scanf("%d%d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 491 ms 4276 KB Output is correct
12 Correct 503 ms 3952 KB Output is correct
13 Correct 340 ms 3212 KB Output is correct
14 Correct 332 ms 3252 KB Output is correct
15 Correct 827 ms 4240 KB Output is correct
16 Correct 427 ms 3484 KB Output is correct
17 Correct 437 ms 3452 KB Output is correct
18 Correct 198 ms 5312 KB Output is correct
19 Correct 240 ms 2244 KB Output is correct
20 Correct 527 ms 3944 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 491 ms 4276 KB Output is correct
12 Correct 503 ms 3952 KB Output is correct
13 Correct 340 ms 3212 KB Output is correct
14 Correct 332 ms 3252 KB Output is correct
15 Correct 827 ms 4240 KB Output is correct
16 Correct 427 ms 3484 KB Output is correct
17 Correct 437 ms 3452 KB Output is correct
18 Correct 198 ms 5312 KB Output is correct
19 Correct 240 ms 2244 KB Output is correct
20 Correct 527 ms 3944 KB Output is correct
21 Correct 368 ms 4296 KB Output is correct
22 Correct 773 ms 4556 KB Output is correct
23 Correct 520 ms 3544 KB Output is correct
24 Correct 460 ms 3336 KB Output is correct
25 Correct 439 ms 5280 KB Output is correct
26 Correct 617 ms 3952 KB Output is correct
27 Correct 575 ms 3884 KB Output is correct
28 Correct 245 ms 6376 KB Output is correct
29 Correct 300 ms 2380 KB Output is correct
30 Correct 561 ms 4504 KB Output is correct
31 Correct 887 ms 4344 KB Output is correct
32 Correct 601 ms 4364 KB Output is correct
33 Correct 418 ms 3388 KB Output is correct
34 Correct 452 ms 3320 KB Output is correct
35 Correct 580 ms 3884 KB Output is correct
36 Correct 244 ms 2304 KB Output is correct
37 Correct 816 ms 4332 KB Output is correct
38 Correct 327 ms 2280 KB Output is correct
39 Correct 502 ms 3572 KB Output is correct
40 Correct 468 ms 3300 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 78 ms 9764 KB Output is correct
12 Correct 91 ms 9664 KB Output is correct
13 Correct 89 ms 9604 KB Output is correct
14 Correct 114 ms 9820 KB Output is correct
15 Correct 78 ms 9804 KB Output is correct
16 Correct 123 ms 9648 KB Output is correct
17 Correct 107 ms 9788 KB Output is correct
18 Correct 61 ms 9912 KB Output is correct
19 Correct 75 ms 9520 KB Output is correct
20 Correct 80 ms 9700 KB Output is correct
21 Correct 108 ms 9660 KB Output is correct
22 Correct 118 ms 9644 KB Output is correct
23 Correct 74 ms 9644 KB Output is correct
24 Correct 98 ms 9660 KB Output is correct
25 Correct 110 ms 9648 KB Output is correct
26 Correct 61 ms 9560 KB Output is correct
27 Correct 74 ms 9684 KB Output is correct
28 Correct 72 ms 9536 KB Output is correct
29 Correct 89 ms 9652 KB Output is correct
30 Correct 105 ms 9676 KB Output is correct
31 Correct 92 ms 9652 KB Output is correct
32 Correct 112 ms 9676 KB Output is correct
33 Correct 103 ms 9652 KB Output is correct
34 Correct 61 ms 9592 KB Output is correct
35 Correct 105 ms 9644 KB Output is correct
36 Correct 94 ms 9644 KB Output is correct
37 Correct 93 ms 9788 KB Output is correct
38 Correct 94 ms 9652 KB Output is correct
39 Correct 103 ms 9692 KB Output is correct
40 Correct 103 ms 9660 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 491 ms 4276 KB Output is correct
12 Correct 503 ms 3952 KB Output is correct
13 Correct 340 ms 3212 KB Output is correct
14 Correct 332 ms 3252 KB Output is correct
15 Correct 827 ms 4240 KB Output is correct
16 Correct 427 ms 3484 KB Output is correct
17 Correct 437 ms 3452 KB Output is correct
18 Correct 198 ms 5312 KB Output is correct
19 Correct 240 ms 2244 KB Output is correct
20 Correct 527 ms 3944 KB Output is correct
21 Correct 368 ms 4296 KB Output is correct
22 Correct 773 ms 4556 KB Output is correct
23 Correct 520 ms 3544 KB Output is correct
24 Correct 460 ms 3336 KB Output is correct
25 Correct 439 ms 5280 KB Output is correct
26 Correct 617 ms 3952 KB Output is correct
27 Correct 575 ms 3884 KB Output is correct
28 Correct 245 ms 6376 KB Output is correct
29 Correct 300 ms 2380 KB Output is correct
30 Correct 561 ms 4504 KB Output is correct
31 Correct 887 ms 4344 KB Output is correct
32 Correct 601 ms 4364 KB Output is correct
33 Correct 418 ms 3388 KB Output is correct
34 Correct 452 ms 3320 KB Output is correct
35 Correct 580 ms 3884 KB Output is correct
36 Correct 244 ms 2304 KB Output is correct
37 Correct 816 ms 4332 KB Output is correct
38 Correct 327 ms 2280 KB Output is correct
39 Correct 502 ms 3572 KB Output is correct
40 Correct 468 ms 3300 KB Output is correct
41 Correct 78 ms 9764 KB Output is correct
42 Correct 91 ms 9664 KB Output is correct
43 Correct 89 ms 9604 KB Output is correct
44 Correct 114 ms 9820 KB Output is correct
45 Correct 78 ms 9804 KB Output is correct
46 Correct 123 ms 9648 KB Output is correct
47 Correct 107 ms 9788 KB Output is correct
48 Correct 61 ms 9912 KB Output is correct
49 Correct 75 ms 9520 KB Output is correct
50 Correct 80 ms 9700 KB Output is correct
51 Correct 108 ms 9660 KB Output is correct
52 Correct 118 ms 9644 KB Output is correct
53 Correct 74 ms 9644 KB Output is correct
54 Correct 98 ms 9660 KB Output is correct
55 Correct 110 ms 9648 KB Output is correct
56 Correct 61 ms 9560 KB Output is correct
57 Correct 74 ms 9684 KB Output is correct
58 Correct 72 ms 9536 KB Output is correct
59 Correct 89 ms 9652 KB Output is correct
60 Correct 105 ms 9676 KB Output is correct
61 Correct 92 ms 9652 KB Output is correct
62 Correct 112 ms 9676 KB Output is correct
63 Correct 103 ms 9652 KB Output is correct
64 Correct 61 ms 9592 KB Output is correct
65 Correct 105 ms 9644 KB Output is correct
66 Correct 94 ms 9644 KB Output is correct
67 Correct 93 ms 9788 KB Output is correct
68 Correct 94 ms 9652 KB Output is correct
69 Correct 103 ms 9692 KB Output is correct
70 Correct 103 ms 9660 KB Output is correct
71 Correct 619 ms 14552 KB Output is correct
72 Correct 736 ms 14644 KB Output is correct
73 Correct 830 ms 13172 KB Output is correct
74 Correct 1749 ms 13624 KB Output is correct
75 Correct 744 ms 37060 KB Output is correct
76 Correct 1565 ms 35496 KB Output is correct
77 Correct 1257 ms 35276 KB Output is correct
78 Correct 379 ms 38980 KB Output is correct
79 Correct 504 ms 33020 KB Output is correct
80 Correct 664 ms 36184 KB Output is correct
81 Correct 1137 ms 35972 KB Output is correct
82 Correct 1898 ms 35088 KB Output is correct
83 Correct 680 ms 34360 KB Output is correct
84 Correct 1102 ms 35068 KB Output is correct
85 Correct 1213 ms 35348 KB Output is correct
86 Correct 342 ms 32992 KB Output is correct
87 Correct 614 ms 36180 KB Output is correct
88 Correct 517 ms 32996 KB Output is correct
89 Correct 832 ms 34764 KB Output is correct
90 Correct 1111 ms 34976 KB Output is correct
91 Correct 689 ms 34140 KB Output is correct
92 Correct 1567 ms 35332 KB Output is correct
93 Correct 1240 ms 35112 KB Output is correct
94 Correct 362 ms 32912 KB Output is correct
95 Correct 1102 ms 34800 KB Output is correct
96 Correct 1094 ms 34884 KB Output is correct
97 Correct 1139 ms 34836 KB Output is correct
98 Correct 1109 ms 34876 KB Output is correct
99 Correct 1135 ms 34868 KB Output is correct
100 Correct 1016 ms 35048 KB Output is correct