oj.uz

답안 #386142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386142 2021-04-05T19:17:45 Z CSQ31 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 40672 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
typedef pair<int,pii> P;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	int l,q;
	cin>>l>>q;
	vector<ll>sub(1<<(l+1)),sup(1<<(l+1));
	string snek;
	for(int i=0;i<(1<<l);i++){
		char c;cin>>c;
		sub[i]+=c-'0';
		sup[i]+=c-'0';
		snek+=c;
	}
	for(int i=0;i<l;i++){
		for(int j=0;j<(1<<l);j++){
			if(j&(1<<i))sub[j]+=sub[j^(1<<i)];
			else sup[j]+=sup[j^(1<<i)];
		}
	}
	while(q--){
		vector<int>a,b,c;
		string s;cin>>s;reverse(all(s));
		ll ans = 0;
		for(int i=0;i<l;i++){
			if(s[i] == '?')c.pb(i);
			if(s[i] == '0')a.pb(i);
			if(s[i] == '1')b.pb(i);
		}
		if(sz(c) <= 6){
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i]=='1')cur+=(1<<i);
			for(int i=0;i<(1<<sz(c));i++){
				ll ncur = cur;
				for(int j=0;j<sz(c);j++){
					if(i&(1<<j))ncur+=(1<<c[j]);
				}
				ans+=snek[ncur]-'0';
			}
		}
		else if(sz(a) <= 6){
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '1')cur+=(1<<i);
			for(int i=0;i<(1<<sz(a));i++){
				ll ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(a);j++){
					if(i&(1<<j)){ncur+=(1<<a[j]);cnt++;}
				}
				if(cnt&1)ans-=sup[ncur];
				else ans+=sup[ncur];
			}
		}else{
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '?')cur+=(1<<i);
			for(int mask=0;mask<(1<<sz(b));mask++){
				ll ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(b);j++){
					if(mask&(1<<j)){ncur+=(1<<b[j]);}
					else cnt++;
				}
				if(cnt&1)ans-=sub[ncur];
				else ans+=sub[ncur];
			}
		}
		cout<<ans<<'\n';
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 745 ms 10476 KB Output is correct
12 Correct 731 ms 9836 KB Output is correct
13 Correct 661 ms 9196 KB Output is correct
14 Correct 663 ms 9196 KB Output is correct
15 Correct 906 ms 10332 KB Output is correct
16 Correct 761 ms 9580 KB Output is correct
17 Correct 750 ms 9352 KB Output is correct
18 Correct 401 ms 11116 KB Output is correct
19 Correct 618 ms 8304 KB Output is correct
20 Correct 756 ms 9708 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 745 ms 10476 KB Output is correct
12 Correct 731 ms 9836 KB Output is correct
13 Correct 661 ms 9196 KB Output is correct
14 Correct 663 ms 9196 KB Output is correct
15 Correct 906 ms 10332 KB Output is correct
16 Correct 761 ms 9580 KB Output is correct
17 Correct 750 ms 9352 KB Output is correct
18 Correct 401 ms 11116 KB Output is correct
19 Correct 618 ms 8304 KB Output is correct
20 Correct 756 ms 9708 KB Output is correct
21 Correct 663 ms 9452 KB Output is correct
22 Correct 953 ms 9452 KB Output is correct
23 Correct 865 ms 8428 KB Output is correct
24 Correct 814 ms 8172 KB Output is correct
25 Correct 742 ms 10448 KB Output is correct
26 Correct 953 ms 8596 KB Output is correct
27 Correct 947 ms 8560 KB Output is correct
28 Correct 414 ms 10900 KB Output is correct
29 Correct 665 ms 7008 KB Output is correct
30 Correct 830 ms 9196 KB Output is correct
31 Correct 1090 ms 8940 KB Output is correct
32 Correct 892 ms 9068 KB Output is correct
33 Correct 726 ms 7764 KB Output is correct
34 Correct 824 ms 7788 KB Output is correct
35 Correct 950 ms 8428 KB Output is correct
36 Correct 408 ms 6892 KB Output is correct
37 Correct 926 ms 8940 KB Output is correct
38 Correct 696 ms 6764 KB Output is correct
39 Correct 876 ms 7916 KB Output is correct
40 Correct 818 ms 7896 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 132 ms 36704 KB Output is correct
12 Correct 141 ms 36704 KB Output is correct
13 Correct 143 ms 36576 KB Output is correct
14 Correct 207 ms 36704 KB Output is correct
15 Correct 141 ms 36704 KB Output is correct
16 Correct 182 ms 36576 KB Output is correct
17 Correct 172 ms 36576 KB Output is correct
18 Correct 108 ms 36832 KB Output is correct
19 Correct 132 ms 36560 KB Output is correct
20 Correct 134 ms 36704 KB Output is correct
21 Correct 160 ms 36704 KB Output is correct
22 Correct 185 ms 36576 KB Output is correct
23 Correct 137 ms 36576 KB Output is correct
24 Correct 155 ms 36576 KB Output is correct
25 Correct 176 ms 36576 KB Output is correct
26 Correct 108 ms 36448 KB Output is correct
27 Correct 133 ms 36704 KB Output is correct
28 Correct 129 ms 36448 KB Output is correct
29 Correct 147 ms 36576 KB Output is correct
30 Correct 152 ms 36576 KB Output is correct
31 Correct 135 ms 36576 KB Output is correct
32 Correct 193 ms 36672 KB Output is correct
33 Correct 174 ms 36704 KB Output is correct
34 Correct 108 ms 36448 KB Output is correct
35 Correct 161 ms 36576 KB Output is correct
36 Correct 157 ms 36576 KB Output is correct
37 Correct 162 ms 36576 KB Output is correct
38 Correct 160 ms 36576 KB Output is correct
39 Correct 162 ms 36576 KB Output is correct
40 Correct 160 ms 36576 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 745 ms 10476 KB Output is correct
12 Correct 731 ms 9836 KB Output is correct
13 Correct 661 ms 9196 KB Output is correct
14 Correct 663 ms 9196 KB Output is correct
15 Correct 906 ms 10332 KB Output is correct
16 Correct 761 ms 9580 KB Output is correct
17 Correct 750 ms 9352 KB Output is correct
18 Correct 401 ms 11116 KB Output is correct
19 Correct 618 ms 8304 KB Output is correct
20 Correct 756 ms 9708 KB Output is correct
21 Correct 663 ms 9452 KB Output is correct
22 Correct 953 ms 9452 KB Output is correct
23 Correct 865 ms 8428 KB Output is correct
24 Correct 814 ms 8172 KB Output is correct
25 Correct 742 ms 10448 KB Output is correct
26 Correct 953 ms 8596 KB Output is correct
27 Correct 947 ms 8560 KB Output is correct
28 Correct 414 ms 10900 KB Output is correct
29 Correct 665 ms 7008 KB Output is correct
30 Correct 830 ms 9196 KB Output is correct
31 Correct 1090 ms 8940 KB Output is correct
32 Correct 892 ms 9068 KB Output is correct
33 Correct 726 ms 7764 KB Output is correct
34 Correct 824 ms 7788 KB Output is correct
35 Correct 950 ms 8428 KB Output is correct
36 Correct 408 ms 6892 KB Output is correct
37 Correct 926 ms 8940 KB Output is correct
38 Correct 696 ms 6764 KB Output is correct
39 Correct 876 ms 7916 KB Output is correct
40 Correct 818 ms 7896 KB Output is correct
41 Correct 132 ms 36704 KB Output is correct
42 Correct 141 ms 36704 KB Output is correct
43 Correct 143 ms 36576 KB Output is correct
44 Correct 207 ms 36704 KB Output is correct
45 Correct 141 ms 36704 KB Output is correct
46 Correct 182 ms 36576 KB Output is correct
47 Correct 172 ms 36576 KB Output is correct
48 Correct 108 ms 36832 KB Output is correct
49 Correct 132 ms 36560 KB Output is correct
50 Correct 134 ms 36704 KB Output is correct
51 Correct 160 ms 36704 KB Output is correct
52 Correct 185 ms 36576 KB Output is correct
53 Correct 137 ms 36576 KB Output is correct
54 Correct 155 ms 36576 KB Output is correct
55 Correct 176 ms 36576 KB Output is correct
56 Correct 108 ms 36448 KB Output is correct
57 Correct 133 ms 36704 KB Output is correct
58 Correct 129 ms 36448 KB Output is correct
59 Correct 147 ms 36576 KB Output is correct
60 Correct 152 ms 36576 KB Output is correct
61 Correct 135 ms 36576 KB Output is correct
62 Correct 193 ms 36672 KB Output is correct
63 Correct 174 ms 36704 KB Output is correct
64 Correct 108 ms 36448 KB Output is correct
65 Correct 161 ms 36576 KB Output is correct
66 Correct 157 ms 36576 KB Output is correct
67 Correct 162 ms 36576 KB Output is correct
68 Correct 160 ms 36576 KB Output is correct
69 Correct 162 ms 36576 KB Output is correct
70 Correct 160 ms 36576 KB Output is correct
71 Correct 1074 ms 40612 KB Output is correct
72 Correct 1159 ms 40672 KB Output is correct
73 Correct 1342 ms 39136 KB Output is correct
74 Execution timed out 2063 ms 38856 KB Time limit exceeded
75 Halted 0 ms 0 KB -