oj.uz

Submission #489401

# Submission time Handle Problem Language Result Execution time Memory
489401 2021-11-22T20:30:26 Z arwaeystoamneg Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 23072 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);
			int cur = mask1;
			F0R(mask, 1 << m)
			{
				if (popcount(mask) & 1)ans -= super[cur];
				else ans += super[cur];
				int t = 0;
				while (t < m)
				{
					if (cur & (1 << zero[t]))
					{
						cur ^= (1 << zero[t]);
						t++;
					}
					else
					{
						cur ^= (1 << zero[t]);
						break;
					}
				}
			}

		}
		else if (sz(one) <= n / 3)
		{
			int mask1 = 0;
			trav(x, quest)mask1 ^= (1 << x);
			int m = sz(one);
			int cur = mask1;
			F0R(mask, 1 << m)
			{
				if (popcount(mask) & 1)ans -= sub[cur];
				else ans += sub[cur];
				int t = 0;
				while (t < m)
				{
					if (cur & (1 << one[t]))
					{
						cur ^= (1 << one[t]);
						t++;
					}
					else
					{
						cur ^= (1 << one[t]);
						break;
					}
				}
			}

		}
		else
		{
			int mask1 = 0;
			trav(x, one)mask1 ^= (1 << x);
			int m = sz(quest);
			int cur = mask1;
			F0R(mask, 1 << m)
			{

				int t = 0;
				while (t < m)
				{
					if (cur & (1 << quest[t]))
					{
						cur ^= (1 << quest[t]);
						t++;
					}
					else
					{
						cur ^= (1 << quest[t]);
						break;
					}
				}
				ans += a[cur] - '0';
			}
		}
		cout << abs(ans) << endl;
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 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 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1596 ms 6804 KB Output is correct
12 Correct 1571 ms 6420 KB Output is correct
13 Correct 1633 ms 5776 KB Output is correct
14 Correct 1664 ms 5832 KB Output is correct
15 Correct 1574 ms 6816 KB Output is correct
16 Correct 1817 ms 6080 KB Output is correct
17 Correct 1689 ms 5952 KB Output is correct
18 Correct 1446 ms 7864 KB Output is correct
19 Correct 1615 ms 4752 KB Output is correct
20 Correct 1646 ms 6448 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 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1596 ms 6804 KB Output is correct
12 Correct 1571 ms 6420 KB Output is correct
13 Correct 1633 ms 5776 KB Output is correct
14 Correct 1664 ms 5832 KB Output is correct
15 Correct 1574 ms 6816 KB Output is correct
16 Correct 1817 ms 6080 KB Output is correct
17 Correct 1689 ms 5952 KB Output is correct
18 Correct 1446 ms 7864 KB Output is correct
19 Correct 1615 ms 4752 KB Output is correct
20 Correct 1646 ms 6448 KB Output is correct
21 Correct 1630 ms 6992 KB Output is correct
22 Correct 1695 ms 7148 KB Output is correct
23 Correct 1788 ms 6060 KB Output is correct
24 Correct 1839 ms 5896 KB Output is correct
25 Correct 1668 ms 7872 KB Output is correct
26 Correct 1896 ms 6336 KB Output is correct
27 Correct 1910 ms 6240 KB Output is correct
28 Correct 1498 ms 8840 KB Output is correct
29 Correct 1739 ms 4648 KB Output is correct
30 Correct 1630 ms 6852 KB Output is correct
31 Correct 1820 ms 6588 KB Output is correct
32 Correct 1842 ms 6488 KB Output is correct
33 Correct 1822 ms 5384 KB Output is correct
34 Correct 1813 ms 5420 KB Output is correct
35 Correct 1790 ms 5880 KB Output is correct
36 Correct 1521 ms 4308 KB Output is correct
37 Correct 1753 ms 6320 KB Output is correct
38 Correct 1713 ms 4348 KB Output is correct
39 Correct 1755 ms 5344 KB Output is correct
40 Correct 1778 ms 5200 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 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 148 ms 19652 KB Output is correct
12 Correct 142 ms 19800 KB Output is correct
13 Correct 166 ms 19660 KB Output is correct
14 Correct 202 ms 19892 KB Output is correct
15 Correct 152 ms 19776 KB Output is correct
16 Correct 203 ms 19648 KB Output is correct
17 Correct 182 ms 19636 KB Output is correct
18 Correct 132 ms 19972 KB Output is correct
19 Correct 138 ms 19544 KB Output is correct
20 Correct 137 ms 19656 KB Output is correct
21 Correct 162 ms 19660 KB Output is correct
22 Correct 218 ms 19556 KB Output is correct
23 Correct 146 ms 19552 KB Output is correct
24 Correct 243 ms 19656 KB Output is correct
25 Correct 187 ms 19800 KB Output is correct
26 Correct 126 ms 19476 KB Output is correct
27 Correct 156 ms 19580 KB Output is correct
28 Correct 139 ms 19428 KB Output is correct
29 Correct 172 ms 19556 KB Output is correct
30 Correct 159 ms 19600 KB Output is correct
31 Correct 145 ms 19396 KB Output is correct
32 Correct 204 ms 19556 KB Output is correct
33 Correct 181 ms 19468 KB Output is correct
34 Correct 126 ms 19312 KB Output is correct
35 Correct 168 ms 19376 KB Output is correct
36 Correct 165 ms 19600 KB Output is correct
37 Correct 171 ms 19404 KB Output is correct
38 Correct 167 ms 19468 KB Output is correct
39 Correct 166 ms 19404 KB Output is correct
40 Correct 173 ms 19664 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 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1596 ms 6804 KB Output is correct
12 Correct 1571 ms 6420 KB Output is correct
13 Correct 1633 ms 5776 KB Output is correct
14 Correct 1664 ms 5832 KB Output is correct
15 Correct 1574 ms 6816 KB Output is correct
16 Correct 1817 ms 6080 KB Output is correct
17 Correct 1689 ms 5952 KB Output is correct
18 Correct 1446 ms 7864 KB Output is correct
19 Correct 1615 ms 4752 KB Output is correct
20 Correct 1646 ms 6448 KB Output is correct
21 Correct 1630 ms 6992 KB Output is correct
22 Correct 1695 ms 7148 KB Output is correct
23 Correct 1788 ms 6060 KB Output is correct
24 Correct 1839 ms 5896 KB Output is correct
25 Correct 1668 ms 7872 KB Output is correct
26 Correct 1896 ms 6336 KB Output is correct
27 Correct 1910 ms 6240 KB Output is correct
28 Correct 1498 ms 8840 KB Output is correct
29 Correct 1739 ms 4648 KB Output is correct
30 Correct 1630 ms 6852 KB Output is correct
31 Correct 1820 ms 6588 KB Output is correct
32 Correct 1842 ms 6488 KB Output is correct
33 Correct 1822 ms 5384 KB Output is correct
34 Correct 1813 ms 5420 KB Output is correct
35 Correct 1790 ms 5880 KB Output is correct
36 Correct 1521 ms 4308 KB Output is correct
37 Correct 1753 ms 6320 KB Output is correct
38 Correct 1713 ms 4348 KB Output is correct
39 Correct 1755 ms 5344 KB Output is correct
40 Correct 1778 ms 5200 KB Output is correct
41 Correct 148 ms 19652 KB Output is correct
42 Correct 142 ms 19800 KB Output is correct
43 Correct 166 ms 19660 KB Output is correct
44 Correct 202 ms 19892 KB Output is correct
45 Correct 152 ms 19776 KB Output is correct
46 Correct 203 ms 19648 KB Output is correct
47 Correct 182 ms 19636 KB Output is correct
48 Correct 132 ms 19972 KB Output is correct
49 Correct 138 ms 19544 KB Output is correct
50 Correct 137 ms 19656 KB Output is correct
51 Correct 162 ms 19660 KB Output is correct
52 Correct 218 ms 19556 KB Output is correct
53 Correct 146 ms 19552 KB Output is correct
54 Correct 243 ms 19656 KB Output is correct
55 Correct 187 ms 19800 KB Output is correct
56 Correct 126 ms 19476 KB Output is correct
57 Correct 156 ms 19580 KB Output is correct
58 Correct 139 ms 19428 KB Output is correct
59 Correct 172 ms 19556 KB Output is correct
60 Correct 159 ms 19600 KB Output is correct
61 Correct 145 ms 19396 KB Output is correct
62 Correct 204 ms 19556 KB Output is correct
63 Correct 181 ms 19468 KB Output is correct
64 Correct 126 ms 19312 KB Output is correct
65 Correct 168 ms 19376 KB Output is correct
66 Correct 165 ms 19600 KB Output is correct
67 Correct 171 ms 19404 KB Output is correct
68 Correct 167 ms 19468 KB Output is correct
69 Correct 166 ms 19404 KB Output is correct
70 Correct 173 ms 19664 KB Output is correct
71 Correct 1855 ms 22844 KB Output is correct
72 Correct 1943 ms 23072 KB Output is correct
73 Execution timed out 2084 ms 22492 KB Time limit exceeded
74 Halted 0 ms 0 KB -