2019 杭电多校 8 1011 题目链接:HDU 6667 比赛链接:2019 Multi-University Training Contest 8 Problem Description Roundgod is a famous milk tea lover at Nanjing University second to none. This year, he plans to conduct a milk tea festival. There will be \(n\) classes…
题意:有n个班级,每个班级有a[i]个人,b[i]杯奶茶 每个人至多喝一杯奶茶,且不能喝自己班的 问能喝到奶茶的最多总人数 n<=1e6,a[i],b[i]<=1e9 思路: 做法一: #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int,int&…
hdu题面 Time limit 6000 ms Memory limit 131072 kB OS Windows Source 2019 Multi-University Training Contest 8 吐槽 比赛时候一眼网络流,但数据范围显然不行,又看到这道题提交人数贼多,于是转向尝试各种贪心,什么两边都取最大值.一边取最大值另一边取最小值.两边都取最小值--很多贪心方法都自己出数据hack掉了,想不到怎么hack的思路再写网络流生成随机数据对拍,拍几百组没错再交,但还是WA个不停-…
题目链接 Problem Description Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest. Here are some…
Solved Pro.ID Title Ratio(Accepted / Submitted) 1001 Acesrc and Cube Hypernet 7.32%(3/41) 1002 Acesrc and Girlfriend 4.35%(2/46) 1003 Acesrc and Good Numbers 暴力打表 24.80%(213/859) 1004 Acesrc and Hunting 21.74%(90/414) 1005 Acesrc and String…
HDU Multi-University Training Contest 题目来源 题目 知识点 时间复杂度 完成情况 2019 Contest8 A Acesrc and Cube Hypernet 2019 Contest8 B Acesrc and Girlfriend 2019 Contest8 C Acesrc and Good Numbers 2019 Contest8 D Acesrc and Hunting 2019 Contest8 E Acesrc and String T…