oj.uz

Submission #964785

# Submission time Handle Problem Language Result Execution time Memory
964785 2024-04-17T14:27:46 Z Baytoro Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 40564 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_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	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: '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: 'int' and 'std::vector<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: '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 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 2 ms 348 KB Output is correct
5 Correct 3 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 348 KB Output is correct
10 Correct 3 ms 344 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 2 ms 348 KB Output is correct
5 Correct 3 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 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1268 ms 12940 KB Output is correct
12 Correct 1358 ms 12500 KB Output is correct
13 Correct 1429 ms 11604 KB Output is correct
14 Correct 1499 ms 11852 KB Output is correct
15 Correct 1474 ms 12676 KB Output is correct
16 Correct 1482 ms 12004 KB Output is correct
17 Correct 1482 ms 12020 KB Output is correct
18 Correct 1327 ms 13844 KB Output is correct
19 Correct 1331 ms 10896 KB Output is correct
20 Correct 1334 ms 12556 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 2 ms 348 KB Output is correct
5 Correct 3 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 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1268 ms 12940 KB Output is correct
12 Correct 1358 ms 12500 KB Output is correct
13 Correct 1429 ms 11604 KB Output is correct
14 Correct 1499 ms 11852 KB Output is correct
15 Correct 1474 ms 12676 KB Output is correct
16 Correct 1482 ms 12004 KB Output is correct
17 Correct 1482 ms 12020 KB Output is correct
18 Correct 1327 ms 13844 KB Output is correct
19 Correct 1331 ms 10896 KB Output is correct
20 Correct 1334 ms 12556 KB Output is correct
21 Correct 1381 ms 15140 KB Output is correct
22 Correct 1447 ms 15452 KB Output is correct
23 Correct 1542 ms 14536 KB Output is correct
24 Correct 1610 ms 14236 KB Output is correct
25 Correct 1442 ms 16224 KB Output is correct
26 Correct 1580 ms 14608 KB Output is correct
27 Correct 1537 ms 14644 KB Output is correct
28 Correct 1364 ms 17232 KB Output is correct
29 Correct 1432 ms 13160 KB Output is correct
30 Correct 1410 ms 15360 KB Output is correct
31 Correct 1529 ms 15164 KB Output is correct
32 Correct 1644 ms 15116 KB Output is correct
33 Correct 1476 ms 14012 KB Output is correct
34 Correct 1596 ms 14372 KB Output is correct
35 Correct 1617 ms 11084 KB Output is correct
36 Correct 1246 ms 9588 KB Output is correct
37 Correct 1389 ms 11616 KB Output is correct
38 Correct 1385 ms 9716 KB Output is correct
39 Correct 1539 ms 14392 KB Output is correct
40 Correct 1655 ms 14136 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 2 ms 348 KB Output is correct
5 Correct 3 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 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 102 ms 16116 KB Output is correct
12 Correct 105 ms 15972 KB Output is correct
13 Correct 112 ms 16144 KB Output is correct
14 Correct 144 ms 16116 KB Output is correct
15 Correct 102 ms 16180 KB Output is correct
16 Correct 154 ms 16312 KB Output is correct
17 Correct 152 ms 16116 KB Output is correct
18 Correct 89 ms 16320 KB Output is correct
19 Correct 98 ms 16108 KB Output is correct
20 Correct 121 ms 16220 KB Output is correct
21 Correct 120 ms 16128 KB Output is correct
22 Correct 150 ms 16104 KB Output is correct
23 Correct 120 ms 16104 KB Output is correct
24 Correct 139 ms 16096 KB Output is correct
25 Correct 130 ms 15932 KB Output is correct
26 Correct 89 ms 15860 KB Output is correct
27 Correct 98 ms 16032 KB Output is correct
28 Correct 102 ms 15856 KB Output is correct
29 Correct 136 ms 16080 KB Output is correct
30 Correct 139 ms 16112 KB Output is correct
31 Correct 106 ms 16116 KB Output is correct
32 Correct 138 ms 15968 KB Output is correct
33 Correct 145 ms 16060 KB Output is correct
34 Correct 87 ms 16060 KB Output is correct
35 Correct 124 ms 16164 KB Output is correct
36 Correct 136 ms 16116 KB Output is correct
37 Correct 142 ms 16112 KB Output is correct
38 Correct 119 ms 16160 KB Output is correct
39 Correct 131 ms 16164 KB Output is correct
40 Correct 123 ms 16112 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 2 ms 348 KB Output is correct
5 Correct 3 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 348 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1268 ms 12940 KB Output is correct
12 Correct 1358 ms 12500 KB Output is correct
13 Correct 1429 ms 11604 KB Output is correct
14 Correct 1499 ms 11852 KB Output is correct
15 Correct 1474 ms 12676 KB Output is correct
16 Correct 1482 ms 12004 KB Output is correct
17 Correct 1482 ms 12020 KB Output is correct
18 Correct 1327 ms 13844 KB Output is correct
19 Correct 1331 ms 10896 KB Output is correct
20 Correct 1334 ms 12556 KB Output is correct
21 Correct 1381 ms 15140 KB Output is correct
22 Correct 1447 ms 15452 KB Output is correct
23 Correct 1542 ms 14536 KB Output is correct
24 Correct 1610 ms 14236 KB Output is correct
25 Correct 1442 ms 16224 KB Output is correct
26 Correct 1580 ms 14608 KB Output is correct
27 Correct 1537 ms 14644 KB Output is correct
28 Correct 1364 ms 17232 KB Output is correct
29 Correct 1432 ms 13160 KB Output is correct
30 Correct 1410 ms 15360 KB Output is correct
31 Correct 1529 ms 15164 KB Output is correct
32 Correct 1644 ms 15116 KB Output is correct
33 Correct 1476 ms 14012 KB Output is correct
34 Correct 1596 ms 14372 KB Output is correct
35 Correct 1617 ms 11084 KB Output is correct
36 Correct 1246 ms 9588 KB Output is correct
37 Correct 1389 ms 11616 KB Output is correct
38 Correct 1385 ms 9716 KB Output is correct
39 Correct 1539 ms 14392 KB Output is correct
40 Correct 1655 ms 14136 KB Output is correct
41 Correct 102 ms 16116 KB Output is correct
42 Correct 105 ms 15972 KB Output is correct
43 Correct 112 ms 16144 KB Output is correct
44 Correct 144 ms 16116 KB Output is correct
45 Correct 102 ms 16180 KB Output is correct
46 Correct 154 ms 16312 KB Output is correct
47 Correct 152 ms 16116 KB Output is correct
48 Correct 89 ms 16320 KB Output is correct
49 Correct 98 ms 16108 KB Output is correct
50 Correct 121 ms 16220 KB Output is correct
51 Correct 120 ms 16128 KB Output is correct
52 Correct 150 ms 16104 KB Output is correct
53 Correct 120 ms 16104 KB Output is correct
54 Correct 139 ms 16096 KB Output is correct
55 Correct 130 ms 15932 KB Output is correct
56 Correct 89 ms 15860 KB Output is correct
57 Correct 98 ms 16032 KB Output is correct
58 Correct 102 ms 15856 KB Output is correct
59 Correct 136 ms 16080 KB Output is correct
60 Correct 139 ms 16112 KB Output is correct
61 Correct 106 ms 16116 KB Output is correct
62 Correct 138 ms 15968 KB Output is correct
63 Correct 145 ms 16060 KB Output is correct
64 Correct 87 ms 16060 KB Output is correct
65 Correct 124 ms 16164 KB Output is correct
66 Correct 136 ms 16116 KB Output is correct
67 Correct 142 ms 16112 KB Output is correct
68 Correct 119 ms 16160 KB Output is correct
69 Correct 131 ms 16164 KB Output is correct
70 Correct 123 ms 16112 KB Output is correct
71 Correct 1670 ms 35444 KB Output is correct
72 Correct 1700 ms 40564 KB Output is correct
73 Correct 1881 ms 39044 KB Output is correct
74 Execution timed out 2041 ms 35736 KB Time limit exceeded
75 Halted 0 ms 0 KB -