题目链接:http://ac.jobdu.com/problem.php?pid=1162 详解链接:https://github.com/zpfbuaa/JobduInCPlusPlus 参考代码: // // 1162 I Wanna Go Home.cpp // Jobdu // // Created by PengFei_Zheng on 20/04/2017. // Copyright © 2017 PengFei_Zheng. All rights reserved. // #inc…

题目链接: https://acm.bnu.edu.cn/v3/problem_show.php?pid=52308 We don't wanna work! Time Limit: 60000msMemory Limit: 524288KB 题意 acm协会的人员按努力值排序,只有前20%(向下取整)的人努力工作,现在会有人员变动(增加一个人进来或减少一个人),人员变动会导致一些人从不努力变成努力或从努力变成不努力,现在给你人员的变动情况,输出对于的日志. 增加一个人:先输出这个人归属,然后输…

I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 485    Accepted Submission(s): 191 Special Judge Problem Description Recently Rikka falls in love with an old bu…

I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 60    Accepted Submission(s): 16 Special Judge Problem Description Recently Rikka falls in love with an old but…

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5308 题面: I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 602    Accepted Submission(s): 249 Special Judge Proble…

Problem description There is a game called "I Wanna Be the Guy", consisting of n levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game. Little X can pass only p levels of the game. And Littl…

I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 897    Accepted Submission(s): 379Special Judge Problem Description Recently Rikka falls in love with an old but…

上周末登了次山,回来就各种矫情犯懒.今天周四一周又要完蛋,我发现自己真的是对时间流逝无可奈何.然后中午看了把小码哥网站还有MJ博客什么的,各种首期班大爆照,心中羞愧无比.年纪大也不能放弃自己啊,要不人生怎么活?虽然我是第七期或者第八期的,现在也要做好准备啊.foundation快看完了,电脑下周才能给送过来,各种耐心,现在唯一不在我计划内的就是钱的预算,只能说明这真的不是我控制的了的坑爹公司啊. 对于我这种负能量爆棚,存在感极低,超级悲观主义者来说,什么成功学都是胡扯,自己什么样的咸鱼自己清楚,…

We don't wanna work! [JAG Asia 2016] 两个set,一个代表工作的,一个代表不工作的 其实是一个很简单的模拟,但是我竟然排序之前标号.... 检查代码的时候要从头开始检查.. #include <bits/stdc++.h> using namespace std; const int maxn = 1e5+7; struct node { char s[25]; int ti,fen; bool operator<(const node&r)c…

题目链接 https://acm.bnu.edu.cn/v3/contest_show.php?cid=8504#problem/C 代码如下: #include <iostream> #include <algorithm> #include <stdio.h> #include <cstring> #include <queue> #include <bitset> #include <set> #include &l…