oj.uz

Submission #489388

# Submission time Handle Problem Language Result Execution time Memory
489388 2021-11-22T19:48:18 Z arwaeystoamneg Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 44560 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1643 ms 14988 KB Output is correct
12 Correct 1703 ms 14784 KB Output is correct
13 Correct 1710 ms 14048 KB Output is correct
14 Correct 1743 ms 14104 KB Output is correct
15 Correct 1648 ms 15164 KB Output is correct
16 Correct 1762 ms 14280 KB Output is correct
17 Correct 1700 ms 14360 KB Output is correct
18 Correct 1426 ms 16104 KB Output is correct
19 Correct 1567 ms 13076 KB Output is correct
20 Correct 1581 ms 14668 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1643 ms 14988 KB Output is correct
12 Correct 1703 ms 14784 KB Output is correct
13 Correct 1710 ms 14048 KB Output is correct
14 Correct 1743 ms 14104 KB Output is correct
15 Correct 1648 ms 15164 KB Output is correct
16 Correct 1762 ms 14280 KB Output is correct
17 Correct 1700 ms 14360 KB Output is correct
18 Correct 1426 ms 16104 KB Output is correct
19 Correct 1567 ms 13076 KB Output is correct
20 Correct 1581 ms 14668 KB Output is correct
21 Correct 1632 ms 18096 KB Output is correct
22 Correct 1704 ms 18420 KB Output is correct
23 Correct 1801 ms 17400 KB Output is correct
24 Correct 1884 ms 17252 KB Output is correct
25 Correct 1687 ms 19076 KB Output is correct
26 Correct 1854 ms 17608 KB Output is correct
27 Correct 1801 ms 17644 KB Output is correct
28 Correct 1462 ms 20084 KB Output is correct
29 Correct 1599 ms 16076 KB Output is correct
30 Correct 1626 ms 18272 KB Output is correct
31 Correct 1790 ms 18096 KB Output is correct
32 Correct 1825 ms 18100 KB Output is correct
33 Correct 1671 ms 17012 KB Output is correct
34 Correct 1827 ms 17120 KB Output is correct
35 Correct 1791 ms 17820 KB Output is correct
36 Correct 1390 ms 16080 KB Output is correct
37 Correct 1664 ms 18496 KB Output is correct
38 Correct 1673 ms 16200 KB Output is correct
39 Correct 1759 ms 17356 KB Output is correct
40 Correct 1837 ms 17240 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 156 ms 20228 KB Output is correct
12 Correct 154 ms 20176 KB Output is correct
13 Correct 177 ms 20036 KB Output is correct
14 Correct 212 ms 20040 KB Output is correct
15 Correct 150 ms 20176 KB Output is correct
16 Correct 207 ms 20080 KB Output is correct
17 Correct 199 ms 20032 KB Output is correct
18 Correct 131 ms 20328 KB Output is correct
19 Correct 146 ms 19944 KB Output is correct
20 Correct 150 ms 20180 KB Output is correct
21 Correct 197 ms 20088 KB Output is correct
22 Correct 310 ms 20108 KB Output is correct
23 Correct 148 ms 20048 KB Output is correct
24 Correct 229 ms 20008 KB Output is correct
25 Correct 196 ms 20052 KB Output is correct
26 Correct 153 ms 19952 KB Output is correct
27 Correct 145 ms 20072 KB Output is correct
28 Correct 155 ms 19912 KB Output is correct
29 Correct 189 ms 20104 KB Output is correct
30 Correct 195 ms 20020 KB Output is correct
31 Correct 171 ms 20072 KB Output is correct
32 Correct 268 ms 20076 KB Output is correct
33 Correct 229 ms 20036 KB Output is correct
34 Correct 137 ms 19916 KB Output is correct
35 Correct 200 ms 20048 KB Output is correct
36 Correct 220 ms 20040 KB Output is correct
37 Correct 181 ms 20048 KB Output is correct
38 Correct 187 ms 20028 KB Output is correct
39 Correct 187 ms 20036 KB Output is correct
40 Correct 188 ms 20084 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1643 ms 14988 KB Output is correct
12 Correct 1703 ms 14784 KB Output is correct
13 Correct 1710 ms 14048 KB Output is correct
14 Correct 1743 ms 14104 KB Output is correct
15 Correct 1648 ms 15164 KB Output is correct
16 Correct 1762 ms 14280 KB Output is correct
17 Correct 1700 ms 14360 KB Output is correct
18 Correct 1426 ms 16104 KB Output is correct
19 Correct 1567 ms 13076 KB Output is correct
20 Correct 1581 ms 14668 KB Output is correct
21 Correct 1632 ms 18096 KB Output is correct
22 Correct 1704 ms 18420 KB Output is correct
23 Correct 1801 ms 17400 KB Output is correct
24 Correct 1884 ms 17252 KB Output is correct
25 Correct 1687 ms 19076 KB Output is correct
26 Correct 1854 ms 17608 KB Output is correct
27 Correct 1801 ms 17644 KB Output is correct
28 Correct 1462 ms 20084 KB Output is correct
29 Correct 1599 ms 16076 KB Output is correct
30 Correct 1626 ms 18272 KB Output is correct
31 Correct 1790 ms 18096 KB Output is correct
32 Correct 1825 ms 18100 KB Output is correct
33 Correct 1671 ms 17012 KB Output is correct
34 Correct 1827 ms 17120 KB Output is correct
35 Correct 1791 ms 17820 KB Output is correct
36 Correct 1390 ms 16080 KB Output is correct
37 Correct 1664 ms 18496 KB Output is correct
38 Correct 1673 ms 16200 KB Output is correct
39 Correct 1759 ms 17356 KB Output is correct
40 Correct 1837 ms 17240 KB Output is correct
41 Correct 156 ms 20228 KB Output is correct
42 Correct 154 ms 20176 KB Output is correct
43 Correct 177 ms 20036 KB Output is correct
44 Correct 212 ms 20040 KB Output is correct
45 Correct 150 ms 20176 KB Output is correct
46 Correct 207 ms 20080 KB Output is correct
47 Correct 199 ms 20032 KB Output is correct
48 Correct 131 ms 20328 KB Output is correct
49 Correct 146 ms 19944 KB Output is correct
50 Correct 150 ms 20180 KB Output is correct
51 Correct 197 ms 20088 KB Output is correct
52 Correct 310 ms 20108 KB Output is correct
53 Correct 148 ms 20048 KB Output is correct
54 Correct 229 ms 20008 KB Output is correct
55 Correct 196 ms 20052 KB Output is correct
56 Correct 153 ms 19952 KB Output is correct
57 Correct 145 ms 20072 KB Output is correct
58 Correct 155 ms 19912 KB Output is correct
59 Correct 189 ms 20104 KB Output is correct
60 Correct 195 ms 20020 KB Output is correct
61 Correct 171 ms 20072 KB Output is correct
62 Correct 268 ms 20076 KB Output is correct
63 Correct 229 ms 20036 KB Output is correct
64 Correct 137 ms 19916 KB Output is correct
65 Correct 200 ms 20048 KB Output is correct
66 Correct 220 ms 20040 KB Output is correct
67 Correct 181 ms 20048 KB Output is correct
68 Correct 187 ms 20028 KB Output is correct
69 Correct 187 ms 20036 KB Output is correct
70 Correct 188 ms 20084 KB Output is correct
71 Correct 1887 ms 44528 KB Output is correct
72 Correct 1977 ms 44560 KB Output is correct
73 Execution timed out 2078 ms 39088 KB Time limit exceeded
74 Halted 0 ms 0 KB -