当前位置:网站首页>Winter messenger 2
Winter messenger 2
2022-07-05 06:19:00 【Strezia】
Link
Game theory ,sg function
I didn't understand the solution ,, Violence made a watch , At the beginning, I also operated 2 It's missing .
Looking at the solution means that every operation will make x x x Reduce , After doing several questions, I feel that if there are multiple operations , Then find the common ground of these operations , To write the transfer equation .
Code
int sg[1050];
int mex(vector<int> v) // v It can be vector、set Equal container
{
unordered_set<int> S;
for (auto e : v)
S.insert(e);
for (int i = 0;; ++i)
if (S.find(i) == S.end())
return i;
}
int cal(int x) {
if(sg[x] != -1) return sg[x];
int t = x;
vector<int> v;
if(t & 1) {
v.pb(cal(t - 1));
}
for(int i = 0; i < 10; i++) {
if(!(t >> i)) break;
if((t >> i) & 1) {
int p = x ^ (1<<i);
for(int j = i - 1; j >= 0; j--) {
int q = p ^ (1<<j);
v.pb(cal(q));
}
}
}
int a = mex(v);
return sg[x] = a;
}
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int a = 0;
for(int i = 0; i < n; i++) {
if(s[i] == 'w')
a = a + (1<<i);
}
if(sg[a]) cout << "Yes\n";
else cout << "No\n";
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
memset(sg, -1, sizeof(sg));
sg[0] = 0;
for(int i = 1; i <= 1030; i++)
cal(i);
int T; cin >> T; while(T--)
solve();
return 0;
}
边栏推荐
- [rust notes] 17 concurrent (Part 1)
- 打印机脱机时一种容易被忽略的原因
- Chart. JS - Format Y axis - chart js - Formatting Y axis
- Règlement sur la sécurité des réseaux dans les écoles professionnelles secondaires du concours de compétences des écoles professionnelles de la province de Guizhou en 2022
- Real time clock (RTC)
- liunx启动redis
- [rust notes] 13 iterator (Part 2)
- 【Rust 笔记】15-字符串与文本(下)
- QQ computer version cancels escape character input expression
- New title of module a of "PanYun Cup" secondary vocational network security skills competition
猜你喜欢
[2020]GRAF: Generative Radiance Fields for 3D-Aware Image Synthesis
MySQL advanced part 1: stored procedures and functions
Leetcode array operation
高斯消元 AcWing 884. 高斯消元解异或线性方程组
Data visualization chart summary (II)
[2021]IBRNet: Learning Multi-View Image-Based Rendering Qianqian
Operator priority, one catch, no doubt
LaMDA 不可能觉醒吗?
Sqlmap tutorial (1)
liunx启动redis
随机推荐
背包问题 AcWing 9. 分组背包问题
Overview of variable resistors - structure, operation and different applications
927. Trisection simulation
做 SQL 性能优化真是让人干瞪眼
[rust notes] 16 input and output (Part 2)
中国剩余定理 AcWing 204. 表达整数的奇怪方式
SQLMAP使用教程(一)
Operator priority, one catch, no doubt
1040 Longest Symmetric String
【LeetCode】Day95-有效的数独&矩阵置零
Leetcode backtracking method
Niu Mei's math problems
MIT-6874-Deep Learning in the Life Sciences Week 7
Leetcode-6110: number of incremental paths in the grid graph
Open source storage is so popular, why do we insist on self-development?
高斯消元 AcWing 884. 高斯消元解异或线性方程组
开源存储这么香,为何我们还要坚持自研?
Leetcode heap correlation
【Rust 笔记】17-并发(上)
MySQL advanced part 2: SQL optimization