oj.uz

답안 #966267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966267 2024-04-19T15:44:37 Z 8pete8 Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 45816 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];
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++;
	while(q--){
		cin>>a;
		reverse(all(a));
		int x=0,y=0;
		vector<int>o,z,c;
		for(int i=0;i<n;i++){
			if(a[i]=='1')x+=(1LL<<i),o.pb(i),y+=(1LL<<i);
			else if(a[i]=='?')x+=(1LL<<i),c.pb(i);
			else z.pb(i);
		}
		int m=0;
		int ans=0;
		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()){
			ans=dp1[x];
			m=o.size();
			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:61: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]
   61 |   if(c.size()<=root){//5 tl
      |      ~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4568 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 366 ms 14372 KB Output is correct
12 Correct 395 ms 13964 KB Output is correct
13 Correct 452 ms 13140 KB Output is correct
14 Correct 473 ms 13392 KB Output is correct
15 Correct 394 ms 14464 KB Output is correct
16 Correct 497 ms 13568 KB Output is correct
17 Correct 491 ms 16352 KB Output is correct
18 Correct 263 ms 18236 KB Output is correct
19 Correct 356 ms 15172 KB Output is correct
20 Correct 400 ms 16768 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4568 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 366 ms 14372 KB Output is correct
12 Correct 395 ms 13964 KB Output is correct
13 Correct 452 ms 13140 KB Output is correct
14 Correct 473 ms 13392 KB Output is correct
15 Correct 394 ms 14464 KB Output is correct
16 Correct 497 ms 13568 KB Output is correct
17 Correct 491 ms 16352 KB Output is correct
18 Correct 263 ms 18236 KB Output is correct
19 Correct 356 ms 15172 KB Output is correct
20 Correct 400 ms 16768 KB Output is correct
21 Correct 379 ms 19580 KB Output is correct
22 Correct 435 ms 19668 KB Output is correct
23 Correct 564 ms 18648 KB Output is correct
24 Correct 658 ms 18652 KB Output is correct
25 Correct 441 ms 20520 KB Output is correct
26 Correct 572 ms 18940 KB Output is correct
27 Correct 571 ms 15440 KB Output is correct
28 Correct 281 ms 17856 KB Output is correct
29 Correct 383 ms 14008 KB Output is correct
30 Correct 420 ms 16088 KB Output is correct
31 Correct 503 ms 16020 KB Output is correct
32 Correct 579 ms 15852 KB Output is correct
33 Correct 489 ms 14900 KB Output is correct
34 Correct 634 ms 15488 KB Output is correct
35 Correct 570 ms 15392 KB Output is correct
36 Correct 260 ms 13912 KB Output is correct
37 Correct 376 ms 15868 KB Output is correct
38 Correct 395 ms 14076 KB Output is correct
39 Correct 548 ms 15096 KB Output is correct
40 Correct 611 ms 14880 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4568 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 50 ms 27708 KB Output is correct
12 Correct 55 ms 27776 KB Output is correct
13 Correct 72 ms 27640 KB Output is correct
14 Correct 103 ms 27888 KB Output is correct
15 Correct 56 ms 27660 KB Output is correct
16 Correct 103 ms 27640 KB Output is correct
17 Correct 112 ms 27704 KB Output is correct
18 Correct 42 ms 27712 KB Output is correct
19 Correct 53 ms 27380 KB Output is correct
20 Correct 57 ms 28008 KB Output is correct
21 Correct 73 ms 27888 KB Output is correct
22 Correct 95 ms 27920 KB Output is correct
23 Correct 62 ms 27892 KB Output is correct
24 Correct 124 ms 27892 KB Output is correct
25 Correct 110 ms 27820 KB Output is correct
26 Correct 50 ms 27856 KB Output is correct
27 Correct 56 ms 27844 KB Output is correct
28 Correct 58 ms 27716 KB Output is correct
29 Correct 76 ms 27936 KB Output is correct
30 Correct 142 ms 28140 KB Output is correct
31 Correct 63 ms 27844 KB Output is correct
32 Correct 116 ms 27944 KB Output is correct
33 Correct 106 ms 27788 KB Output is correct
34 Correct 42 ms 27636 KB Output is correct
35 Correct 93 ms 27832 KB Output is correct
36 Correct 92 ms 27888 KB Output is correct
37 Correct 88 ms 27764 KB Output is correct
38 Correct 93 ms 27868 KB Output is correct
39 Correct 88 ms 27920 KB Output is correct
40 Correct 87 ms 27884 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4568 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 366 ms 14372 KB Output is correct
12 Correct 395 ms 13964 KB Output is correct
13 Correct 452 ms 13140 KB Output is correct
14 Correct 473 ms 13392 KB Output is correct
15 Correct 394 ms 14464 KB Output is correct
16 Correct 497 ms 13568 KB Output is correct
17 Correct 491 ms 16352 KB Output is correct
18 Correct 263 ms 18236 KB Output is correct
19 Correct 356 ms 15172 KB Output is correct
20 Correct 400 ms 16768 KB Output is correct
21 Correct 379 ms 19580 KB Output is correct
22 Correct 435 ms 19668 KB Output is correct
23 Correct 564 ms 18648 KB Output is correct
24 Correct 658 ms 18652 KB Output is correct
25 Correct 441 ms 20520 KB Output is correct
26 Correct 572 ms 18940 KB Output is correct
27 Correct 571 ms 15440 KB Output is correct
28 Correct 281 ms 17856 KB Output is correct
29 Correct 383 ms 14008 KB Output is correct
30 Correct 420 ms 16088 KB Output is correct
31 Correct 503 ms 16020 KB Output is correct
32 Correct 579 ms 15852 KB Output is correct
33 Correct 489 ms 14900 KB Output is correct
34 Correct 634 ms 15488 KB Output is correct
35 Correct 570 ms 15392 KB Output is correct
36 Correct 260 ms 13912 KB Output is correct
37 Correct 376 ms 15868 KB Output is correct
38 Correct 395 ms 14076 KB Output is correct
39 Correct 548 ms 15096 KB Output is correct
40 Correct 611 ms 14880 KB Output is correct
41 Correct 50 ms 27708 KB Output is correct
42 Correct 55 ms 27776 KB Output is correct
43 Correct 72 ms 27640 KB Output is correct
44 Correct 103 ms 27888 KB Output is correct
45 Correct 56 ms 27660 KB Output is correct
46 Correct 103 ms 27640 KB Output is correct
47 Correct 112 ms 27704 KB Output is correct
48 Correct 42 ms 27712 KB Output is correct
49 Correct 53 ms 27380 KB Output is correct
50 Correct 57 ms 28008 KB Output is correct
51 Correct 73 ms 27888 KB Output is correct
52 Correct 95 ms 27920 KB Output is correct
53 Correct 62 ms 27892 KB Output is correct
54 Correct 124 ms 27892 KB Output is correct
55 Correct 110 ms 27820 KB Output is correct
56 Correct 50 ms 27856 KB Output is correct
57 Correct 56 ms 27844 KB Output is correct
58 Correct 58 ms 27716 KB Output is correct
59 Correct 76 ms 27936 KB Output is correct
60 Correct 142 ms 28140 KB Output is correct
61 Correct 63 ms 27844 KB Output is correct
62 Correct 116 ms 27944 KB Output is correct
63 Correct 106 ms 27788 KB Output is correct
64 Correct 42 ms 27636 KB Output is correct
65 Correct 93 ms 27832 KB Output is correct
66 Correct 92 ms 27888 KB Output is correct
67 Correct 88 ms 27764 KB Output is correct
68 Correct 93 ms 27868 KB Output is correct
69 Correct 88 ms 27920 KB Output is correct
70 Correct 87 ms 27884 KB Output is correct
71 Correct 534 ms 42300 KB Output is correct
72 Correct 557 ms 42496 KB Output is correct
73 Correct 879 ms 41008 KB Output is correct
74 Correct 1332 ms 41672 KB Output is correct
75 Correct 610 ms 43420 KB Output is correct
76 Correct 1649 ms 41840 KB Output is correct
77 Correct 1758 ms 41624 KB Output is correct
78 Correct 349 ms 45816 KB Output is correct
79 Correct 540 ms 39788 KB Output is correct
80 Correct 560 ms 42632 KB Output is correct
81 Correct 873 ms 42568 KB Output is correct
82 Correct 1402 ms 41696 KB Output is correct
83 Correct 717 ms 40836 KB Output is correct
84 Execution timed out 2015 ms 41632 KB Time limit exceeded
85 Halted 0 ms 0 KB -