oj.uz

Submission #964806

# Submission time Handle Problem Language Result Execution time Memory
964806 2024-04-17T15:14:18 Z Baytoro Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 52840 KB 
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
//#define mp make_pair
#define ll long long
#define int ll
//#define double long double
//const ll INF=1e18,N=1e6+5;
int dp[(1<<20)+5][2];
void solve(){
	int n,q;cin>>n>>q;
	string s;cin>>s;
	vector<int> a((1<<n)+5);
	for(int i=0;i<(1<<n);i++) a[i]=(s[i]-'0');
	for(int i=0;i<(1<<n);i++) dp[i][0]=dp[i][1]=a[i];
	for(int i=0;i<n;i++){
		for(int mask=0;mask<(1<<n);mask++){
			if(mask&(1<<i)) dp[mask][0]+=dp[mask^(1<<i)][0];
			else dp[mask][1]+=dp[mask^(1<<i)][1];
		}
	}
	while(q--){
		string st;cin>>st;reverse(all(st));
		int z=0,o=0,u=0;
		for(int i=0;i<st.size();i++){
			if(st[i]=='?') u++;
			else if(st[i]=='0') z++;
			else o++;
		}
		int sum=0,ans=0;
		vector<int> tmp;
		if(u<=z && u<=o){
			for(int i=0;i<n;i++){
				if(st[i]=='1') sum+=(1<<i);
				if(st[i]=='?') tmp.pb(1<<i);
			}
			for(int i=0;i<(1<<tmp.size());i++){
				int tmpsum=sum;
				for(int j=0;j<tmp.size();j++){
					if(i&(1<<j)) tmpsum+=tmp[j];
				}
				ans+=a[tmpsum];
			}
		}
		else if(o<=z && o<=u){
			for(int i=0;i<n;i++){
				if(st[i]=='1' || st[i]=='?') sum+=(1<<i);
				if(st[i]=='1') tmp.pb(1<<i);
			}
			for(int i=0;i<(1<<tmp.size());i++){
				int tmpsum=sum,c=0;
				for(int j=0;j<tmp.size();j++){
					if(i&(1<<j)){
						tmpsum^=(tmp[j]);
						c++;
					}
				}
				if(c%2) c=-1;
				else c=1;
				ans+=c*dp[tmpsum][0];
			}
		}
		else{
			for(int i=0;i<n;i++){
				if(st[i]=='1') sum+=(1<<i);
				if(st[i]=='0') tmp.pb(1<<i);
			}
			for(int i=0;i<(1<<tmp.size());i++){
				int tmpsum=sum,c=0;
				for(int j=0;j<tmp.size();j++){
					if(!(i&(1<<j))){
						tmpsum^=(tmp[j]);
						c++;
					}
				}
				if(c%2) c=-1;
				else c=1;
				ans+=c*dp[tmpsum][1];
			}
		}
		cout<<ans<<endl;
	}
}
signed main(){
	ios;
	int t=1;//cin>>t;
	while(t--)
	solve();
}

Compilation message

snake_escaping.cpp: In function 'void solve()':
snake_escaping.cpp:30:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for(int i=0;i<st.size();i++){
      |               ~^~~~~~~~~~
snake_escaping.cpp:44:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int j=0;j<tmp.size();j++){
      |                 ~^~~~~~~~~~~
snake_escaping.cpp:57:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int j=0;j<tmp.size();j++){
      |                 ~^~~~~~~~~~~
snake_escaping.cpp:75:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int j=0;j<tmp.size();j++){
      |                 ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1295 ms 4308 KB Output is correct
12 Correct 1377 ms 4100 KB Output is correct
13 Correct 1393 ms 3264 KB Output is correct
14 Correct 1468 ms 3456 KB Output is correct
15 Correct 1433 ms 4472 KB Output is correct
16 Correct 1545 ms 14252 KB Output is correct
17 Correct 1499 ms 14224 KB Output is correct
18 Correct 1323 ms 16156 KB Output is correct
19 Correct 1246 ms 13004 KB Output is correct
20 Correct 1352 ms 14820 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1295 ms 4308 KB Output is correct
12 Correct 1377 ms 4100 KB Output is correct
13 Correct 1393 ms 3264 KB Output is correct
14 Correct 1468 ms 3456 KB Output is correct
15 Correct 1433 ms 4472 KB Output is correct
16 Correct 1545 ms 14252 KB Output is correct
17 Correct 1499 ms 14224 KB Output is correct
18 Correct 1323 ms 16156 KB Output is correct
19 Correct 1246 ms 13004 KB Output is correct
20 Correct 1352 ms 14820 KB Output is correct
21 Correct 1410 ms 18192 KB Output is correct
22 Correct 1378 ms 18476 KB Output is correct
23 Correct 1634 ms 17380 KB Output is correct
24 Correct 1584 ms 17332 KB Output is correct
25 Correct 1524 ms 19272 KB Output is correct
26 Correct 1579 ms 17900 KB Output is correct
27 Correct 1592 ms 17732 KB Output is correct
28 Correct 1278 ms 20332 KB Output is correct
29 Correct 1367 ms 16196 KB Output is correct
30 Correct 1400 ms 18488 KB Output is correct
31 Correct 1543 ms 18360 KB Output is correct
32 Correct 1648 ms 18244 KB Output is correct
33 Correct 1464 ms 17188 KB Output is correct
34 Correct 1616 ms 17120 KB Output is correct
35 Correct 1569 ms 17632 KB Output is correct
36 Correct 1338 ms 16284 KB Output is correct
37 Correct 1393 ms 18300 KB Output is correct
38 Correct 1379 ms 16144 KB Output is correct
39 Correct 1622 ms 17376 KB Output is correct
40 Correct 1617 ms 17272 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 126 ms 28228 KB Output is correct
12 Correct 113 ms 28500 KB Output is correct
13 Correct 161 ms 28408 KB Output is correct
14 Correct 212 ms 28304 KB Output is correct
15 Correct 131 ms 28484 KB Output is correct
16 Correct 179 ms 28488 KB Output is correct
17 Correct 164 ms 28404 KB Output is correct
18 Correct 103 ms 28516 KB Output is correct
19 Correct 119 ms 28144 KB Output is correct
20 Correct 126 ms 28748 KB Output is correct
21 Correct 131 ms 28340 KB Output is correct
22 Correct 202 ms 28404 KB Output is correct
23 Correct 126 ms 28260 KB Output is correct
24 Correct 174 ms 28448 KB Output is correct
25 Correct 174 ms 28268 KB Output is correct
26 Correct 98 ms 28340 KB Output is correct
27 Correct 123 ms 28336 KB Output is correct
28 Correct 113 ms 28340 KB Output is correct
29 Correct 169 ms 28248 KB Output is correct
30 Correct 163 ms 28620 KB Output is correct
31 Correct 113 ms 28340 KB Output is correct
32 Correct 195 ms 28484 KB Output is correct
33 Correct 173 ms 28680 KB Output is correct
34 Correct 98 ms 28172 KB Output is correct
35 Correct 152 ms 28400 KB Output is correct
36 Correct 143 ms 28468 KB Output is correct
37 Correct 162 ms 28480 KB Output is correct
38 Correct 139 ms 28264 KB Output is correct
39 Correct 145 ms 28480 KB Output is correct
40 Correct 146 ms 28404 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1295 ms 4308 KB Output is correct
12 Correct 1377 ms 4100 KB Output is correct
13 Correct 1393 ms 3264 KB Output is correct
14 Correct 1468 ms 3456 KB Output is correct
15 Correct 1433 ms 4472 KB Output is correct
16 Correct 1545 ms 14252 KB Output is correct
17 Correct 1499 ms 14224 KB Output is correct
18 Correct 1323 ms 16156 KB Output is correct
19 Correct 1246 ms 13004 KB Output is correct
20 Correct 1352 ms 14820 KB Output is correct
21 Correct 1410 ms 18192 KB Output is correct
22 Correct 1378 ms 18476 KB Output is correct
23 Correct 1634 ms 17380 KB Output is correct
24 Correct 1584 ms 17332 KB Output is correct
25 Correct 1524 ms 19272 KB Output is correct
26 Correct 1579 ms 17900 KB Output is correct
27 Correct 1592 ms 17732 KB Output is correct
28 Correct 1278 ms 20332 KB Output is correct
29 Correct 1367 ms 16196 KB Output is correct
30 Correct 1400 ms 18488 KB Output is correct
31 Correct 1543 ms 18360 KB Output is correct
32 Correct 1648 ms 18244 KB Output is correct
33 Correct 1464 ms 17188 KB Output is correct
34 Correct 1616 ms 17120 KB Output is correct
35 Correct 1569 ms 17632 KB Output is correct
36 Correct 1338 ms 16284 KB Output is correct
37 Correct 1393 ms 18300 KB Output is correct
38 Correct 1379 ms 16144 KB Output is correct
39 Correct 1622 ms 17376 KB Output is correct
40 Correct 1617 ms 17272 KB Output is correct
41 Correct 126 ms 28228 KB Output is correct
42 Correct 113 ms 28500 KB Output is correct
43 Correct 161 ms 28408 KB Output is correct
44 Correct 212 ms 28304 KB Output is correct
45 Correct 131 ms 28484 KB Output is correct
46 Correct 179 ms 28488 KB Output is correct
47 Correct 164 ms 28404 KB Output is correct
48 Correct 103 ms 28516 KB Output is correct
49 Correct 119 ms 28144 KB Output is correct
50 Correct 126 ms 28748 KB Output is correct
51 Correct 131 ms 28340 KB Output is correct
52 Correct 202 ms 28404 KB Output is correct
53 Correct 126 ms 28260 KB Output is correct
54 Correct 174 ms 28448 KB Output is correct
55 Correct 174 ms 28268 KB Output is correct
56 Correct 98 ms 28340 KB Output is correct
57 Correct 123 ms 28336 KB Output is correct
58 Correct 113 ms 28340 KB Output is correct
59 Correct 169 ms 28248 KB Output is correct
60 Correct 163 ms 28620 KB Output is correct
61 Correct 113 ms 28340 KB Output is correct
62 Correct 195 ms 28484 KB Output is correct
63 Correct 173 ms 28680 KB Output is correct
64 Correct 98 ms 28172 KB Output is correct
65 Correct 152 ms 28400 KB Output is correct
66 Correct 143 ms 28468 KB Output is correct
67 Correct 162 ms 28480 KB Output is correct
68 Correct 139 ms 28264 KB Output is correct
69 Correct 145 ms 28480 KB Output is correct
70 Correct 146 ms 28404 KB Output is correct
71 Correct 1584 ms 52796 KB Output is correct
72 Correct 1695 ms 52840 KB Output is correct
73 Execution timed out 2051 ms 50848 KB Time limit exceeded
74 Halted 0 ms 0 KB -