题目a:
"Miss Kobayashi's Dragon Maid" is a Japanese manga series written and illustrated by Coolkyoushinja. An anime television series produced by Kyoto Animation aired in Japan between January and April 2017.
In episode 8, two main characters, Kobayashi and Tohru, challenged each other to a cook-off to decide who would make a lunchbox for Kanna's field trip. In order to decide who is the winner, they asked n people to taste their food, and changed their scores according to the feedback given by those people.
There are only four types of feedback. The types of feedback and the changes of score are given in the following table.
| Type | Feedback | Score Change (Kobayashi) | Score Change (Tohru) |
|---|---|---|---|
| 1 | Kobayashi cooks better | +1 | 0 |
| 2 | Tohru cooks better | 0 | +1 |
| 3 | Both of them are good at cooking | +1 | +1 |
| 4 | Both of them are bad at cooking | -1 | -1 |
Given the types of the feedback of these n people, can you find out the winner of the cooking competition (given that the initial score of Kobayashi and Tohru are both 0)?
Input
There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 100), indicating the number of test cases. For each test case:
The first line contains an integer n (1 ≤ n ≤ 20), its meaning is shown above.
The next line contains n integers a1, a2, ... , an (1 ≤ ai ≤ 4), indicating the types of the feedback given by these n people.
OutputFor each test case output one line. If Kobayashi gets a higher score, output "Kobayashi" (without the quotes). If Tohru gets a higher score, output "Tohru" (without the quotes). If Kobayashi's score is equal to that of Tohru's, output "Draw" (without the quotes).
Sample Input2 3 1 2 1 2 3 4Sample Output
Kobayashi DrawHint
For the first test case, Kobayashi gets 1 + 0 + 1 = 2 points, while Tohru gets 0 + 1 + 0 = 1 point. So the winner is Kobayashi.
For the second test case, Kobayashi gets 1 - 1 = 0 point, while Tohru gets 1 - 1 = 0 point. So it's a draw.
龙妹抖还行
简单题没啥说的
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t,n;
cin>>t;
while(t--)
{
cin>>n;
int ko=0,to=0,st;
while(n--)
{
cin>>st;
switch(st)
{
case 1:ko++;break;
case 2:to++;break;
case 3:ko++;to++;break;
case 4:ko--;to--;break;
}
}
if(ko>to)cout<<"Kobayashi"<<endl;
else if(to>ko)cout<<"Tohru"<<endl;
else cout<<"Draw"<<endl;
}
return 0;
}
题目b:
It's time to prepare the problems for the 14th Zhejiang Provincial Collegiate Programming Contest! Almost all members of Zhejiang University programming contest problem setter team brainstorm and code day and night to catch the deadline, and empty bottles of Marjar Cola litter the floor almost everywhere!
To make matters worse, one of the team member fell ill just before the deadline. So you, a brilliant student, are found by the team leader Dai to help the team check the problems' arrangement.
Now you are given the difficulty score of all problems. Dai introduces you the rules of the arrangement:
- The number of problems should lie between 10 and 13 (both inclusive).
- The difficulty scores of the easiest problems (that is to say, the problems with the smallest difficulty scores) should be equal to 1.
- At least two problems should have their difficulty scores equal to 1.
- After sorting the problems by their difficulty scores in ascending order, the absolute value of the difference of the difficulty scores between two neighboring problems should be no larger than 2. BUT, if one of the two neighboring problems is the hardest problem, there is no limitation about the difference of the difficulty scores between them. The hardest problem is the problem with the largest difficulty score. It's guaranteed that there is exactly one hardest problem.
The team members have given you lots of possible arrangements. Please check whether these arrangements obey the rules or not.
Input
There are multiple test cases. The first line of the input is an integer T (1 ≤ T ≤ 104), indicating the number of test cases. Then T test cases follow.
The first line of each test case contains one integer n (1 ≤ n ≤ 100), indicating the number of problems.
The next line contains n integers s1, s2, ... , sn (-1000 ≤ si ≤ 1000), indicating the difficulty score of each problem.
We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.
OutputFor each test case, output "Yes" (without the quotes) if the arrangement follows the rules, otherwise output "No" (without the quotes).
Sample Input8 9 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 11 999 1 1 2 3 4 5 6 7 8 9 11 999 1 3 5 7 9 11 13 17 19 21 10 15 1 13 17 1 7 9 5 3 11 13 1 1 1 1 1 1 1 1 1 1 1 1 2 10 2 3 4 5 6 7 8 9 10 11 10 15 1 13 3 6 5 4 7 1 14Sample Output
No No Yes No Yes Yes No NoHint
The first arrangement has 9 problems only, which violates the first rule.
Only one problem in the second and the fourth arrangement has a difficulty score of 1, which violates the third rule.
The easiest problem in the seventh arrangement is a problem with a difficulty score of 2, which violates the second rule.
After sorting the problems of the eighth arrangement by their difficulty scores in ascending order, we can get the sequence 1, 1, 3, 4, 5, 6, 7, 13, 14, 15. We can easily discover that |13 - 7| = 6 > 2. As the problem with a difficulty score of 13 is not the hardest problem (the hardest problem in this arrangement is the problem with a difficulty score of 15), it violates the fourth rule.
简单模拟没啥说的
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int t,n;
cin>>t;
while(t--)
{
cin>>n;
int arr[200];
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
bool flag=true;
if(arr[0]!=1||arr[1]!=1||n>13||n<10)flag=false;
else
{
int val=1;
for(int pos=2;pos<n-1;pos++)
{
if(arr[pos]>val+2)
{
flag=false;
break;
}
else val=arr[pos];
}
}
if(flag)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
题目c：
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 the animals have become anthropomorphized into girls known as Friends.
Kaban is a young girl who finds herself in Japari Park with no memory of who she was or where she came from. Shy yet resourceful, she travels through Japari Park along with Serval to find out her identity while encountering more Friends along the way, and eventually discovers that she is a human.
However, Kaban soon finds that it's also important to identify other Friends. Her friend, Serval, enlightens Kaban that she can use some questions whose expected answers are either "yes" or "no" to identitfy a kind of Friends.
To be more specific, there are n Friends need to be identified. Kaban will ask each of them q same questions and collect their answers. For each question, she also gets a full list of animals' names that will give a "yes" answer to that question (and those animals who are not in the list will give a "no" answer to that question), so it's possible to determine the name of a Friends by combining the answers and the lists together.
But the work is too heavy for Kaban. Can you help her to finish it?
Input
There are multiple test cases. The first line of the input is an integer T (1 ≤ T ≤ 100), indicating the number of test cases. Then T test cases follow.
The first line of each test case contains two integers n (1 ≤ n ≤ 100) and q (1 ≤ q ≤ 21), indicating the number of Friends need to be identified and the number of questions.
The next line contains an integer c (1 ≤ c ≤ 200) followed by c strings p1, p2, ... , pc (1 ≤ |pi| ≤ 20), indicating all known names of Friends.
For the next q lines, the i-th line contains an integer mi (0 ≤ mi ≤ c) followed by mi strings si, 1, si, 2, ... , si, mi (1 ≤ |si, j| ≤ 20), indicating the number of Friends and their names, who will give a "yes" answer to the i-th question. It's guaranteed that all the names appear in the known names of Friends.
For the following n lines, the i-th line contains q integers ai, 1, ai, 2, ... , ai, q (0 ≤ ai, j ≤ 1), indicating the answer (0 means "no", and 1 means "yes") to the j-th question given by the i-th Friends need to be identified.
It's guaranteed that all the names in the input consist of only uppercase and lowercase English letters.
OutputFor each test case output n lines. If Kaban can determine the name of the i-th Friends need to be identified, print the name on the i-th line. Otherwise, print "Let's go to the library!!" (without quotes) on the i-th line instead.
Sample Input2 3 4 5 Serval Raccoon Fennec Alpaca Moose 4 Serval Raccoon Alpaca Moose 1 Serval 1 Fennec 1 Serval 1 1 0 1 0 0 0 0 1 0 0 0 5 5 11 A B C D E F G H I J K 3 A B K 4 A B D E 5 A B K D E 10 A B K D E F G H I J 4 B D E K 0 0 1 1 1 1 0 1 0 1 1 1 1 1 1 0 0 1 0 1 1 0 1 1 1Sample Output
Serval Let's go to the library!! Let's go to the library!! Let's go to the library!! Let's go to the library!! B Let's go to the library!! KHint
The explanation for the first sample test case is given as follows:
As Serval is the only known animal who gives a "yes" answer to the 1st, 2nd and 4th question, and gives a "no" answer to the 3rd question, we output "Serval" (without quotes) on the first line.
As no animal is known to give a "no" answer to all the questions, we output "Let's go to the library!!" (without quotes) on the second line.
Both Alpaca and Moose give a "yes" answer to the 1st question, and a "no" answer to the 2nd, 3rd and 4th question. So we can't determine the name of the third Friends need to be identified, and output "Let's go to the library!!" (without quotes) on the third line.
是会敲代码的friends呢
一个模拟的题，写的时候脑子晕调了半天
题的意思就是说，给一个特性表，和一群friends，每个特性对应若干个friends
然后给一个表，里面是若干个friends和特性表的对应情况，这里不知道这个表上都是哪些friends，要你判断都是谁对谁
判断条件一个是和特性表的对应情况，完全对应的就是了
可能出现匹配不上的情况，如果有出现多个friends的特性一样也算作匹配不上
这个题按照意思套stl就好了，数据量不大可以套的比较随性
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int t,n,q;
cin>>t;
while(t--)
{
cin>>n>>q;
int num;
map<string,vector<int> >mp;
cin>>num;
string index[205],cur;
for(int i=1;i<=num;i++)
{
cin>>cur;
mp[cur].resize(q);
}
for(int i=0;i<q;i++)
{
int su;
cin>>su;
for(int j=0;j<su;j++)
{
cin>>cur;
mp[cur][i]=1;
}
}
for(map<string,vector<int> >::iterator it1=mp.begin();it1!=mp.end();it1++)
{
if( (*it1).second[0]==-1)continue;
else
{
map<string,vector<int> >::iterator it2=it1;
it2++;
bool flag=false;
for(;it2!=mp.end();it2++)
{
if( ((*it1).second==(*it2).second) )
{
(*it2).second[0]=-1;
flag=true;
}
}
if(flag)(*it1).second[0]=-1;
}
}
for(int i=0;i<n;i++)
{
vector<int> vec;
vec.clear();
int curr;
for(int j=0;j<q;j++)
{
cin>>curr;
vec.push_back(curr);
}
bool flag=true;
for(map<string,vector<int> >::iterator it=mp.begin();it!=mp.end();it++)
{
if( ((*it).second==vec) )
{
index[i]=(*it).first;
flag =false;
break;
}
}
if(flag)index[i]="Let's go to the library!!";
}
for(int i=0;i<n;i++)
cout<<index[i]<<endl;
}
return 0;
}
题目d:
ACM (ACMers' Chatting Messenger) is a famous instant messaging software developed by Marjar Technology Company. To attract more users, Edward, the boss of Marjar Company, has recently added a new feature to the software. The new feature can be described as follows:
If two users, A and B, have been sending messages to each other on the last m consecutive days, the "friendship point" between them will be increased by 1 point.
More formally, if user A sent messages to user B on each day between the (i - m + 1)-th day and the i-th day (both inclusive), and user B also sent messages to user A on each day between the (i - m + 1)-th day and the i-th day (also both inclusive), the "friendship point" between A and B will be increased by 1 at the end of the i-th day.
Given the chatting logs of two users A and B during n consecutive days, what's the number of the friendship points between them at the end of the n-th day (given that the initial friendship point between them is 0)?
Input
There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 10), indicating the number of test cases. For each test case:
The first line contains 4 integers n (1 ≤ n ≤ 109), m (1 ≤ m ≤ n), x and y (1 ≤ x, y ≤ 100). The meanings of n and m are described above, while x indicates the number of chatting logs about the messages sent by A to B, and y indicates the number of chatting logs about the messages sent by B to A.
For the following x lines, the i-th line contains 2 integers la, i and ra, i (1 ≤ la, i ≤ ra, i ≤ n), indicating that A sent messages to B on each day between the la, i-th day and the ra, i-th day (both inclusive).
For the following y lines, the i-th line contains 2 integers lb, i and rb, i (1 ≤ lb, i ≤ rb, i ≤ n), indicating that B sent messages to A on each day between the lb, i-th day and the rb, i-th day (both inclusive).
It is guaranteed that for all 1 ≤ i < x, ra, i + 1 < la, i + 1 and for all 1 ≤ i < y, rb, i + 1 < lb, i + 1.
OutputFor each test case, output one line containing one integer, indicating the number of friendship points between A and B at the end of the n-th day.
Sample Input2 10 3 3 2 1 3 5 8 10 10 1 8 10 10 5 3 1 1 1 2 4 5Sample Output
3 0Hint
For the first test case, user A and user B send messages to each other on the 1st, 2nd, 3rd, 5th, 6th, 7th, 8th and 10th day. As m = 3, the friendship points between them will be increased by 1 at the end of the 3rd, 7th and 8th day. So the answer is 3.
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int t,n,m,x,y;
cin>>t;
while(t--)
{
cin>>n>>m>>x>>y;
pair<int,int>a[200],b[200];
for(int i=0;i<x;i++)
cin>>a[i].first>>a[i].second;
for(int i=0;i<y;i++)
cin>>b[i].first>>b[i].second;
int ans=0;
for(int apos=0;apos<x;apos++)
for(int bpos=0;bpos<y;bpos++)
{
int st=max(a[apos].first,b[bpos].first),en=min(a[apos].second,b[bpos].second);
if(en-st>=m-1)ans+=en-st-m+2;
}
cout<<ans<<endl;
}
return 0;
}
题目f:
A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every node is labelled with exactly one element from the sequence S, and for every non-root node si and its parent sj, sj ≤ si and j < i hold. Each element in sequence S can be used to label a node in tree T only once.
Chiaki has a sequence a1, a2, ..., an, she would like to decompose it into a minimum number of heapable subsequences.
Note that a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.
Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
The first line contain an integer n (1 ≤ n ≤ 105) — the length of the sequence.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n).
It is guaranteed that the sum of all n does not exceed 2 × 106.
OutputFor each test case, output an integer m denoting the minimum number of heapable subsequences in the first line. For the next m lines, first output an integer Ci, indicating the length of the subsequence. Then output Ci integers Pi1, Pi2, ..., PiCi in increasing order on the same line, where Pij means the index of the j-th element of the i-th subsequence in the original sequence.
Sample Input4 4 1 2 3 4 4 2 4 3 1 4 1 1 1 1 5 3 2 1 4 1Sample Output
1 4 1 2 3 4 2 3 1 2 3 1 4 1 4 1 2 3 4 3 2 1 4 1 2 2 3 5
意思是给n个数，拿他们一个个的去盖小根堆，盖的时候不能移位，就是说之前盖出来的就定住了，如果一个数盖不进之前的堆了的话，就那它新建一个堆。
是一个模拟但是要stl优化的题，一开始做的时候直接模拟然后t了，想不出来了上csdn上看见了set加反向lower_bound优化的神奇操作，然后还是卡了贼久才做出来
这个题的数据卡的紧，sync_with_stdio(false)的cincout都会t，所以必须拿lower_bound来优化
这个优化的思路是拿一个set存俩孩子还没满的节点，利用set的性质，让他按照节点权值有序排列，然后lower_bound正好可以搞出来需要的位置，然后一通模拟
#include <bits/stdc++.h>
using namespace std;
const int maxn=100005;
int main()
{
// ios::sync_with_stdio(false);
int t,n;
//cin>>t;
scanf("%d",&t);
while(t--)
{
//cin>>n;
scanf("%d",&n);
set<pair<int,int> >st;
bool son[maxn];
int treenum[maxn];
vector<vector<int> >ans;
int lastreenum=-1; st.clear();
for(int tpos=1;tpos<=n;tpos++)
{
int tval;
//cin>>tval;
scanf("%d",&tval);
set<pair<int,int> >::iterator it=st.lower_bound(make_pair(-tval,-tpos));
if(it==st.end())
{
lastreenum++;
treenum[tpos]=lastreenum;
vector<int>nu(0);
ans.push_back(nu);
ans[ans.size()-1].push_back(tpos);
son[tpos]=false;
st.insert(make_pair(-tval,-tpos));
}
else
{
int fapos=-(*it).second;
treenum[tpos]=treenum[fapos];
st.insert(make_pair(-tval,-tpos));
son[tpos]=false;
if(son[fapos])
{
st.erase(it);
}
else son[fapos]=true;
ans[treenum[tpos]].push_back(tpos);
}
}
// cout<<ans.size()<<endl;
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)
{
//cout<<ans[i].size();
printf("%d",ans[i].size());
for(int j=0;j<ans[i].size();j++)
{
//cout<<" "<<ans[i][j];
printf(" %d",ans[i][j]);
}
// cout<<endl;
puts("");
}
}
return 0;
}
276
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
