Codeforces Round #197 (Div. 2) / 339C Xenia and Weights (爆搜)
来源:互联网 发布:树莓派3 网络配置 编辑:程序博客网 时间:2024/04/30 08:02
http://codeforces.com/contest/339/problem/C
爆搜水过,复杂度貌似是O(m)的?
/*62ms,4KBm*/#include<cstdio>int m, ans[1005]; ///ans从1开始char s[15];bool ok;///O(m)复杂度?int dfs(int deep, int diff) /// diff表示重量之差{if (deep <= m)for (int &now = ans[deep] = diff + 1; now <= 10; now++) ///稍微运用下引用if (now != ans[deep - 1] && s[now - 1] == '1' && dfs(deep + 1, now - diff))return true;return ok = (deep > m);}int main(){scanf("%s%diff", &s, &m);puts(dfs(1, 0) ? "YES" : "NO");if (ok) for (int i = 0; i < m; printf("%d ", ans[++i]));return 0;}
0 0
- Codeforces Round #197 (Div. 2) C. Xenia and Weights - 搜索
- Codeforces Round #197 (Div. 2) c. Xenia and Weights
- [DP] Codeforces Round #197 (Div. 2) C. Xenia and Weights
- Codeforces Round #197 (Div. 2) / 339C Xenia and Weights (爆搜)
- Codeforces Round #197 (Div. 2) -- C. Xenia and Weights (DFS回溯)
- Codeforces Round #197 (Div. 2) C. Xenia and Weights(DFS)
- Codeforces 339C Xenia and Weights
- codeforces 339C C. Xenia and Weights(dp)
- CodeForces 339C Xenia and Weights (简单dfs/dp)
- Codeforces 339C Xenia and Weights DP+打印路径
- Codeforces Round #197 (Div. 2) B. Xenia and Ringroad
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- Codeforces Round #197 (Div. 2)B. Xenia and Ringroad
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- Codeforces Round #199 (Div. 2) A. Xenia and Divisors
- Codeforces Round #199 (Div. 2) B. Xenia and Spies
- Codeforces Round #199(Div. 2) B. Xenia and Spies
- Codeforces Round #207 (Div. 2) D. Xenia and Hamming
- iOS定时器NSTimer使用详解
- Redis特性分析
- EditText设置启动时默认的焦点,防止启动打开软键盘
- 吉布斯采样
- PHP中数据抓取
- Codeforces Round #197 (Div. 2) / 339C Xenia and Weights (爆搜)
- android获取sd卡最后一张照片
- ARM 开发板SD卡和NAND的启动过程
- Pyquery element内部所有函数
- 应用调试之使用gdb和gdbserver
- Discuz3.1或dz所有版本实现分区版块forum.php?gid= 伪静态的方法
- 解决wmsys.wm_concat在11G不兼容问题
- 使用 CXF 做 webservice 简单例子
- js实例化以及constructor探究