oj.uz

답안 #1114783

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114783 2024-11-19T15:25:53 Z Dan4Life Snake Escaping (JOI18_snake_escaping) C++17
5 / 100
 2000 ms 32324 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)

const int B1 = 7;
const int N = 1<<B1;
const int M = 1594324;
vector<array<int,2>> v, w[N];
string s;
int l, q, ans[M], dp[M];
int nx[2][M];

int calc(string lol){
	int p = 1, ans = 0, xd;
	for(int i = 0; i < sz(lol); i++){
		if(lol[i]=='?') xd=2;
		else xd = lol[i]-'0';
		ans+=xd*p, p*=3;
	}
	return ans;
}

int calc(int lol){
	int p = 1, ans = 0;
	for(int i = 0; i < B1; i++)
		ans+=(lol>>i&1)*p, p*=3;
	return ans;
}

int submask(int x, int y){
	for(int i = 0; i < 20; i++,x/=3, y/=3){
		int r1 = x%3, r2 = y%3;
		if(r1==2) continue;
		if(r1!=r2) return false;
	}
	return true;
}
int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> l >> q >> s;
	memset(nx,-1,sizeof(nx));
	for(int i = 0; i < M; i++){
		int xd = i, p = 1;
		while(xd){
			int r = xd%3;
			if(r==2){
				nx[0][i] = i-2*p;
				nx[1][i] = i-p; break;
			}
			xd/=3; p*=3;
		}
	}
	for(int mask = 0; mask < (1<<l); mask++){
		int m1 = 0, m2 = mask;
		if(l>B1) m1 = mask&((1<<B1)-1), m2>>=B1;
		w[m1].pb({calc(m2),s[mask]-'0'});
	}
	for(int i = 0; i < q; i++){
		string t; cin >> t; 
		reverse(all(t)); string x="";
		if(l>B1) x = t.substr(0,B1),t=t.substr(B1);
		v.pb({calc(x),calc(t)});
	}
	for(int _ = 0; _ < N; _++){
		if(!sz(v[_])) continue;
		memset(dp,0,sizeof(dp));
		for(auto [xd,sc] : w[_]) dp[xd]+=sc;
		for(int i = 0; i < M; i++)
			if(nx[0][i]!=-1) dp[i]+=dp[nx[0][i]]+dp[nx[1][i]];
		int z = calc(_);
		for(int i = 0; i < q; i++){
			auto [x,y] = v[i];
			if(submask(x,z)) ans[i]+=dp[y];
		}
	}
	for(int i = 0; i < q; i++) cout << ans[i] << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 21072 KB Output is correct
2 Correct 214 ms 21072 KB Output is correct
3 Correct 215 ms 21072 KB Output is correct
4 Correct 209 ms 21072 KB Output is correct
5 Correct 213 ms 21240 KB Output is correct
6 Correct 209 ms 21072 KB Output is correct
7 Correct 233 ms 21320 KB Output is correct
8 Correct 249 ms 21088 KB Output is correct
9 Correct 228 ms 21072 KB Output is correct
10 Correct 228 ms 21180 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 21072 KB Output is correct
2 Correct 214 ms 21072 KB Output is correct
3 Correct 215 ms 21072 KB Output is correct
4 Correct 209 ms 21072 KB Output is correct
5 Correct 213 ms 21240 KB Output is correct
6 Correct 209 ms 21072 KB Output is correct
7 Correct 233 ms 21320 KB Output is correct
8 Correct 249 ms 21088 KB Output is correct
9 Correct 228 ms 21072 KB Output is correct
10 Correct 228 ms 21180 KB Output is correct
11 Execution timed out 2055 ms 31412 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 21072 KB Output is correct
2 Correct 214 ms 21072 KB Output is correct
3 Correct 215 ms 21072 KB Output is correct
4 Correct 209 ms 21072 KB Output is correct
5 Correct 213 ms 21240 KB Output is correct
6 Correct 209 ms 21072 KB Output is correct
7 Correct 233 ms 21320 KB Output is correct
8 Correct 249 ms 21088 KB Output is correct
9 Correct 228 ms 21072 KB Output is correct
10 Correct 228 ms 21180 KB Output is correct
11 Execution timed out 2055 ms 31412 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 21072 KB Output is correct
2 Correct 214 ms 21072 KB Output is correct
3 Correct 215 ms 21072 KB Output is correct
4 Correct 209 ms 21072 KB Output is correct
5 Correct 213 ms 21240 KB Output is correct
6 Correct 209 ms 21072 KB Output is correct
7 Correct 233 ms 21320 KB Output is correct
8 Correct 249 ms 21088 KB Output is correct
9 Correct 228 ms 21072 KB Output is correct
10 Correct 228 ms 21180 KB Output is correct
11 Incorrect 442 ms 32324 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 21072 KB Output is correct
2 Correct 214 ms 21072 KB Output is correct
3 Correct 215 ms 21072 KB Output is correct
4 Correct 209 ms 21072 KB Output is correct
5 Correct 213 ms 21240 KB Output is correct
6 Correct 209 ms 21072 KB Output is correct
7 Correct 233 ms 21320 KB Output is correct
8 Correct 249 ms 21088 KB Output is correct
9 Correct 228 ms 21072 KB Output is correct
10 Correct 228 ms 21180 KB Output is correct
11 Execution timed out 2055 ms 31412 KB Time limit exceeded
12 Halted 0 ms 0 KB -