oj.uz

답안 #369318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369318 2021-02-21T09:51:57 Z Return_0 Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1342 ms 43372 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl L = 20, N = 1 << L;

ll a [N], dp0 [N], dp1 [N], n, q, ans;
char c;

#define C(x) __builtin_popcount(x)
#define f(x) ((~(x)) & ((1 << n) - 1))

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> q;
	for (ll i = 0; i < (1 << n); i++) cin>> c, dp0[i] = dp1[i] = a[i] = c - '0';
	for (ll i = 0; i < L; i++) for (ll msk = 0; msk < (1 << n); msk++) {
		if (msk >> i & 1) dp1[msk] += dp1[msk ^ (1 << i)];
		else dp0[msk] += dp0[msk ^ (1 << i)];
	}

	for (ll msk0 = 0, msk1 = 0, msk2 = 0, msk; q--; msk0 = msk1 = msk2 = 0) {
		for (ll i = 0; i < n; i++) {
			cin>> c;
			msk0 = (msk0 << 1) | (c == '0');
			msk1 = (msk1 << 1) | (c == '1');
			msk2 = (msk2 << 1) | (c == '?');
		}

		if (C(msk2) < 7)
			for (msk = msk2, ans = a[msk1]; msk; msk = (msk - 1) & msk2) ans += a[msk1 | msk];

		else if (C(msk1) < 7)
			for (msk = msk1, ans = dp1[msk1 | msk2]; msk; msk = (msk - 1) & msk1) ans += (C(msk) & 1 ? -1 : 1) * dp1[msk2 | (msk1 ^ msk)];

		else
			for (msk = msk0, ans = dp0[msk1]; msk; msk = (msk - 1) & msk0) ans += (C(msk) & 1 ? -1 : 1) * dp0[msk1 | msk];

		cout<< ans << ' ' << '\n';
	}

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
3 5
12345678
000
0??
1?0
?11
???

4 8
3141592653589793
0101
?01?
??1?
?0??
1?00
01?1
??10
????

*/

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 338 ms 16236 KB Output is correct
12 Correct 339 ms 15852 KB Output is correct
13 Correct 316 ms 15084 KB Output is correct
14 Correct 307 ms 15212 KB Output is correct
15 Correct 385 ms 16492 KB Output is correct
16 Correct 331 ms 15340 KB Output is correct
17 Correct 328 ms 15340 KB Output is correct
18 Correct 318 ms 17516 KB Output is correct
19 Correct 302 ms 14248 KB Output is correct
20 Correct 347 ms 15892 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 338 ms 16236 KB Output is correct
12 Correct 339 ms 15852 KB Output is correct
13 Correct 316 ms 15084 KB Output is correct
14 Correct 307 ms 15212 KB Output is correct
15 Correct 385 ms 16492 KB Output is correct
16 Correct 331 ms 15340 KB Output is correct
17 Correct 328 ms 15340 KB Output is correct
18 Correct 318 ms 17516 KB Output is correct
19 Correct 302 ms 14248 KB Output is correct
20 Correct 347 ms 15892 KB Output is correct
21 Correct 737 ms 19180 KB Output is correct
22 Correct 395 ms 19436 KB Output is correct
23 Correct 381 ms 18540 KB Output is correct
24 Correct 367 ms 18284 KB Output is correct
25 Correct 396 ms 20204 KB Output is correct
26 Correct 389 ms 19052 KB Output is correct
27 Correct 387 ms 18700 KB Output is correct
28 Correct 365 ms 21356 KB Output is correct
29 Correct 354 ms 17388 KB Output is correct
30 Correct 499 ms 19308 KB Output is correct
31 Correct 428 ms 19308 KB Output is correct
32 Correct 385 ms 19308 KB Output is correct
33 Correct 387 ms 18156 KB Output is correct
34 Correct 365 ms 18156 KB Output is correct
35 Correct 399 ms 18668 KB Output is correct
36 Correct 347 ms 17292 KB Output is correct
37 Correct 428 ms 19188 KB Output is correct
38 Correct 348 ms 17388 KB Output is correct
39 Correct 378 ms 18644 KB Output is correct
40 Correct 365 ms 18284 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 88 ms 14956 KB Output is correct
12 Correct 78 ms 15084 KB Output is correct
13 Correct 79 ms 14956 KB Output is correct
14 Correct 109 ms 14960 KB Output is correct
15 Correct 77 ms 15084 KB Output is correct
16 Correct 117 ms 15136 KB Output is correct
17 Correct 98 ms 14956 KB Output is correct
18 Correct 70 ms 15212 KB Output is correct
19 Correct 73 ms 14828 KB Output is correct
20 Correct 76 ms 15084 KB Output is correct
21 Correct 88 ms 14956 KB Output is correct
22 Correct 106 ms 14956 KB Output is correct
23 Correct 72 ms 14956 KB Output is correct
24 Correct 84 ms 14956 KB Output is correct
25 Correct 102 ms 15084 KB Output is correct
26 Correct 70 ms 14972 KB Output is correct
27 Correct 72 ms 15084 KB Output is correct
28 Correct 72 ms 14828 KB Output is correct
29 Correct 78 ms 15016 KB Output is correct
30 Correct 81 ms 14956 KB Output is correct
31 Correct 74 ms 15084 KB Output is correct
32 Correct 105 ms 14956 KB Output is correct
33 Correct 101 ms 14956 KB Output is correct
34 Correct 70 ms 14828 KB Output is correct
35 Correct 92 ms 15084 KB Output is correct
36 Correct 90 ms 14956 KB Output is correct
37 Correct 91 ms 14956 KB Output is correct
38 Correct 91 ms 15072 KB Output is correct
39 Correct 89 ms 14956 KB Output is correct
40 Correct 92 ms 15084 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 338 ms 16236 KB Output is correct
12 Correct 339 ms 15852 KB Output is correct
13 Correct 316 ms 15084 KB Output is correct
14 Correct 307 ms 15212 KB Output is correct
15 Correct 385 ms 16492 KB Output is correct
16 Correct 331 ms 15340 KB Output is correct
17 Correct 328 ms 15340 KB Output is correct
18 Correct 318 ms 17516 KB Output is correct
19 Correct 302 ms 14248 KB Output is correct
20 Correct 347 ms 15892 KB Output is correct
21 Correct 737 ms 19180 KB Output is correct
22 Correct 395 ms 19436 KB Output is correct
23 Correct 381 ms 18540 KB Output is correct
24 Correct 367 ms 18284 KB Output is correct
25 Correct 396 ms 20204 KB Output is correct
26 Correct 389 ms 19052 KB Output is correct
27 Correct 387 ms 18700 KB Output is correct
28 Correct 365 ms 21356 KB Output is correct
29 Correct 354 ms 17388 KB Output is correct
30 Correct 499 ms 19308 KB Output is correct
31 Correct 428 ms 19308 KB Output is correct
32 Correct 385 ms 19308 KB Output is correct
33 Correct 387 ms 18156 KB Output is correct
34 Correct 365 ms 18156 KB Output is correct
35 Correct 399 ms 18668 KB Output is correct
36 Correct 347 ms 17292 KB Output is correct
37 Correct 428 ms 19188 KB Output is correct
38 Correct 348 ms 17388 KB Output is correct
39 Correct 378 ms 18644 KB Output is correct
40 Correct 365 ms 18284 KB Output is correct
41 Correct 88 ms 14956 KB Output is correct
42 Correct 78 ms 15084 KB Output is correct
43 Correct 79 ms 14956 KB Output is correct
44 Correct 109 ms 14960 KB Output is correct
45 Correct 77 ms 15084 KB Output is correct
46 Correct 117 ms 15136 KB Output is correct
47 Correct 98 ms 14956 KB Output is correct
48 Correct 70 ms 15212 KB Output is correct
49 Correct 73 ms 14828 KB Output is correct
50 Correct 76 ms 15084 KB Output is correct
51 Correct 88 ms 14956 KB Output is correct
52 Correct 106 ms 14956 KB Output is correct
53 Correct 72 ms 14956 KB Output is correct
54 Correct 84 ms 14956 KB Output is correct
55 Correct 102 ms 15084 KB Output is correct
56 Correct 70 ms 14972 KB Output is correct
57 Correct 72 ms 15084 KB Output is correct
58 Correct 72 ms 14828 KB Output is correct
59 Correct 78 ms 15016 KB Output is correct
60 Correct 81 ms 14956 KB Output is correct
61 Correct 74 ms 15084 KB Output is correct
62 Correct 105 ms 14956 KB Output is correct
63 Correct 101 ms 14956 KB Output is correct
64 Correct 70 ms 14828 KB Output is correct
65 Correct 92 ms 15084 KB Output is correct
66 Correct 90 ms 14956 KB Output is correct
67 Correct 91 ms 14956 KB Output is correct
68 Correct 91 ms 15072 KB Output is correct
69 Correct 89 ms 14956 KB Output is correct
70 Correct 92 ms 15084 KB Output is correct
71 Correct 574 ms 40428 KB Output is correct
72 Correct 618 ms 40428 KB Output is correct
73 Correct 671 ms 39276 KB Output is correct
74 Correct 1080 ms 39372 KB Output is correct
75 Correct 657 ms 41580 KB Output is correct
76 Correct 1342 ms 39788 KB Output is correct
77 Correct 1119 ms 39532 KB Output is correct
78 Correct 530 ms 43372 KB Output is correct
79 Correct 575 ms 37488 KB Output is correct
80 Correct 646 ms 40556 KB Output is correct
81 Correct 829 ms 40428 KB Output is correct
82 Correct 1141 ms 39276 KB Output is correct
83 Correct 571 ms 38508 KB Output is correct
84 Correct 752 ms 39276 KB Output is correct
85 Correct 1135 ms 39916 KB Output is correct
86 Correct 509 ms 37484 KB Output is correct
87 Correct 577 ms 40480 KB Output is correct
88 Correct 586 ms 37356 KB Output is correct
89 Correct 700 ms 39148 KB Output is correct
90 Correct 760 ms 39404 KB Output is correct
91 Correct 567 ms 38380 KB Output is correct
92 Correct 1202 ms 39788 KB Output is correct
93 Correct 1129 ms 39660 KB Output is correct
94 Correct 497 ms 37228 KB Output is correct
95 Correct 954 ms 39480 KB Output is correct
96 Correct 951 ms 39532 KB Output is correct
97 Correct 980 ms 39516 KB Output is correct
98 Correct 952 ms 39532 KB Output is correct
99 Correct 968 ms 39404 KB Output is correct
100 Correct 962 ms 39532 KB Output is correct