oj.uz

Submission #964803

# Submission time Handle Problem Language Result Execution time Memory
964803 2024-04-17T15:08:48 Z Baytoro Snake Escaping (JOI18_snake_escaping) C++17
58 / 100
 2000 ms 17408 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=(1<<20)+5;
int dp[N],dp2[N],a[N];
void solve(){
	int n,q;cin>>n>>q;
	string s;cin>>s;
	for(int i=0;i<(1<<n);i++) a[i]=(s[i]-'0');
	for(int i=0;i<(1<<n);i++) dp[i]=dp2[i]=a[i];
	for(int i=0;i<n;i++){
		for(int mask=0;mask<(1<<n);mask++){
			if(mask&(1<<i)) dp[mask]+=dp[mask^(1<<i)];
			else dp2[mask]+=dp2[mask^(1<<i)];
		}
	}
	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<=6){
			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];
			}
			cout<<ans<<endl;
		}
		else if(o<=6){
			for(int i=0;i<n;i++){
				if(st[i]=='1' || st[i]=='?') sum+=(1<<i);
				if(st[i]=='1') tmp.pb(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^=(1<<tmp[j]);
						c++;
					}
				}
				if(c%2) ans-=dp[tmpsum];
				else ans+=dp[tmpsum];
			}
			cout<<ans<<endl;
		}
		else{
			for(int i=0;i<n;i++){
				if(st[i]=='1') sum+=(1<<i);
				if(st[i]=='0') tmp.pb(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^=(1<<tmp[j]);
						c++;
					}
				}
				if(c%2) ans-=dp2[tmpsum];
				else ans+=dp2[tmpsum];
			}
			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:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for(int i=0;i<st.size();i++){
      |               ~^~~~~~~~~~
snake_escaping.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int j=0;j<tmp.size();j++){
      |                 ~^~~~~~~~~~~
snake_escaping.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<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: 'int' and 'std::vector<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 3 ms 4572 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4572 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 1752 ms 17408 KB Output is correct
12 Correct 1709 ms 17176 KB Output is correct
13 Correct 1463 ms 16196 KB Output is correct
14 Correct 1525 ms 16496 KB Output is correct
15 Execution timed out 2036 ms 17268 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4572 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 1752 ms 17408 KB Output is correct
12 Correct 1709 ms 17176 KB Output is correct
13 Correct 1463 ms 16196 KB Output is correct
14 Correct 1525 ms 16496 KB Output is correct
15 Execution timed out 2036 ms 17268 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4572 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 101 ms 16208 KB Output is correct
12 Correct 103 ms 16172 KB Output is correct
13 Correct 112 ms 15932 KB Output is correct
14 Correct 155 ms 16120 KB Output is correct
15 Correct 106 ms 16040 KB Output is correct
16 Correct 140 ms 15952 KB Output is correct
17 Correct 160 ms 16160 KB Output is correct
18 Correct 87 ms 16308 KB Output is correct
19 Correct 98 ms 15860 KB Output is correct
20 Correct 99 ms 16104 KB Output is correct
21 Correct 114 ms 16160 KB Output is correct
22 Correct 144 ms 15944 KB Output is correct
23 Correct 121 ms 15904 KB Output is correct
24 Correct 143 ms 16152 KB Output is correct
25 Correct 159 ms 16000 KB Output is correct
26 Correct 85 ms 15956 KB Output is correct
27 Correct 98 ms 16112 KB Output is correct
28 Correct 104 ms 15960 KB Output is correct
29 Correct 132 ms 16128 KB Output is correct
30 Correct 137 ms 15960 KB Output is correct
31 Correct 117 ms 16108 KB Output is correct
32 Correct 150 ms 15940 KB Output is correct
33 Correct 138 ms 16112 KB Output is correct
34 Correct 84 ms 15860 KB Output is correct
35 Correct 124 ms 16148 KB Output is correct
36 Correct 136 ms 16548 KB Output is correct
37 Correct 141 ms 16116 KB Output is correct
38 Correct 118 ms 15956 KB Output is correct
39 Correct 118 ms 16000 KB Output is correct
40 Correct 121 ms 15920 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4572 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 1752 ms 17408 KB Output is correct
12 Correct 1709 ms 17176 KB Output is correct
13 Correct 1463 ms 16196 KB Output is correct
14 Correct 1525 ms 16496 KB Output is correct
15 Execution timed out 2036 ms 17268 KB Time limit exceeded
16 Halted 0 ms 0 KB -