UESTC 2016 Summer Training #1 Div.2
最近意志力好飘摇..不知道坚不坚持得下去..
这么弱还瞎纠结...可以滚了..
水题都不会做..
水
没有看题
水
不会捉
水
水
没看题
感觉题意理解得有问题啊
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n,f[],c[],b[],cnt[]; int check(int x){
for(int i = ;i >= ;i--){
int cc = x/b[i];
if(cc > cnt[b[i]]) return ;
cnt[b[i]] -= cc;
x -= b[i]*cc;
}
return ;
} void solve(){
int tot;
b[]=;b[]=;b[]=;b[]=;b[]=;
memset(c,,sizeof(c));
memset(cnt,,sizeof(cnt));
int ok = ;
for(int i = ;i <= n;i++){
scanf("%d",&tot);
int tmp = ,yu = ;
for(int j = ;j <= ;j++){
scanf("%d",&c[j]);
tmp += c[j]*b[j];
cnt[b[j]] += c[j];
}
yu = tmp-tot;
if(!check(yu)) ok = ;
} if(ok == ) puts("no");
else puts("yes");
} int main(){
while(scanf("%d",&n) != EOF){
solve();
}
return ;
}
没读题
觉得很难写,,而且不会写...可是过的人很多啊
没有看出来是个dfs...
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int n,m,a[];
vector<int> g[]; void dfs(int u,int cnt){
for(int i = ;i < cnt-;i++) printf(" ");
if(g[u].size()){
if(a[u]) printf("- ");
else printf("+ ");
}
else printf(" ");
if(u == ) printf("project\n");
else printf("object%d\n",u);
if(a[u]){
for(int i = ;i < g[u].size();i++){
int v = g[u][i];
dfs(v,cnt+);
}
}
} int main(){
scanf("%d",&n);
memset(a,,sizeof(a));
for(int i = ;i <= n;i++) g[i].clear();
char s[];
for(int i = ;i <= n;i++){
scanf("%s %d",s,&m);
int x;
for(int j = ;j < m;j++){
scanf("%d",&x);
g[i].push_back(x);
}
if(s[] == '-') a[i] = ;
}
dfs(,);
return ;
}
没看题
水
没看题
没看题
我好菜啊...............................................
UESTC 2016 Summer Training #1 Div.2的更多相关文章
- The Solution of UESTC 2016 Summer Training #1 Div.2 Problem C
Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/C Description standard input/output After ...
- UESTC 2016 Summer Training #6 Div.2
我好菜啊.. UVALive 6434 给出 n 个数,分成m组,每组的价值为最大值减去最小值,每组至少有1个,如果这一组只有一个数的话,价值为0 问 最小的价值是多少 dp[i][j] 表示将 前 ...
- The Solution of UESTC 2016 Summer Training #1 Div.2 Problem B
Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/B Description standard input/output Althou ...
- The Solution of UESTC 2016 Summer Training #1 Div.2 Problem A
Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/A Description standard input/output Haneen ...
- UESTC 2016 Summer Training #1 J - Objects Panel (A) 按条件遍历树
#include <iostream> #include <cstdio> #include <vector> using namespace std; typed ...
- 2016 Multi-University Training Contests
2016 Multi-University Training Contest 1 2016 Multi-University Training Contest 2 2016 Multi-Univers ...
- 2016 Multi-University Training Contest 2 D. Differencia
Differencia Time Limit: 10000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Tot ...
- 2016 Multi-University Training Contest 1 G. Rigid Frameworks
Rigid Frameworks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) ...
- 2016 Multi-University Training Contest 1
8/11 2016 Multi-University Training Contest 1 官方题解 老年选手历险记 最小生成树+线性期望 A Abandoned country(BH) 题意: 1. ...
随机推荐
- [资源] Resources on Self-Driving Car
Talk NVIDIA at CES 2016 - Self Driving Cars and Deep Learning GPUs Projects Autoware Open-source sof ...
- Codeforces Round #382 (Div. 2) D. Taxes 歌德巴赫猜想
题目链接:Taxes D. Taxes time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
- 排序算法 & 迷宫的深度, 广度优先
内容提要 1. 我掌握的排序算法的时间复杂度 2. 我掌握的6种排序算法(插入, 冒泡, 选择, 归并, 快速, 希尔) 3. 迷宫的搜索方法(深度优先 + 广度优先) 各种排序的时间复杂度 名称 稳 ...
- mysql与mysqld
mysql是客户机/服务器的结构. mysql是客户端行工具,连接mysqld服务,执行sql命令,可认为客户端sdk mysqld 启动mysql数据库服务. 脚本启动mysql服务的命令是 net ...
- SurfaceHolder.Callback
Class Overview A client may implement this interface to receive information about changes to the sur ...
- 列车时刻表查询 jqm/ajax/xml
<!doctype html><html lang="en"><head> <meta charset="UTF-8" ...
- C++调用C中编译过的函数要加extern "C"
C++语言支持函数重载,C语言不支持函数重载.函数被C++编译后在库中的名字与C语言的不同.假设某个C 函数的声明如下:void foo(int x, int y);该函数被C 编译器编译后在库中的名 ...
- 串行通讯之UARTLoopback
目录 第1章串行通讯之UARTLoopback 2 1 USB转串口 2 2 USB Accessory 2 3 连入手机 3 4 代码改进 4 5 打开串口 4 ...
- 浅谈全区全服架构的SNS游戏后台
版权声明:本文由梁本志原创文章,转载请注明出处: 文章原文链接:https://www.qcloud.com/community/article/198 来源:腾云阁 https://www.qclo ...
- win8style布局
<?xml version="1.0" encoding="utf-8"?><LinearLayout xmlns:android=" ...