oj.uz

답안 #966283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966283 2024-04-19T16:08:56 Z 8pete8 Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 53836 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
#include <cstdlib> 
#include <cstdint>
using namespace std;
#define ll long long
#define f first
//#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
#define double long double
const int mod=998244353,mxn=3e5+5,lg=60,inf=1e18,minf=-1e18,Mxn=1e6+50000;
int dp1[Mxn+10],dp0[Mxn+10],cost[Mxn+10],rdp0[mxn+10];
int32_t main(){
	fastio
	int n,q;cin>>n>>q;
	string a;cin>>a;
	for(int i=0;i<(1LL<<n);i++)cost[i]=dp1[i]=dp0[i]=(a[i]-'0');
	for(int i=0;i<n;i++)for(int j=0;j<(1LL<<n);j++)if(j&(1LL<<i))dp1[j]+=dp1[j^(1LL<<i)];
	for(int i=0;i<n;i++)for(int j=(1LL<<n)-1;j>=0;j--)if(!(j&(1LL<<i)))dp0[j]+=dp0[j+(1LL<<i)];
	int root=sqrt(n);
	root++;
	auto change=[&](int x){
		int k=0;
		for(int i=0;i<n;i++)if(!(x&(1LL<<i)))k+=1LL<<i;
		return k;
	};
	//for(int i=0;i<(1LL<<n);i++)rdp0[change(i)]=dp0[i];
	while(q--){
		cin>>a;
		reverse(all(a));
		int x=0,y=0;
		vector<int>o,z,c;
		int bro=0;
		for(int i=0;i<n;i++){
			if(a[i]=='1')x+=(1LL<<i),o.pb(i),y+=(1LL<<i);
			else if(a[i]=='?')c.pb(i),bro+=(1LL<<i),x+=(1LL<<i);
			else z.pb(i);
		}
		int m=0;
		int ans=0,g;
		if(c.size()<=root){//5 tl
			m=c.size();
			for(int i=0;i<(1LL<<m);i++){
				for(int j=0;j<m;j++)if((i&(1LL<<j))==0)x-=(1LL<<c[j]);
				ans+=cost[x];
				for(int j=0;j<m;j++)if((i&(1LL<<j))==0)x+=(1LL<<c[j]);
			}
		}
		else if(o.size()<z.size()){
			m=o.size();
			x-=bro;
			g=x;
			while(1){
				if((m-__builtin_popcount(g))%2)ans-=dp1[g+bro];
				else ans+=dp1[g+bro];
				if(g==0)break;
				g=(g-1)&x;
			}
			/*
			for(int i=0;i<(1LL<<m)-1;i++){
				int cnt=0;
				for(int j=0;j<m;j++)if((i&(1LL<<j))==0)x-=(1LL<<o[j]),cnt++;
				if(cnt%2)ans-=dp1[x];
				else ans+=dp1[x];
				for(int j=0;j<m;j++)if((i&(1LL<<j))==0)x+=(1LL<<o[j]);
			}*/
		}
		else{
			ans=dp0[y];
			m=z.size();
			for(int i=1;i<(1LL<<m);i++){
				int cnt=0;
				for(int j=0;j<m;j++)if((i&(1LL<<j)))y+=(1LL<<z[j]),cnt++;
				if(cnt%2)ans-=dp0[y];
				else ans+=dp0[y];
				for(int j=0;j<m;j++)if((i&(1LL<<j)))y-=(1LL<<z[j]);
			}
		}
		cout<<ans<<'\n';
		//return 0;
		//cout<<dp1[x]<<" "<<dp0[y]<<'\n';
	}
}
/*
if cnt? <= sqrt(m) we can do (2^4)? bruteforce (maybe even 5)
else we can do sos dp and somehow remove the overcount
we can turn all ? into one and get sos of that bit
overcount when "1" bit that is originaly turned on switch to 0(for subset)
we can switch them off and subtract from the original answer so it cost 2^(cnt1){
	we need to somehow do pie
	starting from original answer-> if we turn off 1 bit
	ans-(turn of x bit)-(turn of y bit)+(turn of x and y bit)
	so if cnt%2==1 then we subtract
	else we add back in
}
cnt1 can be at most 16,worst case is all 1 (2^16)
we can also do sos dp where 0 is now the "switchable" value
so if cnt0<cnt1 we take do from 0 dp else from 1
tc-> worst case q*(2^m)*m
pre com time is m*(2^m+1)
q*(x*(2^x)+(2^(m-x)/2))
*/

Compilation message

snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:68:14: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   68 |   if(c.size()<=root){//5 tl
      |      ~~~~~~~~^~~~~~
snake_escaping.cpp:49:7: warning: variable 'change' set but not used [-Wunused-but-set-variable]
   49 |  auto change=[&](int x){
      |       ^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6616 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6636 KB Output is correct
10 Correct 1 ms 6616 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6616 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6636 KB Output is correct
10 Correct 1 ms 6616 KB Output is correct
11 Correct 368 ms 21600 KB Output is correct
12 Correct 379 ms 20820 KB Output is correct
13 Correct 439 ms 20048 KB Output is correct
14 Correct 470 ms 20324 KB Output is correct
15 Correct 374 ms 21288 KB Output is correct
16 Correct 479 ms 20528 KB Output is correct
17 Correct 470 ms 20424 KB Output is correct
18 Correct 253 ms 22180 KB Output is correct
19 Correct 366 ms 19240 KB Output is correct
20 Correct 439 ms 20820 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6616 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6636 KB Output is correct
10 Correct 1 ms 6616 KB Output is correct
11 Correct 368 ms 21600 KB Output is correct
12 Correct 379 ms 20820 KB Output is correct
13 Correct 439 ms 20048 KB Output is correct
14 Correct 470 ms 20324 KB Output is correct
15 Correct 374 ms 21288 KB Output is correct
16 Correct 479 ms 20528 KB Output is correct
17 Correct 470 ms 20424 KB Output is correct
18 Correct 253 ms 22180 KB Output is correct
19 Correct 366 ms 19240 KB Output is correct
20 Correct 439 ms 20820 KB Output is correct
21 Correct 384 ms 24116 KB Output is correct
22 Correct 421 ms 24500 KB Output is correct
23 Correct 555 ms 23292 KB Output is correct
24 Correct 614 ms 23120 KB Output is correct
25 Correct 422 ms 25168 KB Output is correct
26 Correct 641 ms 23572 KB Output is correct
27 Correct 567 ms 23804 KB Output is correct
28 Correct 277 ms 26124 KB Output is correct
29 Correct 392 ms 22220 KB Output is correct
30 Correct 413 ms 24464 KB Output is correct
31 Correct 529 ms 24088 KB Output is correct
32 Correct 619 ms 24244 KB Output is correct
33 Correct 480 ms 23212 KB Output is correct
34 Correct 629 ms 23212 KB Output is correct
35 Correct 560 ms 23764 KB Output is correct
36 Correct 274 ms 22240 KB Output is correct
37 Correct 376 ms 24144 KB Output is correct
38 Correct 402 ms 22136 KB Output is correct
39 Correct 580 ms 23300 KB Output is correct
40 Correct 608 ms 23168 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6616 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6636 KB Output is correct
10 Correct 1 ms 6616 KB Output is correct
11 Correct 54 ms 28672 KB Output is correct
12 Correct 56 ms 28660 KB Output is correct
13 Correct 81 ms 28404 KB Output is correct
14 Correct 72 ms 28440 KB Output is correct
15 Correct 55 ms 28672 KB Output is correct
16 Correct 137 ms 28576 KB Output is correct
17 Correct 98 ms 28912 KB Output is correct
18 Correct 40 ms 28816 KB Output is correct
19 Correct 53 ms 28356 KB Output is correct
20 Correct 55 ms 28660 KB Output is correct
21 Correct 67 ms 28680 KB Output is correct
22 Correct 97 ms 28512 KB Output is correct
23 Correct 65 ms 28400 KB Output is correct
24 Correct 122 ms 28424 KB Output is correct
25 Correct 98 ms 28564 KB Output is correct
26 Correct 42 ms 28448 KB Output is correct
27 Correct 56 ms 28488 KB Output is correct
28 Correct 56 ms 28300 KB Output is correct
29 Correct 70 ms 28516 KB Output is correct
30 Correct 146 ms 28528 KB Output is correct
31 Correct 58 ms 28404 KB Output is correct
32 Correct 104 ms 28428 KB Output is correct
33 Correct 104 ms 28412 KB Output is correct
34 Correct 39 ms 28400 KB Output is correct
35 Correct 88 ms 28420 KB Output is correct
36 Correct 84 ms 28580 KB Output is correct
37 Correct 84 ms 28404 KB Output is correct
38 Correct 88 ms 28628 KB Output is correct
39 Correct 92 ms 28400 KB Output is correct
40 Correct 86 ms 28404 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6616 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6636 KB Output is correct
10 Correct 1 ms 6616 KB Output is correct
11 Correct 368 ms 21600 KB Output is correct
12 Correct 379 ms 20820 KB Output is correct
13 Correct 439 ms 20048 KB Output is correct
14 Correct 470 ms 20324 KB Output is correct
15 Correct 374 ms 21288 KB Output is correct
16 Correct 479 ms 20528 KB Output is correct
17 Correct 470 ms 20424 KB Output is correct
18 Correct 253 ms 22180 KB Output is correct
19 Correct 366 ms 19240 KB Output is correct
20 Correct 439 ms 20820 KB Output is correct
21 Correct 384 ms 24116 KB Output is correct
22 Correct 421 ms 24500 KB Output is correct
23 Correct 555 ms 23292 KB Output is correct
24 Correct 614 ms 23120 KB Output is correct
25 Correct 422 ms 25168 KB Output is correct
26 Correct 641 ms 23572 KB Output is correct
27 Correct 567 ms 23804 KB Output is correct
28 Correct 277 ms 26124 KB Output is correct
29 Correct 392 ms 22220 KB Output is correct
30 Correct 413 ms 24464 KB Output is correct
31 Correct 529 ms 24088 KB Output is correct
32 Correct 619 ms 24244 KB Output is correct
33 Correct 480 ms 23212 KB Output is correct
34 Correct 629 ms 23212 KB Output is correct
35 Correct 560 ms 23764 KB Output is correct
36 Correct 274 ms 22240 KB Output is correct
37 Correct 376 ms 24144 KB Output is correct
38 Correct 402 ms 22136 KB Output is correct
39 Correct 580 ms 23300 KB Output is correct
40 Correct 608 ms 23168 KB Output is correct
41 Correct 54 ms 28672 KB Output is correct
42 Correct 56 ms 28660 KB Output is correct
43 Correct 81 ms 28404 KB Output is correct
44 Correct 72 ms 28440 KB Output is correct
45 Correct 55 ms 28672 KB Output is correct
46 Correct 137 ms 28576 KB Output is correct
47 Correct 98 ms 28912 KB Output is correct
48 Correct 40 ms 28816 KB Output is correct
49 Correct 53 ms 28356 KB Output is correct
50 Correct 55 ms 28660 KB Output is correct
51 Correct 67 ms 28680 KB Output is correct
52 Correct 97 ms 28512 KB Output is correct
53 Correct 65 ms 28400 KB Output is correct
54 Correct 122 ms 28424 KB Output is correct
55 Correct 98 ms 28564 KB Output is correct
56 Correct 42 ms 28448 KB Output is correct
57 Correct 56 ms 28488 KB Output is correct
58 Correct 56 ms 28300 KB Output is correct
59 Correct 70 ms 28516 KB Output is correct
60 Correct 146 ms 28528 KB Output is correct
61 Correct 58 ms 28404 KB Output is correct
62 Correct 104 ms 28428 KB Output is correct
63 Correct 104 ms 28412 KB Output is correct
64 Correct 39 ms 28400 KB Output is correct
65 Correct 88 ms 28420 KB Output is correct
66 Correct 84 ms 28580 KB Output is correct
67 Correct 84 ms 28404 KB Output is correct
68 Correct 88 ms 28628 KB Output is correct
69 Correct 92 ms 28400 KB Output is correct
70 Correct 86 ms 28404 KB Output is correct
71 Correct 538 ms 53136 KB Output is correct
72 Correct 551 ms 53000 KB Output is correct
73 Correct 924 ms 51568 KB Output is correct
74 Correct 916 ms 51804 KB Output is correct
75 Correct 605 ms 53836 KB Output is correct
76 Correct 1587 ms 32336 KB Output is correct
77 Correct 1518 ms 30364 KB Output is correct
78 Correct 320 ms 34396 KB Output is correct
79 Correct 563 ms 28288 KB Output is correct
80 Correct 607 ms 31472 KB Output is correct
81 Correct 911 ms 31220 KB Output is correct
82 Correct 1399 ms 30352 KB Output is correct
83 Correct 735 ms 29576 KB Output is correct
84 Correct 1724 ms 30388 KB Output is correct
85 Correct 1486 ms 51956 KB Output is correct
86 Correct 344 ms 49908 KB Output is correct
87 Correct 560 ms 52916 KB Output is correct
88 Correct 602 ms 49784 KB Output is correct
89 Correct 933 ms 51600 KB Output is correct
90 Execution timed out 2051 ms 46724 KB Time limit exceeded
91 Halted 0 ms 0 KB -