论文地址:https://arxiv.org/abs/2504.12782 项目代码:https://github.com/lileyang1210/ANT
基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Ot...
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Ot...
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Ot...
基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题
Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/O...
Time Limit: 2 Sec Memory Limit: 128 MB Submit: 85 Solved: 13 Sub...
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/...
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Ot...
FatMouse believes that the fatter a mouse is, the faster it runs. To disprove th...
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/O...
Time Limit: 10 Sec Memory Limit: 259 MB Submit: 2486 Solved: 1572 ...
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Ot...
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Ot...
题意:给出n个物品,分别给出起始价格和促销后价格(促销后的有可能更贵),但是要求打折前至少买k件物品。最后计算买完所有物品最少需要多少钱。
John Doe started thinking about graphs. After some thought he decided that he wa...
如果不行的话,让连续的k道题都对的情况靠前。然后求连续k*ant道题全对的分数,加上剩余的题数*1就是最后的最小分数了。