题目链接 :http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5592 Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sandstar, all…

地址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3960 题目: Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sandstar, a…

题目链接 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3960 题意 首先给出 一系列名字 需要辨别的名字,然后给出Q个问题,每个问题有 若干个人给出答案,给出答案的人 此时状态 为1 没有给出答案 的 状态为0 最后给出 三个需要辨识的状态,如果有且只有一个人 跟这个状态相同 就输出这个人的名字 AC代码 #include <cstdio> #include <cstring> #include <…

比赛的时候用vector交集做的...情况考虑的不全面  wrong到疯 赛后考虑全了情况....T了 果然 set_intersection  不能相信 嗯 不好意思 交集a了  第二个代码 求出来每个1的交集 为0的时候  要减去相同的元素 看最后一个案例的B和K的输出想想为什么 另一个做法就是处理出每个人名的序列 然后输入序列的时候去找一样的 如果只有一个 那就是它了 #include <iostream> #include <cstdio> #include <sst…

怎么说呢...我能说我又过了一道水题? emm... 问题描述: 给定 n 个待确定名字的 Friends 和 q 个问题.已知 c 个 Friends 的名字. 对于第 i 个问题,有  个 Friends 会回答 yes ,其余  个 Friends 均回答 no . 现在给定 n 个待确定名字的 Friends 以及他们对于 q 个问题的回答.若能够确定它的名字,给出:否则,输出 Let's Go to the library!! 思路: 对于回答yes的,在当前人结果上加1,而回答no时…

What Kind of Friends Are You? Time Limit: 1 Second      Memory Limit: 65536 KB Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sands…

What Kind of Friends Are You? Time Limit: 1 Second Memory Limit: 65536 KB Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sandstar,…

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4842 要注意题目中两点: 1.在踏入妖怪控制的区域那一刹那,先减行动力,然后才能杀妖怪 2.在妖怪控制区域行动力也会恢复 3.妖怪也许不在自己的控制区域 #include <cstdio> #include <cstring> #include <algorithm> #include <queue> using namespace st…

#include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> using namespace std; +; ; //堆的元素个数 struct Node{ ]; int para,pri; int t; //用于存储信息加入的顺序,当优先级相同时,t小的先出队列 }node[maxn]; //交换node[a]和node[b]的值 void exchange(…

Description Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What's more, he bought a large decorative chessboard with N rows and M columns. Every day after work, Edward will place…