oj.uz

Submission #333912

# Submission time Handle Problem Language Result Execution time Memory
333912 2020-12-08T03:09:26 Z YJU Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 2000 ms 56248 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[1000];

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

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

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>l>>q>>s;
	k=min(l,13LL);
	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')!=(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 804 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 804 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 247 ms 30392 KB Output is correct
12 Correct 277 ms 30536 KB Output is correct
13 Correct 240 ms 29368 KB Output is correct
14 Correct 259 ms 29552 KB Output is correct
15 Correct 259 ms 30392 KB Output is correct
16 Correct 251 ms 29624 KB Output is correct
17 Correct 275 ms 29624 KB Output is correct
18 Correct 216 ms 31560 KB Output is correct
19 Correct 210 ms 28472 KB Output is correct
20 Correct 268 ms 30520 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 804 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 247 ms 30392 KB Output is correct
12 Correct 277 ms 30536 KB Output is correct
13 Correct 240 ms 29368 KB Output is correct
14 Correct 259 ms 29552 KB Output is correct
15 Correct 259 ms 30392 KB Output is correct
16 Correct 251 ms 29624 KB Output is correct
17 Correct 275 ms 29624 KB Output is correct
18 Correct 216 ms 31560 KB Output is correct
19 Correct 210 ms 28472 KB Output is correct
20 Correct 268 ms 30520 KB Output is correct
21 Correct 305 ms 54200 KB Output is correct
22 Correct 330 ms 54328 KB Output is correct
23 Correct 301 ms 53432 KB Output is correct
24 Correct 293 ms 53304 KB Output is correct
25 Correct 306 ms 55224 KB Output is correct
26 Correct 317 ms 53816 KB Output is correct
27 Correct 315 ms 53688 KB Output is correct
28 Correct 258 ms 56248 KB Output is correct
29 Correct 250 ms 52152 KB Output is correct
30 Correct 329 ms 54328 KB Output is correct
31 Correct 308 ms 54348 KB Output is correct
32 Correct 306 ms 54200 KB Output is correct
33 Correct 280 ms 53048 KB Output is correct
34 Correct 291 ms 53176 KB Output is correct
35 Correct 315 ms 53688 KB Output is correct
36 Correct 245 ms 52280 KB Output is correct
37 Correct 309 ms 54220 KB Output is correct
38 Correct 247 ms 52300 KB Output is correct
39 Correct 298 ms 53432 KB Output is correct
40 Correct 292 ms 53432 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 804 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Execution timed out 2080 ms 17292 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 804 KB Output is correct
2 Correct 2 ms 876 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 876 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 247 ms 30392 KB Output is correct
12 Correct 277 ms 30536 KB Output is correct
13 Correct 240 ms 29368 KB Output is correct
14 Correct 259 ms 29552 KB Output is correct
15 Correct 259 ms 30392 KB Output is correct
16 Correct 251 ms 29624 KB Output is correct
17 Correct 275 ms 29624 KB Output is correct
18 Correct 216 ms 31560 KB Output is correct
19 Correct 210 ms 28472 KB Output is correct
20 Correct 268 ms 30520 KB Output is correct
21 Correct 305 ms 54200 KB Output is correct
22 Correct 330 ms 54328 KB Output is correct
23 Correct 301 ms 53432 KB Output is correct
24 Correct 293 ms 53304 KB Output is correct
25 Correct 306 ms 55224 KB Output is correct
26 Correct 317 ms 53816 KB Output is correct
27 Correct 315 ms 53688 KB Output is correct
28 Correct 258 ms 56248 KB Output is correct
29 Correct 250 ms 52152 KB Output is correct
30 Correct 329 ms 54328 KB Output is correct
31 Correct 308 ms 54348 KB Output is correct
32 Correct 306 ms 54200 KB Output is correct
33 Correct 280 ms 53048 KB Output is correct
34 Correct 291 ms 53176 KB Output is correct
35 Correct 315 ms 53688 KB Output is correct
36 Correct 245 ms 52280 KB Output is correct
37 Correct 309 ms 54220 KB Output is correct
38 Correct 247 ms 52300 KB Output is correct
39 Correct 298 ms 53432 KB Output is correct
40 Correct 292 ms 53432 KB Output is correct
41 Execution timed out 2080 ms 17292 KB Time limit exceeded
42 Halted 0 ms 0 KB -