oj.uz

Submission #333952

# Submission time Handle Problem Language Result Execution time Memory
333952 2020-12-08T03:56:01 Z YJU Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 2000 ms 50684 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e6+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll dp[N],l,po[N],q,k,ans[N];
string s,a;
vector<pll> que[(1<<12)];

ll get3(ll val,ll ip){
	return (val/po[ip])%3;
}

void cal(ll id){
	REP(i,po[k]){
		ll tx=0,ck=1;
		REP(j,k){
			if(get3(i,k-j-1)==2){
				dp[i]=dp[i-2*po[k-j-1]]+dp[i-po[k-j-1]];
				ck=0;
				break;
			}
			tx=tx*2+get3(i,k-j-1);
		}
		if(ck)dp[i]=s[(id<<k)+tx]-'0';
	}
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>l>>q;
	cin>>s;
	k=min(l,12LL);
	po[0]=1;
	REP1(i,k)po[i]=po[i-1]*3;
	REP(T,q){
		cin>>a;
		ll tx=0;
		for(int i=l-k;i<l;i++)tx=tx*3+(a[i]=='?'?2:a[i]-'0');
		REP(i,(1<<(l-k))){
			bool ck=1;
			REP(j,l-k){
				if(a[j]=='?')continue;
				if((a[j]-'0')!=(1&(i>>(l-k-j-1)))){ck=0;break;}
			}
			if(ck){
				que[i].pb(mp(tx,T));
			}
		}
	}
	REP(i,(1<<(l-k))){
		cal(i);
		for(auto j:que[i]){
			ans[j.Y]+=dp[j.X];
		}
	}
	REP(i,q)cout<<ans[i]<<"\n";
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 2 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 2 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 250 ms 28600 KB Output is correct
12 Correct 265 ms 28344 KB Output is correct
13 Correct 278 ms 27636 KB Output is correct
14 Correct 237 ms 27576 KB Output is correct
15 Correct 245 ms 28600 KB Output is correct
16 Correct 264 ms 28096 KB Output is correct
17 Correct 251 ms 27704 KB Output is correct
18 Correct 218 ms 29624 KB Output is correct
19 Correct 206 ms 26552 KB Output is correct
20 Correct 264 ms 28344 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 2 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 2 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 250 ms 28600 KB Output is correct
12 Correct 265 ms 28344 KB Output is correct
13 Correct 278 ms 27636 KB Output is correct
14 Correct 237 ms 27576 KB Output is correct
15 Correct 245 ms 28600 KB Output is correct
16 Correct 264 ms 28096 KB Output is correct
17 Correct 251 ms 27704 KB Output is correct
18 Correct 218 ms 29624 KB Output is correct
19 Correct 206 ms 26552 KB Output is correct
20 Correct 264 ms 28344 KB Output is correct
21 Correct 308 ms 40840 KB Output is correct
22 Correct 321 ms 47796 KB Output is correct
23 Correct 299 ms 35716 KB Output is correct
24 Correct 299 ms 36100 KB Output is correct
25 Correct 312 ms 43136 KB Output is correct
26 Correct 316 ms 37252 KB Output is correct
27 Correct 313 ms 36992 KB Output is correct
28 Correct 279 ms 50684 KB Output is correct
29 Correct 242 ms 30616 KB Output is correct
30 Correct 322 ms 40488 KB Output is correct
31 Correct 325 ms 39764 KB Output is correct
32 Correct 304 ms 38532 KB Output is correct
33 Correct 287 ms 42588 KB Output is correct
34 Correct 293 ms 36480 KB Output is correct
35 Correct 314 ms 37248 KB Output is correct
36 Correct 253 ms 30684 KB Output is correct
37 Correct 309 ms 47800 KB Output is correct
38 Correct 239 ms 30636 KB Output is correct
39 Correct 295 ms 35972 KB Output is correct
40 Correct 313 ms 36356 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 2 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 2 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Execution timed out 2073 ms 28684 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 2 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 2 ms 1004 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 250 ms 28600 KB Output is correct
12 Correct 265 ms 28344 KB Output is correct
13 Correct 278 ms 27636 KB Output is correct
14 Correct 237 ms 27576 KB Output is correct
15 Correct 245 ms 28600 KB Output is correct
16 Correct 264 ms 28096 KB Output is correct
17 Correct 251 ms 27704 KB Output is correct
18 Correct 218 ms 29624 KB Output is correct
19 Correct 206 ms 26552 KB Output is correct
20 Correct 264 ms 28344 KB Output is correct
21 Correct 308 ms 40840 KB Output is correct
22 Correct 321 ms 47796 KB Output is correct
23 Correct 299 ms 35716 KB Output is correct
24 Correct 299 ms 36100 KB Output is correct
25 Correct 312 ms 43136 KB Output is correct
26 Correct 316 ms 37252 KB Output is correct
27 Correct 313 ms 36992 KB Output is correct
28 Correct 279 ms 50684 KB Output is correct
29 Correct 242 ms 30616 KB Output is correct
30 Correct 322 ms 40488 KB Output is correct
31 Correct 325 ms 39764 KB Output is correct
32 Correct 304 ms 38532 KB Output is correct
33 Correct 287 ms 42588 KB Output is correct
34 Correct 293 ms 36480 KB Output is correct
35 Correct 314 ms 37248 KB Output is correct
36 Correct 253 ms 30684 KB Output is correct
37 Correct 309 ms 47800 KB Output is correct
38 Correct 239 ms 30636 KB Output is correct
39 Correct 295 ms 35972 KB Output is correct
40 Correct 313 ms 36356 KB Output is correct
41 Execution timed out 2073 ms 28684 KB Time limit exceeded
42 Halted 0 ms 0 KB -