当前位置:网站首页>博弈论 AcWing 893. 集合-Nim游戏
博弈论 AcWing 893. 集合-Nim游戏
2022-07-05 06:16:00 【T_Y_F666】
博弈论 AcWing 893. 集合-Nim游戏
原题链接
算法标签
数学知识 博弈论 SG函数
思路
若只有一堆石子 SG函数计算
结论
对于多堆石子
SG函数值等于它包含的各个子游戏SG函数值的异或和,即:SG(G) = SG(G1) ^ SG(G2) ^ … ^ SG(Gm),若SG(G)为0, 则必胜, 否则, 必败
其他概念
代码
#include<bits/stdc++.h>
#define int long long
#define abs fabs
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
const int N = 105, M = 10005;
int s[N], f[M];
int k, n;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
void put(int x) {
if(x<0) putchar('-'),x=-x;
if(x>=10) put(x/10);
putchar(x%10^48);
}
int sg(int x){
// f[x]是否已被计算
if(f[x]!=-1){
return f[x];
}else{
// 存储当前局面可以到达的局面
unordered_set<int> S;
rep(i, 0, k){
if(x>=s[i]){
S.insert(sg(x-s[i]));
}
}
// 查找集合中不存在的最小自然数
for(int i=0;;++i){
if(!S.count(i)){
return f[x]=i;
}
}
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
k=read();
rep(i, 0, k){
s[i]=read();
}
n=read();
memset(f, -1, sizeof f);
int ans=0;
rep(i, 0, n){
int x=read();
ans^=sg(x);
}
if(ans){
puts("Yes");
}else{
puts("No");
}
}
原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈
边栏推荐
- leetcode-22:括号生成
- leetcode-556:下一个更大元素 III
- How to understand the definition of sequence limit?
- MySQL advanced part 2: MySQL architecture
- TypeScript 基础讲解
- MySQL advanced part 1: index
- Binary search template
- Appium自动化测试基础 — Appium测试环境搭建总结
- A reason that is easy to be ignored when the printer is offline
- Usage scenarios of golang context
猜你喜欢
Data visualization chart summary (II)
MySQL advanced part 1: stored procedures and functions
1.14 - 流水线
Quickly use Amazon memorydb and build your own redis memory database
Sqlmap tutorial (1)
1.13 - RISC/CISC
Redis publish subscribe command line implementation
leetcode-6111:螺旋矩阵 IV
MySQL advanced part 2: MySQL architecture
4. 对象映射 - Mapping.Mapster
随机推荐
SQLMAP使用教程(二)实战技巧一
leetcode-6108:解密消息
Appium基础 — 使用Appium的第一个Demo
Groupbykey() and reducebykey() and combinebykey() in spark
Usage scenarios of golang context
Chapter 6 relational database theory
leetcode-1200:最小绝对差
One question per day 1447 Simplest fraction
MySQL advanced part 1: stored procedures and functions
Real time clock (RTC)
Shutter web hardware keyboard monitoring
【Rust 笔记】17-并发(上)
Doing SQL performance optimization is really eye-catching
How to understand the definition of sequence limit?
11-gorm-v2-03-basic query
阿里巴巴成立企业数智服务公司“瓴羊”,聚焦企业数字化增长
打印机脱机时一种容易被忽略的原因
Leetcode-6110: number of incremental paths in the grid graph
做 SQL 性能优化真是让人干瞪眼
1.13 - RISC/CISC