oj.uz

답안 #489408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489408 2021-11-22T21:02:43 Z arwaeystoamneg Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 24532 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
 
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    
 
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
int popcount(ll a)
{
	int count = 0;
	while (a)
	{
		count += (a & 1);
		a >>= 1;
	}
	return count;
}
const int SZ = 20;
int n, q;
string a;
ll super[1 << SZ], sub[1 << SZ];
int main()
{
	setIO("test1");
	cin >> n >> q >> a;
	F0R(mask, 1 << n)
	{
		sub[mask] = super[mask] = a[mask] - '0';
	}
	F0R(i, n)
	{
		F0R(mask, 1 << n)
		{
			if (mask & (1 << i))continue;
			sub[mask ^ (1 << i)] += sub[mask];
		}
	}
	F0R(i, n)
	{
		R0F(mask, 1 << n)
		{
			if (mask & (1 << i))
			{
				super[mask ^ (1 << i)] += super[mask];
			}
		}
	}
	F0R(l, q)
	{
		string b;
		cin >> b;
		reverse(all(b));
		vi zero, one, quest;
		F0R(i, n)if (b[i] == '0')zero.pb(i); else if (b[i] == '1')one.pb(i); else quest.pb(i);
			ll ans = 0;
			
		if (sz(zero) <= n / 3)
		{
			int mask1 = 0;
			trav(x, one)mask1 ^= (1 << x);
			int m = sz(zero);
			F0R(mask, 1 << m)
			{
				int mask2 = mask1;
				F0R(i, m)
				{
					if (mask & (1 << i))mask2 ^= (1 << zero[i]);
				}
				if (popcount(mask) & 1)ans -= super[mask2];
				else ans += super[mask2];
			}
 
		}
		else if (sz(one) <= n / 3)
		{
			int mask1 = 0;
			trav(x, quest)mask1 ^= (1 << x);
			int m = sz(one);
			F0R(mask, 1 << m)
			{
				int mask2 = mask1;
				F0R(i, m)
				{
					if (mask & (1 << i))mask2 ^= (1 << one[i]);
				}
				if (popcount(mask) - m & 1)ans -= sub[mask2];
				else ans += sub[mask2];
			}
 
		}
		else
		{
			int mask1 = 0;
			trav(x, one)mask1 ^= (1 << x);
			int m = sz(quest);
			F0R(mask, 1 << m)
			{
				int mask2 = mask1;
				F0R(i, m)
				{
					if (mask & (1 << i))mask2 ^= (1 << quest[i]);
				}
				ans += a[mask2] - '0';
			}
		}
		cout << ans << endl;
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:133:24: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
  133 |     if (popcount(mask) - m & 1)ans -= sub[mask2];
      |         ~~~~~~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 522 ms 4360 KB Output is correct
12 Correct 474 ms 4044 KB Output is correct
13 Correct 535 ms 3224 KB Output is correct
14 Correct 592 ms 3412 KB Output is correct
15 Correct 461 ms 4368 KB Output is correct
16 Correct 573 ms 3680 KB Output is correct
17 Correct 528 ms 3584 KB Output is correct
18 Correct 317 ms 5356 KB Output is correct
19 Correct 445 ms 2300 KB Output is correct
20 Correct 428 ms 4036 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 522 ms 4360 KB Output is correct
12 Correct 474 ms 4044 KB Output is correct
13 Correct 535 ms 3224 KB Output is correct
14 Correct 592 ms 3412 KB Output is correct
15 Correct 461 ms 4368 KB Output is correct
16 Correct 573 ms 3680 KB Output is correct
17 Correct 528 ms 3584 KB Output is correct
18 Correct 317 ms 5356 KB Output is correct
19 Correct 445 ms 2300 KB Output is correct
20 Correct 428 ms 4036 KB Output is correct
21 Correct 484 ms 4428 KB Output is correct
22 Correct 525 ms 4724 KB Output is correct
23 Correct 678 ms 3616 KB Output is correct
24 Correct 739 ms 3548 KB Output is correct
25 Correct 522 ms 5536 KB Output is correct
26 Correct 676 ms 4076 KB Output is correct
27 Correct 675 ms 3884 KB Output is correct
28 Correct 303 ms 6492 KB Output is correct
29 Correct 483 ms 2456 KB Output is correct
30 Correct 503 ms 4696 KB Output is correct
31 Correct 644 ms 4532 KB Output is correct
32 Correct 666 ms 4484 KB Output is correct
33 Correct 520 ms 3400 KB Output is correct
34 Correct 677 ms 3440 KB Output is correct
35 Correct 707 ms 4020 KB Output is correct
36 Correct 330 ms 2544 KB Output is correct
37 Correct 547 ms 4544 KB Output is correct
38 Correct 563 ms 2444 KB Output is correct
39 Correct 638 ms 3620 KB Output is correct
40 Correct 675 ms 3456 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 84 ms 18068 KB Output is correct
12 Correct 85 ms 18144 KB Output is correct
13 Correct 129 ms 18068 KB Output is correct
14 Correct 178 ms 18124 KB Output is correct
15 Correct 91 ms 18328 KB Output is correct
16 Correct 149 ms 18136 KB Output is correct
17 Correct 172 ms 18036 KB Output is correct
18 Correct 69 ms 18332 KB Output is correct
19 Correct 80 ms 17940 KB Output is correct
20 Correct 89 ms 18200 KB Output is correct
21 Correct 128 ms 18168 KB Output is correct
22 Correct 144 ms 18092 KB Output is correct
23 Correct 93 ms 18072 KB Output is correct
24 Correct 150 ms 18116 KB Output is correct
25 Correct 143 ms 18212 KB Output is correct
26 Correct 82 ms 17956 KB Output is correct
27 Correct 84 ms 18072 KB Output is correct
28 Correct 88 ms 17956 KB Output is correct
29 Correct 110 ms 18084 KB Output is correct
30 Correct 121 ms 18200 KB Output is correct
31 Correct 94 ms 18072 KB Output is correct
32 Correct 193 ms 18036 KB Output is correct
33 Correct 142 ms 18084 KB Output is correct
34 Correct 67 ms 17952 KB Output is correct
35 Correct 127 ms 18136 KB Output is correct
36 Correct 132 ms 18080 KB Output is correct
37 Correct 122 ms 18144 KB Output is correct
38 Correct 119 ms 18116 KB Output is correct
39 Correct 146 ms 18148 KB Output is correct
40 Correct 127 ms 18020 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 522 ms 4360 KB Output is correct
12 Correct 474 ms 4044 KB Output is correct
13 Correct 535 ms 3224 KB Output is correct
14 Correct 592 ms 3412 KB Output is correct
15 Correct 461 ms 4368 KB Output is correct
16 Correct 573 ms 3680 KB Output is correct
17 Correct 528 ms 3584 KB Output is correct
18 Correct 317 ms 5356 KB Output is correct
19 Correct 445 ms 2300 KB Output is correct
20 Correct 428 ms 4036 KB Output is correct
21 Correct 484 ms 4428 KB Output is correct
22 Correct 525 ms 4724 KB Output is correct
23 Correct 678 ms 3616 KB Output is correct
24 Correct 739 ms 3548 KB Output is correct
25 Correct 522 ms 5536 KB Output is correct
26 Correct 676 ms 4076 KB Output is correct
27 Correct 675 ms 3884 KB Output is correct
28 Correct 303 ms 6492 KB Output is correct
29 Correct 483 ms 2456 KB Output is correct
30 Correct 503 ms 4696 KB Output is correct
31 Correct 644 ms 4532 KB Output is correct
32 Correct 666 ms 4484 KB Output is correct
33 Correct 520 ms 3400 KB Output is correct
34 Correct 677 ms 3440 KB Output is correct
35 Correct 707 ms 4020 KB Output is correct
36 Correct 330 ms 2544 KB Output is correct
37 Correct 547 ms 4544 KB Output is correct
38 Correct 563 ms 2444 KB Output is correct
39 Correct 638 ms 3620 KB Output is correct
40 Correct 675 ms 3456 KB Output is correct
41 Correct 84 ms 18068 KB Output is correct
42 Correct 85 ms 18144 KB Output is correct
43 Correct 129 ms 18068 KB Output is correct
44 Correct 178 ms 18124 KB Output is correct
45 Correct 91 ms 18328 KB Output is correct
46 Correct 149 ms 18136 KB Output is correct
47 Correct 172 ms 18036 KB Output is correct
48 Correct 69 ms 18332 KB Output is correct
49 Correct 80 ms 17940 KB Output is correct
50 Correct 89 ms 18200 KB Output is correct
51 Correct 128 ms 18168 KB Output is correct
52 Correct 144 ms 18092 KB Output is correct
53 Correct 93 ms 18072 KB Output is correct
54 Correct 150 ms 18116 KB Output is correct
55 Correct 143 ms 18212 KB Output is correct
56 Correct 82 ms 17956 KB Output is correct
57 Correct 84 ms 18072 KB Output is correct
58 Correct 88 ms 17956 KB Output is correct
59 Correct 110 ms 18084 KB Output is correct
60 Correct 121 ms 18200 KB Output is correct
61 Correct 94 ms 18072 KB Output is correct
62 Correct 193 ms 18036 KB Output is correct
63 Correct 142 ms 18084 KB Output is correct
64 Correct 67 ms 17952 KB Output is correct
65 Correct 127 ms 18136 KB Output is correct
66 Correct 132 ms 18080 KB Output is correct
67 Correct 122 ms 18144 KB Output is correct
68 Correct 119 ms 18116 KB Output is correct
69 Correct 146 ms 18148 KB Output is correct
70 Correct 127 ms 18020 KB Output is correct
71 Correct 766 ms 22972 KB Output is correct
72 Correct 890 ms 23044 KB Output is correct
73 Correct 1387 ms 23864 KB Output is correct
74 Execution timed out 2071 ms 24532 KB Time limit exceeded
75 Halted 0 ms 0 KB -