最近意志力好飘摇..不知道坚不坚持得下去..

这么弱还瞎纠结...可以滚了..

水题都不会做..

LCS (A)

LCS (B)

没有看题

Gym 100989C

1D Cafeteria (B)

不会捉

Gym 100989E

Gym 100989F

Mission in Amman (B)

没看题

Queue (A)

感觉题意理解得有问题啊

 #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 ;
}

Queue (B)

没读题

Objects Panel (A)

觉得很难写,,而且不会写...可是过的人很多啊

没有看出来是个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 ;
}

Objects Panel (B)

没看题

Plus or Minus (A)

Plus or Minus (B)

没看题

Mixed Dimensions

没看题

我好菜啊...............................................

UESTC 2016 Summer Training #1 Div.2的更多相关文章

  1. 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 ...

  2. UESTC 2016 Summer Training #6 Div.2

    我好菜啊.. UVALive 6434 给出 n 个数,分成m组,每组的价值为最大值减去最小值,每组至少有1个,如果这一组只有一个数的话,价值为0 问 最小的价值是多少 dp[i][j] 表示将 前 ...

  3. 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 ...

  4. 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 ...

  5. UESTC 2016 Summer Training #1 J - Objects Panel (A) 按条件遍历树

    #include <iostream> #include <cstdio> #include <vector> using namespace std; typed ...

  6. 2016 Multi-University Training Contests

    2016 Multi-University Training Contest 1 2016 Multi-University Training Contest 2 2016 Multi-Univers ...

  7. 2016 Multi-University Training Contest 2 D. Differencia

    Differencia Time Limit: 10000/10000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Tot ...

  8. 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) ...

  9. 2016 Multi-University Training Contest 1

    8/11 2016 Multi-University Training Contest 1 官方题解 老年选手历险记 最小生成树+线性期望 A Abandoned country(BH) 题意: 1. ...

随机推荐

  1. windows 环境变量 %SystemDrive% 和 %SystemRoot%

    %SYSTEMROOT% == c:\windows (or the root windows directory) %SYSTEMDRIVE% == the drive windows is ins ...

  2. view的封装

    如果一个view内部的子控件比较多,一般会考虑自定义一个view,把它内部子控件的创建屏蔽起来,不让外界关心 外界可以传入对应的模型数据给view,view拿到模型数据后给内部的子控件设置对应的数据 ...

  3. vitamio框架

    import io.vov.vitamio.LibsChecker; import io.vov.vitamio.MediaPlayer; import io.vov.vitamio.MediaPla ...

  4. Android 新手引导

    关于这个Demo的写法很多 我也献上一段 效果图如下 上代码 MainActivity public class MainActivity extends Activity { // public L ...

  5. Swift语言学习之OC和Swift混编

    本文转自http://www.helloswift.com.cn/swiftbase/2015/0112/3469.html iOS OC和Swift混编 1.创建一个swift或者oc的工程:我这里 ...

  6. Microsoft SQL Server

    instance / database / schema / object login / user / schema (dbo) sequence Collation PSM: Both Insta ...

  7. 转!!URL和URI区别

    URI,URL,URN 从上面的那幅图可以看出来,一共有三个不同的概念URI,URL,URN.这讨论这样的问题时,最好的方法就是回到原点啊,这里我们在RFC 3986: Uniform Resourc ...

  8. 虚拟机装centos 桥接方式上网[转]

    http://blog.csdn.net/sunbiao0526/article/details/6804127   虚拟机选择bridge方式连接网络 首先 vi /etc/sysconfig/ne ...

  9. TensorFlow Playground

    A Neural Network Playground Understanding neural networks with TensorFlow Playground 机器之心翻译

  10. WEB网页插件 如何实现 选择上传图片路径 【高级问题】

    发表于 2010-10-22 12:11 | |只看楼主       按键精灵程序里面的WEB网页插件 如何实现 选择上传图片路径 我想在上传图片的选框设置图片路径为 C:\fakepath\001. ...